AIJ - 4

• (2025). Pandora's box problem with time constraints. AIJ, 349, 104426. (www)

  @article{ , abstract = {The Pandora's Box problem models the search for the best alternative when evaluation is costly. In the simplest variant, a decision maker is presented with n boxes, each associated with a cost of inspection and a hidden random reward. The decision maker inspects a subset of these boxes one after the other, in a possibly adaptive order, and gains the difference between the largest revealed reward and the sum of the inspection costs. Although this classic version is well understood (Weitzman 1979), there is a flourishing recent literature on variants of the problem. Here we introduce a general framework—the Pandora's Box Over Time problem—that captures a wide range of variants where time plays a role, e.g., by constraining the schedules of exploration and influencing costs and rewards. In our framework, boxes have time-dependent rewards and costs, whereas inspection may require a box-specific processing time. Moreover, once a box is inspected, its reward may deteriorate over time. Our main result is an efficient constant-factor approximation to the optimal strategy for the Pandora's Box Over Time problem, which is generally NP-hard to compute. We further obtain improved results for the natural special cases where boxes have no processing time, boxes are available only in specific time slots, or when costs and reward distributions are time-independent (but rewards may still deteriorate after inspection).}, archive = {J_AIJ}, author = {Georgios Amanatidis and Ben Berger and Tomer Ezra and Michal Feldman and Federico Fusco and Rebecca Reiffenhäuser and Artem Tsikiridis}, doi = {10.1016/j.artint.2025.104426}, journal = {Artificial Intelligence}, month = {12}, pages = {104426}, shortjournal = {Artif. Intell.}, title = {Pandora's box problem with time constraints}, volume = {349}, year = {2025}, }
• (2025). Defending a city from multi-drone attacks: A sequential stackelberg security games approach. AIJ, 349, 104425. (www)

  @article{ , abstract = {To counter an imminent multi-drone attack on a city, defenders have deployed drones across the city. These drones must intercept/eliminate the threat, thus reducing potential damage from the attack. We model this as a Sequential Stackelberg Security Game, where the defender first commits to a mixed sequential defense strategy, and the attacker then best responds. We develop an efficient algorithm called S2D2, which outputs a defense strategy. We demonstrate the efficacy of S2D2 in extensive experiments on data from 80 real cities, improving the performance of the defender in comparison to greedy heuristics based on prior works. We prove that under some reasonable assumptions about the city structure, S2D2 outputs an approximate Strong Stackelberg Equilibrium (SSE) with a convenient structure.}, archive = {J_AIJ}, author = {Dolev Mutzari and Tonmoay Deb and Cristian Molinaro and Andrea Pugliese and V.S. Subrahmanian and Sarit Kraus}, doi = {10.1016/j.artint.2025.104425}, journal = {Artificial Intelligence}, month = {12}, pages = {104425}, shortjournal = {Artif. Intell.}, title = {Defending a city from multi-drone attacks: A sequential stackelberg security games approach}, volume = {349}, year = {2025}, }
• (2025). Optimal bailouts and strategic debt forgiveness in financial networks. AIJ, 349, 104424. (www)

  @article{ , abstract = {A financial system is represented by a network, where nodes correspond to banks, and directed labeled edges correspond to debt contracts between banks. Once a payment schedule has been defined, the liquidity of the system is defined as the sum of total payments made in the network. Maximizing systemic liquidity is a natural objective of any financial authority, so, we study the setting where the financial authority offers bailout money to some bank(s) or forgives the debts of others in order to help them avoid costs related to default, and, hence, maximize liquidity. We investigate the approximation ratio provided by the greedy bailout policy compared to the optimal one, and we study the computational hardness of finding the optimal debt-removal and budget-constrained optimal bailout policy, respectively. We also study financial systems from a game-theoretic standpoint. We observe that the removal of some incoming debt might be in the best interest of a bank, if that helps one of its borrowers remain solvent and avoid costs related to default. Assuming that a bank's well-being (i.e., utility) is aligned with the incoming payments they receive from the network, we define and analyze a game among banks who want to maximize their utility by strategically giving up some incoming payments. In addition, we extend the previous game by considering bailout payments. After formally defining the above games, we prove results about the existence and quality of pure Nash equilibria, as well as the computational complexity of finding such equilibria.}, archive = {J_AIJ}, author = {Panagiotis Kanellopoulos and Maria Kyropoulou and Hao Zhou}, doi = {10.1016/j.artint.2025.104424}, journal = {Artificial Intelligence}, month = {12}, pages = {104424}, shortjournal = {Artif. Intell.}, title = {Optimal bailouts and strategic debt forgiveness in financial networks}, volume = {349}, year = {2025}, }
• (2025). The topology of surprise. AIJ, 349, 104423. (www)

  @article{ , abstract = {In this paper we present a topological epistemic logic, with modalities for knowledge (modelled as the universal modality), knowability (represented by the topological interior operator), and unknowability of the actual world. The last notion has a non-self-referential reading (modelled by Cantor derivative: the set of limit points of a given set) and a self-referential one (modelled by Cantor's perfect core of a given set: its largest subset without isolated points, where x is isolated iff { x } is open). We completely axiomatize this logic, showing that it is decidable and pspace -complete, and we apply it to the analysis of a famous epistemic puzzle: the Surprise Exam Paradox.}, archive = {J_AIJ}, author = {Alexandru Baltag and Nick Bezhanishvili and David Fernández-Duque}, doi = {10.1016/j.artint.2025.104423}, journal = {Artificial Intelligence}, month = {12}, pages = {104423}, shortjournal = {Artif. Intell.}, title = {The topology of surprise}, volume = {349}, year = {2025}, }

AMC - 9

• (2026). Improved WENO finite difference method: Treating the multiple discontinuities. AMC, 512, 129762. (www)

  @article{ , abstract = {The classical weighted essentially non-oscillatory method (WENO) performs well in solving hyperbolic conservation laws, but may encounter the numerical instability while treating multiple discontinuities due to the use of equal-width substencils. In order to overcome this problem, we propose an improved WENO finite difference method, namely WENO-rp2. The WENO-rp2 uses r + 2 candidate substencils, which can be divided into two groups, the first group S 1 consists of the classical r r-point substencils and the other group S 2 consists of 2 2-point substencils. Then by introducing a TENO-like switching mechanism, S 2 is used for the final WENO-rp2 reconstruction if the classical one can not handle the multiple discontinuities or is too biased, otherwise S 1 is used. By doing so, the WENO-rp2 maintains the optimal ( 2 r − 1 ) th order of accuracy in the smooth region, avoids the non-physical oscillation near multiple discontinuities, and is more central, but does not significantly increase the computational cost and numerical dissipation.}, archive = {J_AMC}, author = {Jian Ming Wu and Cong Huang}, doi = {10.1016/j.amc.2025.129762}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129762}, shortjournal = {Appl. Math. Comput.}, title = {Improved WENO finite difference method: Treating the multiple discontinuities}, volume = {512}, year = {2026}, }
• (2026). A novel method for manipulating polynomial curves by the Gauss–Legendre control polygon with points interpolating property. AMC, 512, 129760. (www)

  @article{ , abstract = {Gauss–Legendre (GL) curves have recently been introduced, offering a significant advancement over traditional Bézier curves. These curves exhibit remarkable properties, particularly in high-degree cases, where the GL control polygon closely approximates the resulting curve. This is in stark contrast to the much larger Bézier control polygon, which poses practical challenges for curve design. While GL curves retain the endpoint interpolation property, their control over intermediate curve points is limited, as the direct influence of the control polygon is confined to the hodograph at the nodes. To address the challenge of refining high-degree polynomial curves to pass through specific points, we propose a novel method that extends the functionality of GL control polygons to achieve point interpolation. This approach allows for simultaneous control of both the hodograph and the curve itself, ensuring that the curve passes through designated points. We describe the construction of suitable polynomials to serve as weights, facilitating the representation of a curve as a combination of control points. By utilizing these polynomials, we introduce a methodology for directly manipulating both the hodograph and the interpolation points at the nodes, thereby enhancing the precision and flexibility of polynomial curve design using GL polygons.}, archive = {J_AMC}, author = {Soo Hyun Kim and Hwan Pyo Moon and Song-Hwa Kwon}, doi = {10.1016/j.amc.2025.129760}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129760}, shortjournal = {Appl. Math. Comput.}, title = {A novel method for manipulating polynomial curves by the Gauss–Legendre control polygon with points interpolating property}, volume = {512}, year = {2026}, }
• (2026). Stability analysis of extended canonical euler splitting method for nonlinear composite stiff neutral functional differential-algebraic equations. AMC, 512, 129758. (www)

  @article{ , abstract = {In this paper, an extended canonical Euler splitting method is proposed to solve numerically nonlinear composite stiff neutral functional differential-algebraic equations. Under appropriate assumptions, the stability of this method is shown theoretically. Some numerical experiments are provided, which confirm theoretical results.}, archive = {J_AMC}, author = {Weijie Wang and Hongliang Liu and Haodong Li and Shoufu Li}, doi = {10.1016/j.amc.2025.129758}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129758}, shortjournal = {Appl. Math. Comput.}, title = {Stability analysis of extended canonical euler splitting method for nonlinear composite stiff neutral functional differential-algebraic equations}, volume = {512}, year = {2026}, }
• (2026). Hemivariational inequalities and controllability results for second-order non-autonomous evolution system with impulsive effects. AMC, 512, 129750. (www)

  @article{ , abstract = {This research investigates the crucial concept of approximate controllability for a class of complex dynamical systems: second-order neutral non-autonomous evolution systems in Hilbert spaces. These systems, characterized by inherent memory effects (due to the neutral term) and non-smooth behavior (modeled by hemivariational inequalities), pose significant analytical challenges. We begin by rigorously establishing the existence of mild solutions for this intricate system. This crucial step relies on a powerful combination of mathematical tools, including cosine functions, a robust fixed-point technique, and the generalized Clarke’s subdifferential, which effectively handles the non-smoothness arising from the hemivariational inequalities. Building upon this foundation, we delve into the core objective: approximate controllability. This fundamental property explores the system’s ability to be arbitrarily close to any desired target state through judicious selection of control inputs. We derive sufficient conditions for approximate controllability, providing valuable insights into the system’s controllability characteristics. Finally, to underscore the practical significance of our theoretical findings, we present a concrete application demonstrating the developed theory’s efficacy in addressing real-world problems.}, archive = {J_AMC}, author = {Doha A. Kattan and Hasanen A. Hammad}, doi = {10.1016/j.amc.2025.129750}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129750}, shortjournal = {Appl. Math. Comput.}, title = {Hemivariational inequalities and controllability results for second-order non-autonomous evolution system with impulsive effects}, volume = {512}, year = {2026}, }
• (2026). Belonging and refueling: Group dynamics in foraging flocks. AMC, 512, 129748. (www)

  @article{ , abstract = {We extend the Couzin collective motion model with energy–dependent foraging, where agents balance two competing motivations: remaining with the group versus breaking away to refuel. While both behaviors are individually driven, they reflect different priorities–social cohesion versus physiological need. Our results bridge foraging theory with collective motion, revealing how state-dependent behavioral switching produces phase transitions with implications for collective decision-making in natural systems and autonomous swarm design. Local repulsion–orientation–attraction interactions produce group behavior, whereas refueling requires an intentional defection from this emergent cohesion. Our model explores how agents switch between these internally motivated but functionally distinct behaviors and how this switching gives rise to collective phase transitions. Environmental constraints like ground repulsion radius restrict parameter regions supporting coherent motion while preserving energy balance, showing maintained foraging performance despite spatial limitations.}, archive = {J_AMC}, author = {Junhe Qiao and Shannon Dee Algar and Thomas Stemler}, doi = {10.1016/j.amc.2025.129748}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129748}, shortjournal = {Appl. Math. Comput.}, title = {Belonging and refueling: Group dynamics in foraging flocks}, volume = {512}, year = {2026}, }
• (2026). American option pricing with model constrained gaussian process regressions. AMC, 512, 129747. (www)

  @article{ , abstract = {This article introduces a novel method based on Gaussian process regression for pricing American options. The variational partial differential equation (PDE) governing option prices is converted into a non-linear penalized Feynman-Kac equation (PFK). We propose an iterative algorithm to manage the non-linearity of the PFK operator. We sample state variables in the PDE’ s inner domain and on the terminal boundary. At each step, we fit a constrained regression function approximating the option price. This function matches the option payoffs on the boundary sample while satisfying the PFK PDE on the inner sample. The non-linear term in this PDE is frozen and valued with the price estimate from the previous iteration. We adopt a Bayesian framework in which payoffs and the value of the FK PDE in the boundary and inner samples are noised. Assuming the regression function is a Gaussian process, we find a closed-form approximation of option prices. In the numerical illustration, we evaluate American put options in the Heston, Black-Scholes models and in the two-factor Hull-White model.}, archive = {J_AMC}, author = {Donatien Hainaut}, doi = {10.1016/j.amc.2025.129747}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129747}, shortjournal = {Appl. Math. Comput.}, title = {American option pricing with model constrained gaussian process regressions}, volume = {512}, year = {2026}, }
• (2026). On picard-CR iterations involving weak perturbative contraction operators and application to reversible chemical reactions. AMC, 512, 129744. (www)

  @article{ , abstract = {We propose an efficient iterative method called Picard-CR for approximating fixed points under weak perturbative contraction conditions in uniformly convex hyperbolic metric spaces. Theoretical analysis establishes both weak and strong convergence, with performance validated against classical methods (CR, Picard-Noor, and Picard-SP) through numerical experiments. We extend our convergence results to non-expansive and contraction mappings, supported by MATLAB-based visualizations. The iterative scheme is shown to be stable and more efficient, with direct application to computing equilibrium concentrations in reversible chemical reactions. Our findings contribute not only to fixed point theory but also provide practical computational tools for chemical and engineering problems.}, archive = {J_AMC}, author = {Khairul Habib Alam and Aswini Dolai and Yumnam Rohen and Sunil Panday and Shaibal Mani}, doi = {10.1016/j.amc.2025.129744}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129744}, shortjournal = {Appl. Math. Comput.}, title = {On picard-CR iterations involving weak perturbative contraction operators and application to reversible chemical reactions}, volume = {512}, year = {2026}, }
• (2026). Adaptive fuzzy neural network-based smooth-switching gain dynamic surface control for constrained manipulator with error-based nonlinear disturbance observer. AMC, 512, 129743. (www)

  @article{ , abstract = {This paper studies an adaptive fuzzy neural network-based smooth-switching gain dynamic surface control with an error-based nonlinear disturbance observer for the manipulator subject to the full-state constraints and input saturation. First, the smooth-switching gain strategy is proposed to replace the conventional static control gain. This novel strategy can dynamically update the control gains according to the tracking error and its derivative, thereby optimizing tracking performance across different response phases. Second, considering that the conventional nonlinear disturbance observer generates harmful observation peaks when there is a large tracking error, an error-based nonlinear disturbance observer is designed. This observer adaptively adjust the observer gain based on the tracking error, effectively mitigating harmful observation peaks. Furthermore, the adaptive fuzzy neural network strategy is introduced to approximate the modeling uncertainties. Finally, an auxiliary system and an asymmetric time-varying barrier Lyapunov function are established to handle the input saturation and the asymmetric time-varying full-state constraints, respectively. The comparative experiment of a two-degree-of-freedom manipulator validate that the proposed strategy can effectively constrain the state and input of the system within predefined limits. The experimental results further validate that the proposed strategy can effectively optimise the tracking performance and increase the disturbance rejection performance of the system.}, archive = {J_AMC}, author = {Qing Yang and Haisheng Yu and Xiangxiang Meng and Wenqian Yu}, doi = {10.1016/j.amc.2025.129743}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129743}, shortjournal = {Appl. Math. Comput.}, title = {Adaptive fuzzy neural network-based smooth-switching gain dynamic surface control for constrained manipulator with error-based nonlinear disturbance observer}, volume = {512}, year = {2026}, }
• (2026). H∞ guaranteed cost filtering for nonlinear system with limited bandwidth and stochastic hybrid attacks. AMC, 512, 129714. (www)

  @article{ , abstract = {The H ∞ guaranteed cost filter is designed for the system with limited bandwidth in this paper. Due to limited network communication bandwidth, an event-triggered scheme, which fully considers the influence of quantization errors, is proposed in this paper. Under this event-triggered scheme, the burden of network communication can be further reduced. In addition to the event-triggered mechanism, network communication protocol is also an effective method to reduce the burden of network communication. Furthermore, data may be affected by network attacks as it is transmitted through the network channels. Therefore, this paper establishes a Round-Robin communication protocol model under the influence of stochastic hybrid attacks. At last, the effectiveness of the proposed H ∞ guaranteed cost filtering approach is ultimately validated through comprehensive simulation analyses in this paper.}, archive = {J_AMC}, author = {Jian Wang and Zhi-Min Li}, doi = {10.1016/j.amc.2025.129714}, journal = {Applied Mathematics and Computation}, month = {3}, pages = {129714}, shortjournal = {Appl. Math. Comput.}, title = {H∞ guaranteed cost filtering for nonlinear system with limited bandwidth and stochastic hybrid attacks}, volume = {512}, year = {2026}, }

ARTMED - 20

• (2025). Preprocessing narrative texts in electronic medical records to identify hospital adverse events: A scoping review. ARTMED, 170, 103281. (www)

  @article{ , abstract = {Background: Narrative electronic medical records (EMR), which include textual notes created by clinicians within healthcare environments, represent a significant resource for documenting various facets of patient care. This form of text exhibits distinctive characteristics, such as the occurrence of grammatically incorrect sentences, abbreviations, frequent acronyms, specialized characters with particular meanings, negation expressions, and sporadic misspellings. As a result, a primary goal in processing these textual notes is to implement effective preprocessing techniques that enhance data quality and ensure consistency across all entries. Recent advancements in algorithms and methodologies within the fields of natural language processing (NLP), machine learning (ML), and large language models (LLM) have prompted researchers to leverage narrative EMR for the detection of hospital adverse events (HAE). Methods: The scoping review adhered to the PRISMA-ScR (Preferred Reporting Items for Systematic Reviews and Meta-Analyses Extension for Scoping Reviews) guidelines. A scoping review protocol was developed and utilized to guide the research process, clearly outlining the eligibility criteria, information sources, search strategies, data management, selection process, data collection procedures, data items, outcomes and prioritization, data synthesis, and meta-bias considerations. The search strategy was implemented across nine engineering and medical electronic databases. Results: The results have indicated that from a total of 3,264 studies retrieved, 48 unique studies were included in the review. Responses to the research questions were systematically extracted from these studies. The review has identified challenges associated with the preprocessing of narrative texts in EMR for HAE identification. Additionally, three research gaps have been identified: (1) the imperative need for a pipeline to preprocess narrative EMR for the identification of HAE, (2) the necessity for a robust system capable of managing the extensive volume of narrative EMR data, and (3) the requirement for temporal event system, which are essential for effective HAE detection. The study also has underscored the essential role of preprocessing tasks in enhancing the performance of HAE detection. The study has emphasized the importance of extracting N-grams from clinical text, normalizing these N-grams through lemmatization and/or stemming, and establishing semantic feature extraction in preprocessing tasks that significantly affect HAE detection performance. While LLM-based systems naturally incorporate tokenization and normalization processes within their frameworks, it remains crucial to address features that hold semantic relevance to the specific type of HAE during preprocessing. Conclusion: This scoping review has provided valuable insights for researchers focused on HAE detection utilizing narrative EMR data. It has elucidated how preprocessing tasks can elevate the performance of HAE detection and draws attention to neglected research gaps within the field. Addressing these gaps will necessitate further investigation in subsequent research endeavors.}, archive = {J_ARTMED}, author = {Hamed Jafarpour and Guosong Wu and Cheligeer (Ken) Cheligeer and Jun Yan and Yuan Xu and Danielle A. Southern and Cathy A. Eastwood and Yong Zeng and Hude Quan}, doi = {10.1016/j.artmed.2025.103281}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103281}, shortjournal = {Artif. Intell. Med.}, title = {Preprocessing narrative texts in electronic medical records to identify hospital adverse events: A scoping review}, volume = {170}, year = {2025}, }
• (2025). SCLResNet and DSAF: A self-supervised contrastive learning and deep self-attention fusion-based multimodal network for predicting central lymph node metastasis in papillary thyroid carcinoma. ARTMED, 170, 103280. (www)

  @article{ , abstract = {Accurate prediction of central lymph node metastasis (CLNM) in papillary thyroid carcinoma (PTC) is crucial to avoid unnecessary invasive procedures, yet existing models often fall short. We constructed the SCLResNet101 model based on a contrastive learning framework to extract network features of tumor ultrasound (US). SeResnet101 was used to extract network features of peri-vascular adipose tissue (PVAT) from the computed tomography (CT) of C6 (the arterial and venous layers beneath the thyroid). Univariate and multivariate analyses were performed using binary logistic regression to select clinical features. Finally, we constructed a Deep Self-Attention Fusion (DSAF) network to integrate features from these three modalities for CLNM prediction. Univariate and multivariate analyses revealed that Gender, Age, Size of US, and Extrathyroidal Extension (ETE) were independent risk factors for CLNM. In the internal test cohort (I-T), the area under the curve (AUC) of model was 0.863 (95 % CI: 0.779–0.932). In the external test cohort (E-T), the AUC was 0.839 (95 % CI: 0.755–0.905). Compared to all radiologists, the model significantly reduced both false-positive and false-negative rates in both the I-T and E-T. This study incorporates PVAT, which significantly enhances the performance of the multimodal deep learning model and may assist surgeons in making more informed and precise surgical decisions in the treatment of PTC.}, archive = {J_ARTMED}, author = {Shidi Miao and Yuyang Jiang and Wenjuan Huang and Yuxin Jiang and Mengzhuo Sun and Mingxuan Wang and Hongzhuo Qi and Ao Li and Zengyao Liu and Qiujun Wang and Ruitao Wang and Xuemei Ding}, doi = {10.1016/j.artmed.2025.103280}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103280}, shortjournal = {Artif. Intell. Med.}, title = {SCLResNet and DSAF: A self-supervised contrastive learning and deep self-attention fusion-based multimodal network for predicting central lymph node metastasis in papillary thyroid carcinoma}, volume = {170}, year = {2025}, }
• (2025). TSFNet: A Temporal–Spectral fusion network for advanced speech emotion recognition in medical applications. ARTMED, 170, 103279. (www)

  @article{ , abstract = {Speech emotion recognition (SER) is a critical component in enhancing communication systems and human–machine interaction, with significant potential for applications in the medical field. Although existing SER methods that combine temporal and spectral features have achieved notable advancements, they still encounter a big challenge in capturing emotional nuances, which are vital in medical diagnostics and patient care. In this study, we introduce a straightforward yet highly efficient network called TSFNet, which is the Temporal–Spectral Fusion Network via a Large-scale Pre-trained Model. This network is specifically designed to effectively process intricate emotional nuances by seamlessly integrating temporal and spectral information present in speech signals. By leveraging the capabilities of a large-scale pre-trained model, which serves as a powerful plug-and-play component for extracting and learning the temporal characteristics of speech, TSFNet enables a more accurate capture of complex emotional details crucial for medical applications. Extensive experiments are conducted on publicly available datasets, to evaluate the performance of TSFNet. Extensive experiments conducted on six public datasets demonstrate that TSFNet significantly outperforms existing baselines, achieving unweighted accuracies of 95.57% for Savee, 92.67% for Crema-D, 85.71% for IEMOCAP, 100.00% for Tess, 95.86% for Emovo, and 80.43% for Meld. It means that TSFNet has the potential in advancing medical diagnostic tools and patient monitoring systems.}, archive = {J_ARTMED}, author = {Xinran Li and Peilin Huang and Xiaojiang Peng and Feng Sha and Xiaomao Fan and Ye Li}, doi = {10.1016/j.artmed.2025.103279}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103279}, shortjournal = {Artif. Intell. Med.}, title = {TSFNet: A Temporal–Spectral fusion network for advanced speech emotion recognition in medical applications}, volume = {170}, year = {2025}, }
• (2025). Mixture-attention siamese transformer for video polyp segmentation. ARTMED, 170, 103278. (www)

  @article{ , abstract = {Accurate segmentation of polyps from colonoscopy videos is of great significance to polyp treatment and early prevention of colorectal cancer. However, it is challenging due to the difficulties associated with modeling long-range spatio-temporal relationships within a colonoscopy video. In this paper, we address this challenging task with a novel M ixture- A ttention S iamese T ransformer ( MAST ), which explicitly models the long-range spatio-temporal relationships with a mixture-attention mechanism for accurate polyp segmentation. Specifically, we first construct a Siamese transformer architecture to jointly encode paired video frames for their feature representations. We then design a mixture-attention module to exploit the intra-frame and inter-frame correlations, enhancing the features with rich spatio-temporal relationships. Finally, the enhanced features are fed to two parallel decoders for predicting the segmentation maps. Extensive experiments on the large-scale SUN-SEG benchmark demonstrate the superior performance of MAST in comparison with the cutting-edge competitors. Our code is publicly available at https://github.com/Junqing-Yang/MAST .}, archive = {J_ARTMED}, author = {Geng Chen and Junqing Yang and Xiaozhou Pu and Ge-Peng Ji and Huan Xiong and Yongsheng Pan and Hengfei Cui and Yong Xia}, doi = {10.1016/j.artmed.2025.103278}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103278}, shortjournal = {Artif. Intell. Med.}, title = {Mixture-attention siamese transformer for video polyp segmentation}, volume = {170}, year = {2025}, }
• (2025). BPINet: Synchronous blood pressure estimation and user authentication based on ECG and PPG signal with multi-task learning. ARTMED, 170, 103277. (www)

  @article{ , abstract = {As a vital indicator of health, blood pressure is particularly important for elderly individuals with chronic illnesses who live alone. Daily monitoring is essential to prevent hypertension and related complications. Nevertheless, most current home blood pressure monitors depend on cuff-based techniques, which can produce inaccurate results through improper use or cuff placement. Moreover, these devices generally cannot identify the specific user being measured, which hinders the development of personalized long-term health monitoring reports. In this paper, we propose BPINet, a multi-task model based on the Multi-gate Mixture-of-Experts (MMoE) framework that utilizes CNN-BiLSTM to extract features from ECG/PPG signals for simultaneous blood pressure estimation and user authentication (identity recognition). We also compile a dataset of ECG/PPG signals from multiple families, along with their blood pressure measurements, and incorporate it with the University of Queensland Vital Signs Dataset (UQVS) to evaluate the performance of BPINet. On the UQVS dataset, BPINet achieves a 97.54% user identity recognition accuracy. For systolic blood pressure (SBP) estimation, BPINet yields an MAE ± STD of 3.317 ± 5.771 mmHg. For diastolic blood pressure (DBP) estimation, the corresponding values are 2.444 ± 4.147 mmHg. On our customized dataset, BPINet achieves a 94.30% user identity recognition accuracy. For SBP estimation, it yields an MAE ± STD of 2.940 ± 4.753 mmHg. These results meet both the British Hypertension Society (BHS) Grade A standard and the Association for the Advancement of Medical Instrumentation (AAMI) standard. BPINet not only performs blood pressure estimation effectively but also enables simultaneous user identity recognition, facilitating the creation of personalized health records. The experimental results demonstrate the clinical feasibility and effectiveness of our proposed scheme.}, archive = {J_ARTMED}, author = {Xianliang Jiang and Dingxin Yu and Guang Jin and Fei Lei and Weihao Zhang and Xinyan Zhou}, doi = {10.1016/j.artmed.2025.103277}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103277}, shortjournal = {Artif. Intell. Med.}, title = {BPINet: Synchronous blood pressure estimation and user authentication based on ECG and PPG signal with multi-task learning}, volume = {170}, year = {2025}, }
• (2025). The interpretable deep learning framework and validation for seizure detection in pediatric electroencephalography: An improved accuracy and performance analysis. ARTMED, 170, 103276. (www)

  @article{ , abstract = {This study proposes an interpretable deep learning framework and compares the two novel models. A fully convolutional network with squeeze-and-excitation modules (SE-FCN) is designed to enhance spatial sensitivity and retain temporal resolution. In addition, a transformer-based model (TransNet) is developed to capture temporal and channel-wise dependencies via self-attention. These two models output channel saliency weights to the EEG electrode space and generate heatmaps for inferring potential epileptogenic zones. Deep learning primarily adopts convolutional neural networks (CNNs) or sequence generation networks (SGNs) and faces the limitations. For instance, CNN-based models often lack hierarchical modeling and fail to quantify channel-wise contributions, hindering spatial localization. SGN-based models struggle to capture complex spatiotemporal dependencies and typically lack adaptive attention tailored to electroencephalography (EEG) characters. Epileptic seizure detection is vital for effective clinical intervention and existing methods operated as black boxes, limiting clinical interpretability. This study evaluates the models on the CHB-MIT pediatric EEG dataset using a subject-independent cross-validation protocol. SE-FCN achieves an AUC of 0.89 and accuracy of 86.7 %, while TransNet achieves an AUC of 0.92 and accuracy of 86.4 %. Saliency maps from both models demonstrate high consistency and enable categorization of 22 patients into five groups based on inferred seizure origins.}, archive = {J_ARTMED}, author = {Yu Zhou and Yuxin Gao and Qiang Li and Ruiheng Wu and Aiping Yang and Ming-Lang Tseng}, doi = {10.1016/j.artmed.2025.103276}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103276}, shortjournal = {Artif. Intell. Med.}, title = {The interpretable deep learning framework and validation for seizure detection in pediatric electroencephalography: An improved accuracy and performance analysis}, volume = {170}, year = {2025}, }
• (2025). A novel memory interaction neural network for multi-label drug–drug interaction prediction with neighbor importance sampling. ARTMED, 170, 103275. (www)

  @article{ , abstract = {Co-administration of multiple drugs can frequently cause drug–drug interactions (DDIs), including adverse drug reactions (ADRs) that may increase the likelihood of morbidity and mortality. Identifying potential DDIs presents a significant challenge, due to the complexity of pharmacology. Recent advances in knowledge graphs have contributed to DDI prediction by providing a robust framework for representing various relationships between drugs and other entities, such as proteins, diseases, and drug attributes. However, current network-based models often fail to uncover interaction information among DDI triplets, as they typically encode triplets independently. Additionally, uniform sampling methods may overlook differences in neighboring node properties. In this work, we propose a novel memory interaction neural network for DDI prediction, which integrates drug molecular sequences with semantic information from the drug knowledge graph. Specifically, we introduce a neighbor importance sampling strategy that selectively samples highly connected neighbors, improving computational efficiency and reducing noise. We also design a memory interaction module that utilizes multi-head attention mechanisms and deep neural networks to capture interactions among DDI triplets. Experimental evaluation on KEGG and OGB-biokg datasets demonstrates the superiority of our model compared to classical and state-of-the-art methods in predicting DDIs. Datasets and code for this proposed DDIs prediction model are freely accessible at https://github.com/wj1108114106/Multi-label-DDIs .}, archive = {J_ARTMED}, author = {Jing Wang and Runzhi Li and Shuo Zhang and YunLi Xing and Siyu Yan and Lihong Ma}, doi = {10.1016/j.artmed.2025.103275}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103275}, shortjournal = {Artif. Intell. Med.}, title = {A novel memory interaction neural network for multi-label drug–drug interaction prediction with neighbor importance sampling}, volume = {170}, year = {2025}, }
• (2025). Types, functions, and mechanisms of machine learning for personalizing smoking cessation interventions: A systematic scoping review. ARTMED, 170, 103274. (www)

  @article{ , abstract = {Purpose Artificial intelligence can realize personalization. This systematic scoping review provides the types, functions, and mechanisms of machine learning (ML) for personalizing smoking cessation interventions. Methodology We searched fourteen databases including PubMed, CINAHL, EMBASE, the Cochrane Library, IEEE Xplore, PsycINFO, Scopus, Web of Science, AAAI, ACM Digital Library, ArXIV, Mednar, ProQuest, and Science.gov . We selected 98 articles from 4073 records that met the criteria. Two independent reviewers screened and selected the articles. Two reviewers extracted the data using a self-developed data charting form independently. Results The findings are reported in narrative syntheses, tables, and figures. The types of ML included artificial neural networks, Bayesian algorithms, clustering algorithms, decision tree algorithms, deep learning (DL) algorithms, ensemble algorithms, linear classifiers, others, and unspecified. The most common ML technique used was supervised learning (81 %), and the ML functions included (1) message tailoring (17 %), (2) prediction and detection of smoking events (34 %), (3) social media surveillance (14 %), (4) predictive models (24 %), and (5) biomarker analysis (10 %). The ML mechanisms involved the following sequence: data input, data preprocessing, feature extraction and selection, training and validation, and data output. Conclusion This review is the first to describe the potential use of ML for personalizing smoking cessation interventions. We provide recommendations for future research by identifying the limitations and gaps in the studies. Future studies should refine, validate, and test ML models using robust experimental methods to conclude their effectiveness.}, archive = {J_ARTMED}, author = {Yu Jie Xavia Ng and Shing Hui Reina Cheong and Wen Wei Ang and Ying Lau and Siew Tiang Lau}, doi = {10.1016/j.artmed.2025.103274}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103274}, shortjournal = {Artif. Intell. Med.}, title = {Types, functions, and mechanisms of machine learning for personalizing smoking cessation interventions: A systematic scoping review}, volume = {170}, year = {2025}, }
• (2025). Decoding the cortical responses to mechanical wrist perturbations: A two-step shared structure NARX method. ARTMED, 170, 103273. (www)

  @article{ , abstract = {Shared structure nonlinear autoregressive with exogenous input (NARX) model is a promising tool for exploring cortical responses mechanism to external stimuli, essential for advancing our understanding of brain function and developing methods for direct brain information encoding. In this paper, we proposed a two-step method to overcome limitations in existing method, which neglect data relationships and rely on a greedy search for regression terms, leading to less accurate models. In our approach, data from multiple trials are concatenated, and then the orthogonal forward regression (OFR) algorithm identifies model terms in first step, enhancing inter-trial connections and establishing a preliminary model for each subject. Shared model terms across subjects are then used to construct a general target model. Next, non-shared regression terms that best represent population-level information are identified, using adaptive multi-population genetic algorithms, and use to enhance the target models' descriptive power. Simulations results show significant competitiveness in terms of accuracy as compared to other state-of-the-art methods. When applied to real electroencephalography signals under mechanical disturbance, structural and parameter analysis revealed consistent neural response patterns across subjects, with subject-specific responses likely stemming from muscle feedback. Frequency response analysis further suggests that the brain may generate motor inhibition signals based on sensory inputs to maintain a pre-disturbance resting state. These findings provide valuable insights into cortical response mechanisms and have potential implications for future brain information encoding research.}, archive = {J_ARTMED}, author = {Nan Zheng and Yurong Li and Wuxiang Shi and Jiyu Tan}, doi = {10.1016/j.artmed.2025.103273}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103273}, shortjournal = {Artif. Intell. Med.}, title = {Decoding the cortical responses to mechanical wrist perturbations: A two-step shared structure NARX method}, volume = {170}, year = {2025}, }
• (2025). AI-driven dynamic grouping for adaptive clinical trials: Rethinking randomization in precision medicine. ARTMED, 170, 103272. (www)

  @article{ , abstract = {Integrating artificial intelligence into biomedical human subjects research is transforming traditional experimental paradigms. This perspective introduces the concept of “dynamic grouping,” wherein artificial intelligence (AI) systems continuously reassign participants across experimental conditions based on real-time biomarker data and clinical response patterns. Unlike traditional biomedical research designs that rely on fixed treatment and control groups, dynamic grouping allows participant assignments to evolve throughout the study. We examine the ethical implications, methodological challenges, and research opportunities associated with this paradigm, particularly in clinical trials, precision medicine, and digital therapeutics. To support this analysis, we present three computational simulations that quantify its impact: (i) a heterogeneity simulation demonstrating how patient variability affects the advantage of dynamic grouping, (ii) a statistical power analysis showing potential sample size reductions in adaptive designs, and (iii) a clinical outcome distribution analysis highlighting how dynamic grouping reduces negative treatment outcomes and optimizes patient responses. Our findings suggest that dynamic grouping can improve treatment effectiveness, enhance resource allocation, and increase statistical efficiency, although it also raises new challenges for causal inference, informed consent, and regulatory oversight. As AI continues to reshape medical research, adapting ethical and methodological frameworks will be essential for its responsible implementation.}, archive = {J_ARTMED}, author = {Madhur Mangalam}, doi = {10.1016/j.artmed.2025.103272}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103272}, shortjournal = {Artif. Intell. Med.}, title = {AI-driven dynamic grouping for adaptive clinical trials: Rethinking randomization in precision medicine}, volume = {170}, year = {2025}, }
• (2025). H-SynEx: Using synthetic images and ultra-high resolution ex vivo MRI for hypothalamus subregion segmentation. ARTMED, 170, 103271. (www)

  @article{ , abstract = {The hypothalamus is a small structure located in the center of the brain and is involved in significant functions such as sleeping, temperature, and appetite control. Various neurological disorders are also associated with hypothalamic abnormalities. Automated image analysis of this structure from brain MRI is thus highly desirable to study the hypothalamus in vivo . However, most of the automated segmentation tools currently available focus exclusively on T1w images. In this study, we introduce H-SynEx, a machine learning method for automated segmentation of hypothalamic subregions that generalizes across different MRI sequences and resolutions without retraining. H-synEx was trained with synthetic images built from label maps derived from ultra-high resolution ex vivo MRI scans, allowing finer-grained manual segmentation when compared with 1 mm isometric in vivo images. We validated our method using Dice Coefficient (DSC) and Average Hausdorff distance (AVD) across in vivo images from six different datasets with six different MRI sequences (T1, T2, proton density, quantitative T1, fractional anisotropy, and FLAIR). Statistical analysis compared hypothalamic subregion volumes in controls, Alzheimer’s disease (AD), and behavioral variant frontotemporal dementia (bvFTD) subjects using the Area Under the Receiver Operating Characteristic curve (AUROC) and the Wilcoxon rank sum test. Our results show that H-SynEx successfully leverages information from ultra-high resolution scans to segment in vivo from different MRI sequences. Our automated segmentation was able to discriminate controls versus patients with Alzheimer’s disease on FLAIR images with 5 mm spacing. H-SynEx is openly available at https://github.com/liviamarodrigues/hsynex .}, archive = {J_ARTMED}, author = {Livia Rodrigues and Martina Bocchetta and Oula Puonti and Douglas Greve and Ana Carolina Londe and Marcondes França and Simone Appenzeller and Juan Eugenio Iglesias and Leticia Rittner}, doi = {10.1016/j.artmed.2025.103271}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103271}, shortjournal = {Artif. Intell. Med.}, title = {H-SynEx: Using synthetic images and ultra-high resolution ex vivo MRI for hypothalamus subregion segmentation}, volume = {170}, year = {2025}, }
• (2025). Mining multi-electrode and multi-wave electroencephalogram based time-interval temporal patterns for improved classification capabilities and explainability. ARTMED, 170, 103269. (www)

  @article{ , abstract = {Brain-computer interface (BCI) systems, and particularly electroencephalogram (EEG) based BCI systems, have become more widely used in recent years and are utilized in various applications and domains ranging from medicine and marketing to games and entertainment. While different algorithms have been used to analyze EEG data and enable its classification, existing algorithms have two main drawbacks; both their classification and explainability capabilities are limited. Lacking in explainability, they cannot indicate which electrodes and waves led to a classification decision or explain how areas and frequencies of the brain's activity correlate to a specific task. In this study, we propose a novel extension for the time-interval temporal patterns mining algorithms aimed at enhancing the data mining process by enabling a richer set of patterns to be learned from the EEG data, thereby contributing to improved classification and explainability capabilities. The extended algorithm is designed to capture and leverage the unique nature of EEG data by decomposing it into different brain waves and modeling the relations among them and between different electrodes. Our evaluation of the proposed extended algorithm on multiple learning tasks and three EEG datasets demonstrated the extended algorithm's ability to mine richer patterns that improve the classification performance by 4–11 % based on the Area-Under the receiver operating characteristic Curve (AUC) metric, compared to the original version of the algorithm. Moreover, the algorithm was shown to shed light on the areas and frequencies of the brain's activity that are correlated with specific tasks.}, archive = {J_ARTMED}, author = {Ofir Landau and Nir Nissim}, doi = {10.1016/j.artmed.2025.103269}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103269}, shortjournal = {Artif. Intell. Med.}, title = {Mining multi-electrode and multi-wave electroencephalogram based time-interval temporal patterns for improved classification capabilities and explainability}, volume = {170}, year = {2025}, }
• (2025). A survey for large language models in biomedicine. ARTMED, 170, 103268. (www)

  @article{ , abstract = {Recent breakthroughs in large language models (LLMs) offer unprecedented natural language understanding and generation capabilities. However, existing surveys on LLMs in biomedicine often focus on specific applications or model architectures, lacking a comprehensive analysis that integrates the latest advancements across various biomedical domains. This review, based on an analysis of 484 publications sourced from databases including PubMed, Web of Science, and arXiv, provides an in-depth examination of the current landscape, applications, challenges, and prospects of LLMs in biomedicine, distinguishing itself by focusing on the practical implications of these models in real-world biomedical contexts. Firstly, we explore the capabilities of LLMs in zero-shot learning across a broad spectrum of biomedical tasks, including diagnostic assistance, drug discovery, and personalized medicine, among others, with insights drawn from 137 key studies. Then, we discuss adaptation strategies of LLMs, including fine-tuning methods for both uni-modal and multi-modal LLMs to enhance their performance in specialized biomedical contexts where zero-shot fails to achieve, such as medical question answering and efficient processing of biomedical literature. Finally, we discuss the challenges that LLMs face in the biomedicine domain including data privacy concerns, limited model interpretability, issues with dataset quality, and ethics due to the sensitive nature of biomedical data, the need for highly reliable model outputs, and the ethical implications of deploying AI in healthcare. To address these challenges, we also identify future research directions of LLM in biomedicine including federated learning methods to preserve data privacy and integrating explainable AI methodologies to enhance the transparency of LLMs. As this field of LLM rapidly evolves, continued research and development are essential to fully harness the capabilities of LLMs in biomedicine while ensuring their responsible and effective deployment.}, archive = {J_ARTMED}, author = {Chong Wang and Mengyao Li and Junjun He and Zhongruo Wang and Erfan Darzi and Zan Chen and Jin Ye and Tianbin Li and Yanzhou Su and Jing Ke and Kaili Qu and Shuxin Li and Yi Yu and Pietro Liò and Tianyun Wang and Yu Guang Wang and Yiqing Shen}, doi = {10.1016/j.artmed.2025.103268}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103268}, shortjournal = {Artif. Intell. Med.}, title = {A survey for large language models in biomedicine}, volume = {170}, year = {2025}, }
• (2025). High-quality triage and diagnosis of gynecological diseases via artificial intelligence. ARTMED, 170, 103267. (www)

  @article{ , abstract = {Timely detection and diagnosis of diseases are key elements of an efficient healthcare system. In recent years, artificial intelligence (AI) has played an increasingly important role in improving the accuracy and efficiency of disease diagnosis in clinical practice. However, most existing AI systems for disease diagnosis have focused on either classifying patients into broad disease categories or diagnosing a specific disease, leaving a gap in the development of a coherent AI system for both triage and diagnosis in a department of a general hospital. In this study, we fill this gap with SmartGyne, an advanced AI system that can achieve high-quality triage and diagnosis for a full spectrum of gynecological diseases. By extracting useful clinical evidence for diagnosis from a large amount of electronic medical records, SmartGyne establishes an effective framework to integrate real-world clinical evidence and knowledge into a coherent AI system that can effectively handle a full spectrum of complex diseases in a department of a general hospital. Validation experiments demonstrated that SmartGyne achieved an overall accuracy of 80.1 % in triage for gynecological diseases, and 99.4 % in diagnosis for a gynecological subspecialty. In comparison with human physicians, SmartGyne showed competitive triage and diagnostic performance, and improved consultation efficiency and accuracy for physicians with limited specialized experience. These results show that SmartGyne achieves high-quality triage and diagnosis, holding the potential to improve the efficiency of the healthcare system in China, as well as other countries lacking professional gynecologists.}, archive = {J_ARTMED}, author = {Linru Fu and Che Wang and Zhaoyang Liu and Changzai Pan and Zhe Du and Zhijing Sun and Lan Zhu and Ke Deng}, doi = {10.1016/j.artmed.2025.103267}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103267}, shortjournal = {Artif. Intell. Med.}, title = {High-quality triage and diagnosis of gynecological diseases via artificial intelligence}, volume = {170}, year = {2025}, }
• (2025). Improving prototypical parts abstraction for case-based reasoning explanations designed for the kidney stone type recognition. ARTMED, 170, 103266. (www)

  @article{ , abstract = {The in-vivo identification of the kidney stone types during an ureteroscopy would be a major medical advance in urology, as it could reduce the time of the tedious renal calculi extraction process, while diminishing infection risks. Furthermore, such an automated procedure would make possible to prescribe anti-recurrence treatments immediately. Nowadays, only few experienced urologists are able to recognize the kidney stone types in the images of the videos displayed on a screen during the endoscopy. This visual recognition by urologists is also highly operator dependent. Thus, several deep learning (DL) models have recently been proposed to automatically recognize the kidney stone types using ureteroscopic images. However, these DL models are of black box nature and do not establish the relationship of the visual features they used to take the decision with the color, texture and morphological features visually analyzed in biological laboratories to determine the type of extracted kidney stone fragments using the reference morphoconstitutional analysis (MCA) procedure. This contribution proposes a case-based reasoning DLmodel which uses prototypical parts (PPs) and generates local and global descriptors. The PPs encode for each class (i.e., kidney stone type) visual feature information (hue, saturation, intensity and textures) similar to that used by biologists during MCA. The PPs are optimally generated due a new loss function used during the model training. Moreover, the local and global descriptors of PPs allow to explain the decisions (“what” information, “where in the images”) in an understandable way for biologists and urologists. The proposed DL model has been tested on a database including images of the six most widespread kidney stone types in industrialized countries. The overall average classification accuracy was 90 . 37 ± 0 . 6 % . When comparing this results with that of the eight other DL models of the kidney stone state-of-the-art, it can be seen that the valuable gain in explanability was not reached at the expense of accuracy which was even slightly increased with respect to that ( 88 . 2 ± 2 . 1 % ) of the best method of the literature. These promising and interpretable results also encourage urologists to put their trust in AI-based solutions.}, archive = {J_ARTMED}, author = {Daniel Flores-Araiza and Francisco Lopez-Tiro and Clément Larose and Salvador Hinojosa and Andres Mendez-Vazquez and Miguel Gonzalez-Mendoza and Gilberto Ochoa-Ruiz and Christian Daul}, doi = {10.1016/j.artmed.2025.103266}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103266}, shortjournal = {Artif. Intell. Med.}, title = {Improving prototypical parts abstraction for case-based reasoning explanations designed for the kidney stone type recognition}, volume = {170}, year = {2025}, }
• (2025). Medical multimodal foundation models in clinical diagnosis and treatment: Applications, challenges, and future directions. ARTMED, 170, 103265. (www)

  @article{ , abstract = {Recent advancements in deep learning have significantly revolutionized the field of clinical diagnosis and treatment, offering novel approaches to improve diagnostic precision and treatment efficacy across diverse clinical domains, thus driving the pursuit of precision medicine. The growing availability of multi-organ and multimodal datasets has accelerated the development of large-scale Medical Multimodal Foundation Models (MMFMs). These models, known for their strong generalization capabilities and rich representational power, are increasingly being adapted to address a wide range of clinical tasks, from early diagnosis to personalized treatment strategies. This review offers a comprehensive analysis of recent developments in MMFMs, focusing on three key aspects: datasets, model architectures, and clinical applications. We also explore the challenges and opportunities in optimizing multimodal representations and discuss how these advancements are shaping the future of healthcare by enabling improved patient outcomes and more efficient clinical workflows.}, archive = {J_ARTMED}, author = {Kai Sun and Siyan Xue and Fuchun Sun and Haoran Sun and Yu Luo and Ling Wang and Siyuan Wang and Na Guo and Lei Liu and Tian Zhao and Xinzhou Wang and Lei Yang and Shuo Jin and Jun Yan and Jiahong Dong}, doi = {10.1016/j.artmed.2025.103265}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103265}, shortjournal = {Artif. Intell. Med.}, title = {Medical multimodal foundation models in clinical diagnosis and treatment: Applications, challenges, and future directions}, volume = {170}, year = {2025}, }
• (2025). An end-to-end solution for out-of-hospital emergency medical dispatch triage based on multimodal and continual deep learning. ARTMED, 170, 103264. (www)

  @article{ , abstract = {The objective of this study was to build a multimodal, multitask predictive model—named E2eDeepEMC 2 —to improve out-of-hospital emergency incident severity assessments while coping with shifts in data distributions over time. We drew on 2 054 694 independent incidents recorded by the Valencian emergency medical dispatch service between 2009 and 2019 (excluding 2013), combining demographic, temporal, clinical and free-text inputs. To handle temporal drift, our model integrates continual learning strategies and comprises three encoder modules (for context, clinical data and text), whose outputs are merged to predict the life-threatening level, admissible response delay and emergency system jurisdiction. Compared with the Valencian Region’s existing in-house triage protocol, E2eDeepEMC 2 achieved absolute F1-score gains of 18.46% for life-threatening level, 25.96% for response delay and 3.63% for jurisdiction. Compared to non-continual learning baselines, it also outperformed them by 3.04%, 9.66% and 0.58%, respectively. Deployment of E2eDeepEMC 2 is currently underway in the Valencian Region, underscoring its practical impact on real-world emergency dispatch decision-making.}, archive = {J_ARTMED}, author = {Pablo Ferri and Carlos Sáez and Antonio Félix-De Castro and Purificación Sánchez-Cuesta and Juan M. García-Gómez}, doi = {10.1016/j.artmed.2025.103264}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103264}, shortjournal = {Artif. Intell. Med.}, title = {An end-to-end solution for out-of-hospital emergency medical dispatch triage based on multimodal and continual deep learning}, volume = {170}, year = {2025}, }
• (2025). LoRA-PT: Low-rank adapting UNETR for hippocampus segmentation using principal tensor singular values and vectors. ARTMED, 170, 103254. (www)

  @article{ , abstract = {The hippocampus is an important brain structure involved in various psychiatric disorders, and its automatic and accurate segmentation is vital for studying these diseases. Recently, deep learning-based methods have made significant progress in hippocampus segmentation. However, training deep neural network models requires substantial computational resources, time, and a large amount of labeled training data, which is frequently scarce in medical image segmentation. To address these issues, we propose LoRA-PT, a novel parameter-efficient fine-tuning (PEFT) method that transfers the pre-trained UNETR model from the BraTS2021 dataset to the hippocampus segmentation task. Specifically, LoRA-PT divides the parameter matrix of the transformer structure into three distinct sizes, yielding three third-order tensors. These tensors are decomposed using tensor singular value decomposition to generate low-rank tensors consisting of the principal singular values and vectors, with the remaining singular values and vectors forming the residual tensor. During fine-tuning, only the low-rank tensors (i.e., the principal tensor singular values and vectors) are updated, while the residual tensors remain unchanged. We validated the proposed method on three public hippocampus datasets, and the experimental results show that LoRA-PT outperformed state-of-the-art PEFT methods in segmentation accuracy while significantly reducing the number of parameter updates. Our source code is available at https://github.com/WangangCheng/LoRA-PT/tree/LoRA-PT .}, archive = {J_ARTMED}, author = {Guanghua He and Wangang Cheng and Hancan Zhu and Gaohang Yu}, doi = {10.1016/j.artmed.2025.103254}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103254}, shortjournal = {Artif. Intell. Med.}, title = {LoRA-PT: Low-rank adapting UNETR for hippocampus segmentation using principal tensor singular values and vectors}, volume = {170}, year = {2025}, }
• (2025). MMSupcon: An image fusion-based multi-modal supervised contrastive method for brain tumor diagnosis. ARTMED, 170, 103253. (www)

  @article{ , abstract = {The diagnosis of brain tumors is pivotal for effective treatment, with MRI serving as a commonly used non-invasive diagnostic modality in clinical practices. Fundamentally, brain tumor diagnosis is a type of pattern recognition task that requires the integration of information from multi-modal MRI images. However, existing fusion strategies are hindered by the scarcity of multi-modal imaging samples. In this paper, we propose a new training paradigm tailored for the scenario of multi-modal imaging in brain tumor diagnosis, called multi-modal supervised contrastive learning method (MMSupcon). This method significantly enhances diagnostic accuracy through two key components: multi-modal medical image fusion and multi-modal supervised contrastive loss. First, the fusion component integrates complementary imaging modalities to generate information-rich samples. Second, by introducing fused samples to guide original samples in learning feature consistency or inconsistency among classes, our loss component effectively preserves the integrity of cross-modal information while maintaining the distinctiveness of individual modalities. Finally, MMSupcon is validated on a real-world brain tumor dataset collected from Beijing Tiantan Hospital, achieving state-of-the-art performance. Furthermore, additional experiments on two public BraTS glioma classification datasets also demonstrate our substantial performance improvements. The source code is released at https://github.com/hywang02/MMSupcon .}, archive = {J_ARTMED}, author = {Haoyu Wang and Jing Zhang and Siying Wu and Haoran Wei and Xun Chen and Yunwei Ou and Xiaoyan Sun}, doi = {10.1016/j.artmed.2025.103253}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103253}, shortjournal = {Artif. Intell. Med.}, title = {MMSupcon: An image fusion-based multi-modal supervised contrastive method for brain tumor diagnosis}, volume = {170}, year = {2025}, }
• (2025). Pathway information on methylation analysis using deep neural network (PROMINENT): An interpretable deep learning method with pathway prior for phenotype prediction using gene-level DNA methylation. ARTMED, 170, 103236. (www)

  @article{ , abstract = {Background DNA methylation is a key epigenetic marker that influences gene expression and phenotype regulation, and is affected by both genetic and environmental factors. Traditional linear regression methods such as elastic nets have been employed to assess the cumulative effects of multiple DNA methylation markers on phenotypes. However, these methods often fail to capture the complex nonlinear nature of the data. Recent deep learning approaches, such as MethylNet, have improved the prediction accuracy but lack interpretability and efficiency. Findings To address these limitations, we introduced P athway Info r mati o n on M ethylat i on Analysis using a Deep Ne ural N e t work (PROMINENT), a novel interpretable deep learning method that integrates gene-level DNA methylation data with biological pathway information for phenotype prediction. PROMINENT enhances interpretability and prediction accuracy by incorporating gene- and pathway-level priors from databases such as Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG). It employs SHapley Additive exPlanations (SHAP) to prioritize significant genes and pathways. Evaluated across various datasets, childhood asthma, idiopathic pulmonary fibrosis (IPF), and first-episode psychosis (FEP)—PROMINENT consistently outperformed existing methods in terms of prediction accuracy and computational efficiency. PROMINENT also identified crucial genes and pathways involved in disease mechanisms. Conclusions PROMINENT represents a significant advancement in leveraging DNA methylation data for phenotype prediction, offering both high accuracy and interpretability within reasonable computational time. This method holds promise for elucidating the epigenetic underpinnings of complex diseases and enhancing the utility of DNA methylation data in biomedical research.}, archive = {J_ARTMED}, author = {Soyeon Kim and Laizhi Zhang and Yidi Qin and Rebecca I. Caldino Bohn and Hyun Jung Park}, doi = {10.1016/j.artmed.2025.103236}, journal = {Artificial Intelligence in Medicine}, month = {12}, pages = {103236}, shortjournal = {Artif. Intell. Med.}, title = {Pathway information on methylation analysis using deep neural network (PROMINENT): An interpretable deep learning method with pathway prior for phenotype prediction using gene-level DNA methylation}, volume = {170}, year = {2025}, }

ASOC - 122

• (2025). Deeper-PINNs: Unlocking the power of deep physics-informed neural networks. ASOC, 185, 114048. (www)

  @article{ , abstract = {Physics-Informed Neural Networks (PINNs) have emerged as a promising framework for solving partial differential equations (PDEs) and have garnered significant attention across industrial and scientific domains. However, their effectiveness is often constrained by limited approximation capacity and performance degradation in deep network structures. In this work, we propose the Deeper Physics-Informed Neural Network (Deeper-PINN), a novel architecture designed to address these challenges. The Deeper-PINN incorporates element-wise multiplication operations into the PINN structure, which effectively mitigates the initialization pathologies of PINNs and enables the utilization of deeper network structures. Additionally, this operation projects features into high-dimensional, nonlinear spaces, thereby enhancing the approximation capacity of PINNs. The proposed architecture is evaluated on multiple benchmark problems, demonstrating that Deeper-PINNs can effectively leverage deep neural network structures while maintaining high parameter efficiency. The complete codes of the experiments can be found on https://github.com/flongjiang/Deeper-PINNs}, archive = {J_ASOC}, author = {Feilong Jiang and Xiaonan Hou and Jianqiao Ye and Min Xia}, doi = {10.1016/j.asoc.2025.114048}, journal = {Applied Soft Computing}, month = {12}, pages = {114048}, shortjournal = {Appl. Soft. Comput.}, title = {Deeper-PINNs: Unlocking the power of deep physics-informed neural networks}, volume = {185}, year = {2025}, }
• (2025). Wind turbine blade damage identification using lightweight YOLO11 with multi-scale dilated attention. ASOC, 185, 114042. (www)

  @article{ , abstract = {In recent years, companies such as Siemens and GE have frequently experienced wind turbine shutdowns due to blade damage and fractures, resulting in annual losses of up to $4.6 billion. As a critical component of wind turbines, blades have a high failure rate, which directly affects the safety and reliability of wind turbine operations. However, accurately identifying wind turbine blade damage is a significant challenge, mainly due to the scarcity of damage samples, the small scale of blade damage which is difficult to detect, and the interference from external environmental factors. To address these issues, this paper proposes a high-accuracy and low-consumption damage identification method using SlimNeck-structured YOLO11 with Multi-Scale Dilated Attention (SNMSDA-YOLO11). First, to overcome the issue of limited damage samples from wind turbines, three data augmentation methods are used, including random noise augmentation, image sharpening augmentation, and saturation adjustment augmentation. Second, to solve the problem of adaptive feature extraction for damage at various scales, the multi-scale dilated attention mechanism is integrated into the YOLO11 algorithm. This enhances its ability to extract damage features across different forms of blade damage, thereby improving detection performance. Finally, a slim-neck structure is employed to optimize the model, ensuring accurate damage identification while significantly improving the computational speed and efficiency. Experimental results demonstrate that the proposed SNMSDA-YOLO11 effectively utilizes attention mechanisms to learn multi-scale damage features of wind turbine blades, achieving an accuracy of 94.9 %. Compared to existing methods, this method holds significant potential for large-scale applications in wind turbine blade damage identification.}, archive = {J_ASOC}, author = {Wenjing Xu and Jiachi Yao and Yanxue Wang and Chao Liu and Xinyu Liu and Dongxiang Jiang}, doi = {10.1016/j.asoc.2025.114042}, journal = {Applied Soft Computing}, month = {12}, pages = {114042}, shortjournal = {Appl. Soft. Comput.}, title = {Wind turbine blade damage identification using lightweight YOLO11 with multi-scale dilated attention}, volume = {185}, year = {2025}, }
• (2025). Tea leaf disease detection using UAV remote sensing images based on low-light aware and spatial reconstruction. ASOC, 185, 114034. (www)

  @article{ , abstract = {Tea leaf diseases in unmanned aerial vehicle (UAV) remote sensing images under low-light conditions present various morphologies. Existing methods do not accurately detect these tea leaf diseases. This study proposes a detection method for tea leaf diseases in low-light UAV remote sensing images based on the low-light aware and spatial reconstruction network (LA-SRNet). The low-light aware encoder in LA-SRNet guides the extraction of light invariant features and the noise distribution. The multiscale spatial reconstruction decoder in LA-SRNet achieves image reconstruction. LA-SRNet enhances the feature learning ability of the detection network for disease spots of different scales and morphologies in low-light UAV remote sensing images and alleviating the impact of low light on detection results. The high-frequency feature enhancement block in the tea disease spot detection network (TDSDNet) constructed in this study enhances the high-frequency information of feature maps, improving the detection network’s ability to learn the detailed features of disease spots with different morphologies and reducing the number of missed detections. The multiscale mask attention sub-network in TDSDNet captures the location information of diseased tea leaves, reducing false detections. This study also uses the multiscale mask loss function to suppress the background and highlight the foreground. Experimental results show that the proposed method achieves precision, recall, and mean average precision (mAP)@0.5 of 68.5, 64.8, and 70.1 %, respectively, for the detection of tea leaf diseases in low-light UAV remote sensing images, showing higher values than existing detection methods. The proposed detection network has a mAP value of 1.9 % higher than that of the most advanced detection networks and 3.2 % higher than the baseline network.}, archive = {J_ASOC}, author = {Gensheng Hu and Jiahang Zou}, doi = {10.1016/j.asoc.2025.114034}, journal = {Applied Soft Computing}, month = {12}, pages = {114034}, shortjournal = {Appl. Soft. Comput.}, title = {Tea leaf disease detection using UAV remote sensing images based on low-light aware and spatial reconstruction}, volume = {185}, year = {2025}, }
• (2025). Knowledge-augmented large language model-based framework for adverse drug reaction analysis. ASOC, 185, 114025. (www)

  @article{ , abstract = {Transformer-based pre-trained large language models and their domain-specific variants have achieved impressive performance in natural language processing tasks across various fields, but the static internal prior knowledge limits their capability to adapt to the dynamically evolving knowledge landscape and effectively address knowledge-intensive problems within health informatics, such as identifying adverse drug reactions from online text data generated by the public. Additionally, the non-standardized identification results hinder researchers from conducting in-depth analyzes and drawing meaningful insights. We propose a novel knowledge-augmented large language model-based framework, which incorporates a fine-tuned biomedical large language model for adverse drug reaction identification. External trustworthy knowledge resources are retrieved and integrated into the framework through a unified feature embedding mechanism, systematically enhancing both adverse drug reaction identification and medical terminology standardization. To the best of our knowledge, this study marks initial effort to introduce knowledge augmentation techniques to adverse drug reaction identification and medical terminology standardization. Comprehensive experiments on public benchmark datasets demonstrate the effectiveness of the framework, which outperforms state-of-the-art large language model-based competitors across all evaluation metrics and shows over a 5 % improvement compared to the second-best experimental results.}, archive = {J_ASOC}, author = {Haochen Zou and Yongli Wang and Kun Xiang and Anqi Huang}, doi = {10.1016/j.asoc.2025.114025}, journal = {Applied Soft Computing}, month = {12}, pages = {114025}, shortjournal = {Appl. Soft. Comput.}, title = {Knowledge-augmented large language model-based framework for adverse drug reaction analysis}, volume = {185}, year = {2025}, }
• (2025). A partial load distribution aware cluster migration approach for stable control plane in software-defined wireless sensor networks. ASOC, 185, 114023. (www)

  @article{ , abstract = {The utilization of a distributed architecture in SDN-enabled wireless sensor networks (WSNs) provides significant advantages in terms of reliability and scalability. This architecture uses multiple controllers to provide control services near the data plane to enable prompt responses through control messages. However, the placement of controllers and the balancing of their loads present substantial challenges in SDN-enabled WSNs due to the dynamic nature of devices in the data plane. An articulation point method is used to identify the optimal number of controllers to address the controller placement. Whereas, the nature-inspired seagull optimization approach is considered to place them in the control plane efficiently by considering crucial factors such as the synchronization overhead and network latency. Furthermore, to address load balancing, a novel approach called partial load distribution-based cluster migration (PLD-CM) is proposed. This approach identifies the best-suited assistant controllers of low utilization to reduce the load of overloaded controllers. Subsequently, appropriate control nodes are identified for partial migration in accordance with the load of the assistant controller. To evaluate the performance of the proposed PLD-CM scheme is implemented with the open network operating system (ONOS) controller, and the entire network is simulated using the ns-3 simulator. The simulation results demonstrate that our proposed PLD-CM scheme outperforms state-of-the-art methods in terms of various performance metrics, including the load distribution among controllers, occurrences of controller overload, round-trip time (RTT), and the average delay. Additionally, PLD-CM effectively reduces instances of controller overload by 84 %, 75 %, and 47 % compared to OpenFlow, the method proposed by Kobo et al., and the LS-CNM approach, respectively.}, archive = {J_ASOC}, author = {Vikas Tyagi and Samayveer Singh}, doi = {10.1016/j.asoc.2025.114023}, journal = {Applied Soft Computing}, month = {12}, pages = {114023}, shortjournal = {Appl. Soft. Comput.}, title = {A partial load distribution aware cluster migration approach for stable control plane in software-defined wireless sensor networks}, volume = {185}, year = {2025}, }
• (2025). Detection of alzheimer's disease using 3D-CNN model based on multimodal connectome. ASOC, 185, 114006. (www)

  @article{ , abstract = {Abnormal changes in the movement of water molecules throughout the brain related to synaptic connectivity provide information about the structure of the brain. Alzheimer's disease (AD), the most common type of dementia, is characterized by disruption of synaptic connections between neurons. This paper proposes a novel machine learning-based framework to distinguish of AD and mild cognitive impairment (MCI) that analyzes structural multimodal connectome matrix. The study consists of two stages, including preprocessing and 3D convolutional neural network (3D-CNN) model. Preprocessing pipeline includes, tractography-based probability constrained deconvolution (CSD) to generate input multimodal matrices of structural measures (FA, MD, AxD, RD). The 3D-CNN model, which trained from ADNI database with 264 individual participants, with an encoder-classifier architecture. Proposed model effectively extracts micro structural features from connectome matrix. Our framework achieved stable performance, accuracy 98.01 %, sensitivity 98.37 %, specificity 98.23 %, F1-score 97.85 %, AUC 0.99, demonstrating its potential as robust and accurate tool for early diagnosis AD.}, archive = {J_ASOC}, author = {Amir Mohammad Ahmadi Dana and Mohammad Reza Karami Mollaei and Jamal Ghasemi}, doi = {10.1016/j.asoc.2025.114006}, journal = {Applied Soft Computing}, month = {12}, pages = {114006}, shortjournal = {Appl. Soft. Comput.}, title = {Detection of alzheimer's disease using 3D-CNN model based on multimodal connectome}, volume = {185}, year = {2025}, }
• (2025). Hyperbolic spatial-temporal network for session-based recommendation. ASOC, 185, 113996. (www)

  @article{ , abstract = {The goal of Session-based recommendation is to recommend the next item a user may be interested in based on historical click data, without relying on user profiles. Compared to the data from other recommendation scenarios, session data is typically more sparse, thus Self-supervised learning (SSL), which derives ground-truth from raw data, has gradually gained attention. Existing SSL methods usually augment data by dropping or transforming original sequences in Euclidean space, leading to two problems. Firstly, in Euclidean space, it is difficult to handle the distorted distribution and hierarchical nature of session data, and secondly, the essential spatial and temporal features of session data are usually overlooked. To address these issues, we propose the Hyperbolic Spatial-Temporal Network ( HSTN ), which enhances the performance by generating positive samples with the spatial-temporal features of session data in hyperbolic space. Specifically, we first use a hyperbolic hypergraph neural network as the base encoder to mitigate the influence of distorted data distribution. Then, we employ a spatial-temporal feature learning module to generate positive samples with spatial-temporal features for contrastive learning. Extensive experiments on three real-world datasets demonstrate that our proposed method achieves improvements of 11.6 %, 17.6 %, and 38.4 %, respectively, compared to current state-of-the-art methods, under P@10 metric.}, archive = {J_ASOC}, author = {Jiaxin Zhang and Yulong Wang and Tongcun Liu and Lei Zhang and Wei Li and Jianxin Liao}, doi = {10.1016/j.asoc.2025.113996}, journal = {Applied Soft Computing}, month = {12}, pages = {113996}, shortjournal = {Appl. Soft. Comput.}, title = {Hyperbolic spatial-temporal network for session-based recommendation}, volume = {185}, year = {2025}, }
• (2025). Paradigm shift in mobility optimization with multilayered five-way decision model using rough sets. ASOC, 185, 113994. (www)

  @article{ , abstract = {To solve the complicated transportation and mobility problems that arise in Industry 4.0, this study creates a new five-way decision (FWD) architecture. It has four levels of evaluation based on rough sets (RSs) and fermatean fuzzy sets (FFSs). The new method adds two more choice areas to the usual three-way decision (TWD) framework. It establishes a more complex and varied sorting system. We begin by developing FWD specific relative gain and loss functions, establishing the foundation for the five-zone decision-making process. This study shows how reliable the threshold values are and how they can be used to set upper and lower decision limits, along with their properties. Gray relational analysis determines conditional probabilities to ensure that evaluations are correct at all levels, especially when the characteristics of the options are missing or unclear. We explore the proposed FWD model and how it can be used to find the best transportation strategy for urban mobility networks. We also address how the model can help people make decisions in a complicated, multilayered environment. We conduct tests for accuracy and reliability to verify the authenticity of the results. We can still expand the application of this approach in mobility management and overall transport planning.}, archive = {J_ASOC}, author = {Muhammad Kamran and Qingyu Zhang and Dragan Pamucar and Muhammad Tahir and Muhammad Jafar Hussain}, doi = {10.1016/j.asoc.2025.113994}, journal = {Applied Soft Computing}, month = {12}, pages = {113994}, shortjournal = {Appl. Soft. Comput.}, title = {Paradigm shift in mobility optimization with multilayered five-way decision model using rough sets}, volume = {185}, year = {2025}, }
• (2025). Intelligent compressive strength prediction of sustainable rubberised concrete using an optimised interpretable deep CNN-LSTM model with attention mechanism. ASOC, 185, 113993. (www)

  @article{ , abstract = {The increasing environmental concerns associated with waste rubber disposal, particularly from used tyres, have led to the exploration of rubberised concrete as a sustainable construction material. Rubberised concrete provides benefits like enhanced flexibility and energy absorption; however, its reduced compressive strength remains a challenge for structural applications. This study puts forward an advanced deep learning model to accurately evaluate compressive strength of rubberised concrete by combining a hybrid convolutional neural network (CNN) and long short-term memory (LSTM) network enhanced with attention mechanism, and optimised using the enhanced firefly algorithm (EFA), featuring chaotic initialisation and nonlinear learning factor for improved convergence, for hyperparameter tuning. The proposed model introduces computing novelties: attention-guided CNN-LSTM feature fusion and chaos-enhanced firefly optimisation. Then, it is trained on an extensive dataset incorporating key mix parameters, including water, cement, supplementary cementitious materials, superplasticiser, coarse and fine aggregates, crumb and chipped rubber content, and concrete age, with validation supported by experimental tests in the laboratory. The proposed model achieves superior prediction accuracy, achieving R² values of 0.967 for training and 0.943 for testing, outperforming conventional machine learning methods. Evaluation metrics showcase the superior performance of model, with root mean square error of 2.966 MPa and 3.757 MPa for training and test data, respectively. A sensitivity analysis based on SHapley Additive exPlanations (SHAP) highlights coarse aggregate, rubber content, and concrete age as the most influential variables affecting compressive strength. By providing a highly accurate, interpretable, and cost-effective predictive tool, this research facilitates the optimisation of rubberised concrete mix design, supporting its broader adoption in sustainable construction practice.}, archive = {J_ASOC}, author = {Yang Yu and Roshan Jayathilakage and Yiyang Liu and Ailar Hajimohammadi}, doi = {10.1016/j.asoc.2025.113993}, journal = {Applied Soft Computing}, month = {12}, pages = {113993}, shortjournal = {Appl. Soft. Comput.}, title = {Intelligent compressive strength prediction of sustainable rubberised concrete using an optimised interpretable deep CNN-LSTM model with attention mechanism}, volume = {185}, year = {2025}, }
• (2025). Passenger flow prediction between subway stations based on congestion state parameters and composite neural network. ASOC, 185, 113991. (www)

  @article{ , abstract = {Traditional methods for predicting passenger flow often struggle with accuracy, data acquisition challenges, and limited applicability, failing to capture the dynamics of passenger flow variations. This study develops two novel neural network models—LSTM-RBF and LSTM-BiGRU—to predict metro station-to-station passenger flow, offering a new approach to address the above issues. Firstly, to improve the quality of acquired data, Savitzky-Golay algorithm is adopted to remove noisy data. Secondly, the kernel density estimation (KDE) is employed to convert discrete state parameters into flow curves. Thirdly, Gaussian Mixture Model (GMM) is used to classify flow curve characteristics, categorizing different station segment types. Finally, the performance of the proposed neural network models is evaluated against traditional networks using Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and Mean Absolute Percentage Error (MAPE). The results of the combined prediction error results under the four types of station segment scenarios show that the developed LSTM-RBF model reduces the prediction error by up to 79 %, while the developed LSTM-BiGRU model reduces the prediction error by 68 %, which indicates that the proposed methodology has different performances in different types of station segments, and effectively solves the problems of narrow scope of application of a single type of passenger flow prediction model and low prediction accuracy, low robustness of the model.}, archive = {J_ASOC}, author = {Shaofeng Wang and Guotao Gong and Yalei Liu and Feng Guo}, doi = {10.1016/j.asoc.2025.113991}, journal = {Applied Soft Computing}, month = {12}, pages = {113991}, shortjournal = {Appl. Soft. Comput.}, title = {Passenger flow prediction between subway stations based on congestion state parameters and composite neural network}, volume = {185}, year = {2025}, }
• (2025). A proximal policy optimization driven hyper-heuristic for workers constrained hybrid flow shop problem. ASOC, 185, 113990. (www)

  @article{ , abstract = {As the production environment becomes increasingly complex, the integration of soft computing techniques becomes essential for addressing resource-constrained scheduling problems. This paper delves into a worker constrained hybrid flow shop scheduling problem (WHFSP) that integrates worker resources at each processing stage. A mixed-integer linear programming (MILP) model is constructed which enables the use of mathematical solvers to obtain optimal solutions for small-scale instances. Additionally, a novel soft computing-based scheduling framework, namely a proximal policy optimization-based hyper-heuristic algorithm (PPO-HH), is proposed. It automatically selects the most suitable low-level heuristic strategies based on the current state and historical data, facilitating efficient exploration and exploitation of the complex decision space. Several low-level heuristics including perturbative and local search operators are developed to explore the solution space. Subsequently, a high-level control strategy based on proximal policy optimization is proposed. A solution quality evaluation function and a reward mechanism based on problem characteristics are formulated. This mechanism provides feedback to PPO-HH based on the degree of alignment between the actions taken by the agent and the objectives, gradually optimizing the selection of low-level heuristic strategies. Eventually, it generates a probability distribution for each low-level heuristic in the given environment. Comprehensive numerical experiments are conducted to evaluate the performance of both the MILP model and the components of the PPO-HH algorithm. The comparison results show that PPO-HH is effective and efficient for solving the WHFSP.}, archive = {J_ASOC}, author = {Shengnan Ding and Weishi Shao and Zhongshi Shao and ShengTao Peng and Dechang Pi and Jiaquan Gao}, doi = {10.1016/j.asoc.2025.113990}, journal = {Applied Soft Computing}, month = {12}, pages = {113990}, shortjournal = {Appl. Soft. Comput.}, title = {A proximal policy optimization driven hyper-heuristic for workers constrained hybrid flow shop problem}, volume = {185}, year = {2025}, }
• (2025). A self-supervised framework for mesh denoising using graph neural networks in dental applications. ASOC, 185, 113989. (www)

  @article{ , abstract = {Complete and noise-free tooth models are crucial for digital dental technology, which is widely used in dental health diagnosis. However, tooth data from real-scene scans and tooth models reconstructed by deep learning are often affected by noise, which increases the difficulty of treatment for healthcare professionals. In recent years, graph neural networks (GNNs) have made significant progress in the field of mesh denoising, but these methods often struggle to accurately capture local details when dealing with complex dental mesh models and rely on large-scale datasets requiring higher data quality. In order to obtain noise-free tooth models with realistic geometric visualization from noisy tooth data, this paper proposes a self-supervised mesh denoising framework that can automatically learn features without labels, reduce the dependence on a large amount of labeled data, and effectively deal with the challenge of data scarcity in the medical field while preserving key local details. Our core technologies include DAG-ConvNet, a graph convolutional network that combines dynamic attention mechanisms, and PosDeformNet, which fuses local and global information, to optimize normal vectors during denoising and refine vertex positions through vertex deformation networks to achieve efficient denoising of mesh data. In addition, we draw on the Total Variation Loss (TVLoss) strategy in 2D image denoising to reduce noise and geometric deformations by calculating the gradient difference of coordinates between neighboring vertices, which enhances the continuity and detail preservation of 3D meshes. We are the first to apply the self-supervised mesh denoising framework in the field of dentistry. Experimental results show that our proposed framework can effectively denoise the tooth model while preserving fine details such as texture and contour.}, archive = {J_ASOC}, author = {Yutong Hu and Yuze Shi and Haisheng Li and Li Chen}, doi = {10.1016/j.asoc.2025.113989}, journal = {Applied Soft Computing}, month = {12}, pages = {113989}, shortjournal = {Appl. Soft. Comput.}, title = {A self-supervised framework for mesh denoising using graph neural networks in dental applications}, volume = {185}, year = {2025}, }
• (2025). Beyond training horizons: A physics-informed U-net transformer for time-dependent CO₂ storage simulation in environmental applications. ASOC, 185, 113987. (www)

  @article{ , abstract = {CO 2 geological storage is a key strategy for reducing greenhouse gas emissions, requiring accurate modeling of subsurface CO 2 migration is essential for effective storage planning and risk assessment. Conventional numerical simulations, which solve time-dependent nonlinear partial differential equations, provide detailed physical insights but are computationally demanding, especially for large-scale or long-term scenarios. To improve computational efficiency, surrogate models based on machine learning have been increasingly investigated. Methods such as deep learning and physics-Informed neural networks aim to approximate the behavior of physical systems, offering potential reductions in simulation time. However, these approaches often require extensive case-specific datasets and are typically limited to fixed time horizons defined during training, which can restrict their generalizability and practical application. This study presents a time-aware surrogate modeling framework that combines convolutional neural networks with self-attention mechanisms to address these limitations. Drawing inspiration from autoregressive forecasting used in sequential learning models, the proposed approach captures temporal dependencies through iterative prediction of system states.The framework requires only a short-term numerical simulation to initialize the physical system, after which it can generate predictions for arbitrarily extended time horizons without the need for retraining. By enabling long-term forecasting, the method improves efficiency and supports repeated scenario evaluations, such as site screening and well placement optimization. Such predictive capabilities are particularly valuable in addressing environmental sustainability goals, where rapid and scalable simulations are essential for managing long-term subsurface processes under climate-related constraints.}, archive = {J_ASOC}, author = {Ye Liu and Jiahao Wang and Nan Zhang and Xiaodong Qian and Shaojun Chai}, doi = {10.1016/j.asoc.2025.113987}, journal = {Applied Soft Computing}, month = {12}, pages = {113987}, shortjournal = {Appl. Soft. Comput.}, title = {Beyond training horizons: A physics-informed U-net transformer for time-dependent CO₂ storage simulation in environmental applications}, volume = {185}, year = {2025}, }
• (2025). Evaluating CEO hubris effects on sustainable performance in the IC design industry: An integrated dynamic network DEA framework with machine learning. ASOC, 185, 113986. (www)

  @article{ , abstract = {This study introduces an integrated analytical framework combining dynamic network data envelopment analysis (DNDEA) with machine learning to assess the impact of CEO hubris on sustainable performance in the integrated circuit (IC) design industry. Our two-stage DNDEA model evaluates operational and R&D efficiency separately, incorporating intermediate factors including profit and ESG scores. We develop a novel text-based measure of CEO hubris by analyzing the contrast between confidence and conservatism language in annual shareholder reports. This hubris measure is then incorporated into predictive models, where we compare traditional linear regression against advanced machine learning approaches—support vector regression (SVR) and random forest (RF)—using cross-validation and hyperparameter optimization. The analysis reveals a significant negative correlation between CEO hubris and operational and R&D efficiency. Notably, the non-linear models (SVR and RF) demonstrate superior predictive accuracy compared to linear regression across varying levels of CEO hubris. These findings yield two primary contributions: first, they establish the critical need for monitoring hubristic leadership behavior in innovation-intensive industries, given their detrimental effect on organizational efficiency. Second, they validate the effectiveness of combining text analytics, DNDEA efficiency metrics, and machine learning for evaluating leadership impact on firm performance. This methodology provides a comprehensive framework for analyzing leadership dynamics in the IC design sector and offers an adaptable template for similar analyses across technology-driven industries.}, archive = {J_ASOC}, author = {Sheng-Wei Lin and Yu-Rou Lin}, doi = {10.1016/j.asoc.2025.113986}, journal = {Applied Soft Computing}, month = {12}, pages = {113986}, shortjournal = {Appl. Soft. Comput.}, title = {Evaluating CEO hubris effects on sustainable performance in the IC design industry: An integrated dynamic network DEA framework with machine learning}, volume = {185}, year = {2025}, }
• (2025). FSAMLM: A few-shot adaptation multimodal large model for cross-domain fault diagnosis. ASOC, 185, 113985. (www)

  @article{ , abstract = {Recent advances in deep learning have demonstrated remarkable performance in mechanical fault diagnosis. However, most existing approaches are designed for a single data modality or a single task, limiting their flexibility and generalization ability. Moreover, common knowledge across different tasks remains largely unexploited. Inspired by the success of large-scale models in natural language processing and computer vision, integrating multimodal data with multi-task learning strategies may significantly improve the performance of fault diagnosis models. Nonetheless, a significant gap exists between general pre-trained knowledge and domain-specific expertise, posing considerable challenges for effective integration. To address these issues, we propose a novel few-shot adaptation multimodal large model (FSAMLM) that efficiently captures shared representations through a parameter-efficient fine-tuning strategy, structured in two stages. Specifically, we first design a low-rank adaptation meta-learning (LoRAML) framework, which employs low-rank decomposition on pre-trained parameters to reduce computational complexity and improve robustness. This approach not only accelerates adaptation to new few-shot tasks but also preserves pre-training knowledge effectively. During the second fine-tuning stage, we implement target-domain training with limited samples and introduce a training-free inference option for real-world deployment. Experimental validation using six public datasets demonstrates FSAMLM’s superior domain generalization capability in few-shot fault diagnosis tasks compared to existing methods. The code repository is publicly available at: https://github.com/ohhyeeaah/FSAMLM-for-fault-diagnosis .}, archive = {J_ASOC}, author = {Xin Zhang and Shixi Liu and Li Jiang and Yibing Li}, doi = {10.1016/j.asoc.2025.113985}, journal = {Applied Soft Computing}, month = {12}, pages = {113985}, shortjournal = {Appl. Soft. Comput.}, title = {FSAMLM: A few-shot adaptation multimodal large model for cross-domain fault diagnosis}, volume = {185}, year = {2025}, }
• (2025). Simplified directional message passing neural network for prediction of protein-ligand binding affinity. ASOC, 185, 113983. (www)

  @article{ , abstract = {Effective prediction of protein-ligand binding affinity can dramatically accelerate drug discovery. Recent studies have shown that graph neural networks have great potential in the field of binding affinity prediction. However, previous models for binding affinity prediction have not made good use of the three-dimensional (3D) information in complex graphs, and the presence of redundancy during the message passing process has adversely impacted model performance. In light of these limitations, we propose a novel binding affinity prediction model named Simplified Directional Message Passing Neural Network (SimdNet). Our network comprises a message passing module that capitalizes on the quantum information of the protein-ligand system, encompassing both radial and angular information, while mitigating redundancy during message passing. Additionally, we introduce a readout module that focuses on local interactions. In a more realistic and challenging evaluation scenario—using a larger dataset with mixed-quality data—our model outperforms the strongest baseline with a 3.4 % lower RMSE, and through ablation experiments, we validate the efficacy of each module. Our implementation is available at https://github.com/AILBC/SimdNet .}, archive = {J_ASOC}, author = {Yankai Yu and Yongquan Jiang and Yan Yang and Zhuyang Xie and Qun Lu}, doi = {10.1016/j.asoc.2025.113983}, journal = {Applied Soft Computing}, month = {12}, pages = {113983}, shortjournal = {Appl. Soft. Comput.}, title = {Simplified directional message passing neural network for prediction of protein-ligand binding affinity}, volume = {185}, year = {2025}, }
• (2025). A YOLOv3-powered edge computing technique for real-time rear-end collision prediction in autonomous vehicles. ASOC, 185, 113981. (www)

  @article{ , abstract = {Rear-end collisions are the prime cause of traffic casualties and to avoid these casualties, rear-end collision prediction has procured recognition for smart transportation. The traditional research on rear-ends collision prediction techniques involved Perception-Reaction Time (PRT) parameter which leads to reduced adaptive competence for different PRTs and yields degraded performance. Thus, learning-based techniques were proposed to deal with the related issues and are facing challenges with reference to feature extraction and prediction performance. The paper presents an optimized YOLOv3 based Rear-end Collision Prediction (YOLO-RECP) to address the traffic casualties caused by rear-end collisions. In YOLO-RECP, the real-time NGSIM dataset is streamlined and expanded to extenuate the class imbalance issue using Smote Gaussian Mixture (SGM) technique. After pre-processing the dataset, it acts as input for testing and training of the optimized YOLOv3 network. Then, the proposed system model outputs different classes of collision warnings in real-time. The simulation results demonstrate that YOLO-RECP outperformed baseline YOLOv3, RCPM, MCWA, Honda, and Berkeley techniques by predicting the possible rear-end collisions.}, archive = {J_ASOC}, author = {Divya Punia and Rajender Kumar}, doi = {10.1016/j.asoc.2025.113981}, journal = {Applied Soft Computing}, month = {12}, pages = {113981}, shortjournal = {Appl. Soft. Comput.}, title = {A YOLOv3-powered edge computing technique for real-time rear-end collision prediction in autonomous vehicles}, volume = {185}, year = {2025}, }
• (2025). Machine learning-based adaptive large neighborhood search algorithm for the integrated vessel scheduling and speed optimization problem in the compound channel. ASOC, 185, 113980. (www)

  @article{ , abstract = {The carbon emission from vessel navigating in the channel accounts for about 61 % of the total emissions in port areas. Considering an effective means of reducing emissions, namely, speed adjustment, this study deals with an integrated problem of vessel scheduling and speed optimization (VSSOP) in the channel. This study considers the complex structure of a compound channel, i.e., containing both one-way and two-way lanes with different navigation rules. We also focus on the effects of meteorological conditions (winds, waves and currents) on the vessel stall, and tidal restrictions on the time window for large vessels to pass through the channel. Thus, a mixed integer programming (MIP) model for the VSSOP is proposed to control the carbon emissions in the channel. Then, we develop a machine learning-based adaptive large neighborhood search (ALNS) approach, where the ALNS is used to solve the proposed MIP in real cases and the dynamic machine learning approach helps to evaluate and fit the complex effects of multiple meteorological conditions on the vessel sailing speed. The dynamic parallel mechanism is further introduced to improve the fitting accuracy of the machine learning part without increasing the running time of the ALNS. The experimental results reveal that the machine learning-based ALNS approach can be applied in practice. Additionally, valuable managerial insights for port operators are obtained to aid in vessel traffic management.}, archive = {J_ASOC}, author = {Jian Du and Shan Lin and Liming Guo and Jianfeng Zheng}, doi = {10.1016/j.asoc.2025.113980}, journal = {Applied Soft Computing}, month = {12}, pages = {113980}, shortjournal = {Appl. Soft. Comput.}, title = {Machine learning-based adaptive large neighborhood search algorithm for the integrated vessel scheduling and speed optimization problem in the compound channel}, volume = {185}, year = {2025}, }
• (2025). Improving mutation strategies in differential evolution with a new pbest selection mechanism. ASOC, 185, 113978. (www)

  @article{ , abstract = {Differential evolution, which belongs to a group of population-based algorithms, has received a lot of research attention since its introduction in 1995. A population-based algorithm is required to guide individuals to visit potentially better basins of attraction in the search space when searching for a globally optimal solution. Additionally, individuals need to interact with each other during an evolutionary process to explore the search space effectively. In this paper, we propose a novel pbest selection mechanism for DE/current-to-pbest mutation strategy and its variants designed to enhance the potential for exploration of different attraction basins. The proposed mechanism enforces a minimal distance between the selected pbest individual and all other better individuals. This means that possible candidates for the pbest individual, used in mutation, are further spaced apart. As a result, the likelihood that the new trial vector will be generated in a different attraction basin of the search space is increased. The mechanism is incorporated into the L-SHADE, jSO, and L-SRTDE algorithms, and its effectiveness is evaluated using CEC’24 benchmark functions. Experimental results demonstrate improvements in the performance of the selected algorithms, particularly in higher-dimensional problem instances.}, archive = {J_ASOC}, author = {Jan Popič and Borko Bošković and Janez Brest}, doi = {10.1016/j.asoc.2025.113978}, journal = {Applied Soft Computing}, month = {12}, pages = {113978}, shortjournal = {Appl. Soft. Comput.}, title = {Improving mutation strategies in differential evolution with a new pbest selection mechanism}, volume = {185}, year = {2025}, }
• (2025). Transformer-guided optimization of railway alignments using an adaptive rapidly-exploring random tree algorithm. ASOC, 185, 113977. (www)

  @article{ , abstract = {Railway alignment design is a crucial part of a railway project. Despite the widespread success of computer-aided alignment optimization methods in determining alignments, effectively exploring the objective function’s descent direction (OFDD) remains challenging, particularly when navigating complex alignment search spaces. To address this issue, it is essential to comprehensively consider key factors, including the global and local environment, explored and unexplored search spaces, as well as established alignment search strategies and potential new ones that may emerge during the OFDD optimizing process. Therefore, an alignment-oriented Transformer framework is formulated in this work. In this framework, various real-world railway cases are input into a stacked Transformer framework to learn an optimized OFDD strategy. Specifically, the model handles regular inputs (i.e., global and local contexts, long-term goals) and irregular inputs (i.e., historical paths) using two separate stacked Transformer encoders. Afterward, an adaptive rapidly-exploring random tree star (Ada-RRT-star) method is developed by integrating the Transformer framework’s output to guide RRT’s search direction as well as to enhance the solution quality. Ultimately, the proposed method is applied to a realistic railway case, where the results demonstrate its superiority over the conventional 3D-RRT-star algorithm in terms of solution quality. Besides, the best alignment generated by the Ada-RRT-star also outperforms the manually-designed alignment.}, archive = {J_ASOC}, author = {Xinjie Wan and Hao Pu and Paul Schonfeld and Yang Ran and Taoran Song and Lihui Peng}, doi = {10.1016/j.asoc.2025.113977}, journal = {Applied Soft Computing}, month = {12}, pages = {113977}, shortjournal = {Appl. Soft. Comput.}, title = {Transformer-guided optimization of railway alignments using an adaptive rapidly-exploring random tree algorithm}, volume = {185}, year = {2025}, }
• (2025). A label enhancement based positive-unlabeled hybrid network for pump bearing intelligent fault diagnosis. ASOC, 185, 113976. (www)

  @article{ , abstract = {Bearings are important support parts for rotating machinery such as pumps, and the application of machine learning algorithms has brought the fault diagnosis of bearings to a more intelligent stage. However, with the scarcity of target fault data and the lack of accurate labeling for critical data, commonly used data-driven fault diagnosis methods had its limitations. Inspired by semi-supervised learning, hypergraph and knowledge distillation theories, a hybrid PUHGNN network based on label augmentation was proposed in this paper. Firstly, a hypergraph neural network (HGNN) structure based on the multi-resolution signal was proposed to measure the correlation at multiple scales to make difference and connections between different labels. Secondly, the HGNN network is improved by combining HGNN and Positive-Unlabeled (PU) Learning ideas to form a new PUHGNN label enhancing mechanism which will solve the lacking of labels. Lastly, a soft-label-based label selection method is proposed to dynamically judge the similarity of samples to reiterate, which will make the otherwise indistinguishable faults more explicit. In experimental session, the CWRU dataset and the enviormental protection pump bearing datasets were applied to conduct unbalance, mislabel, extreme mislabel and ablation experiments. The result shows that the label enhancement is not only necessary but significant in the unbalanced under-labeled datasets, furthermore, the PUHGNN has more obvious enhancement compared to other methods.}, archive = {J_ASOC}, author = {Jiaxing zhu and Junlan Hu and Buyun Sheng}, doi = {10.1016/j.asoc.2025.113976}, journal = {Applied Soft Computing}, month = {12}, pages = {113976}, shortjournal = {Appl. Soft. Comput.}, title = {A label enhancement based positive-unlabeled hybrid network for pump bearing intelligent fault diagnosis}, volume = {185}, year = {2025}, }
• (2025). Rural road extraction from remote sensing images based on multi-view contextual information and multi-stage features. ASOC, 185, 113975. (www)

  @article{ , abstract = {Accurate extraction of rural roads from high-resolution optical remote sensing images is of great significance to the development of rural areas, road navigation, rural land resource planning and other applications. Different from urban roads, rural ones with complex terrain backgrounds are often slender and winding, thereby making them more susceptible to vegetation cover. In order to improve the reliability and accuracy of rural road extraction, a Complex Rural Road Extraction Network (CRRENet) is proposed in this work, which consists of five parts: feature encoder, Multi-view Contextual Information Extraction Module (MCIEM), Multi-stage Feature Fusion Module (MFFM), Channel Coordinate Attention Mechanism (CCAM) and feature decoder. The MCIEM extracts the multi-view contextual information by the parallel dilated convolution with different dilation rates. To avoid the loss of image details, the MFFM integrates different feature maps from the downsampling stages. By adjusting the weights of feature maps, the CCAM enables the network to self-adaptively suppress the background noise and focus on the road foreground. Ablation and comparison validate CRRENet's superiority.}, archive = {J_ASOC}, author = {Langping Li and Jizheng Yi and Pengyu Lei and Hengkai Lou and Xiaoyao Li and Hui Lin}, doi = {10.1016/j.asoc.2025.113975}, journal = {Applied Soft Computing}, month = {12}, pages = {113975}, shortjournal = {Appl. Soft. Comput.}, title = {Rural road extraction from remote sensing images based on multi-view contextual information and multi-stage features}, volume = {185}, year = {2025}, }
• (2025). Joint stage features modulation for progressive blind face restoration. ASOC, 185, 113974. (www)

  @article{ , abstract = {A significant challenge for Blind Face Restoration (BFR) is to cope with the degraded information of unknown parameters in face images. The BFR method has evolved from non-prior to prior-based methods, but there are still some shortcomings. The quality of priors seriously affects the restoration results, especially in scenarios with severe degradation. Simultaneously encoding or modulating degraded images directly into the restoration process can introduce degraded information, leading to poor visual perception. Therefore, we propose a progressive restoration model with the joint stage features modulation, named JSFM-GAN. JSFM-GAN can be seen as having two stages. In the first stage, the LQ image is modulated with the facial resolution map to provide a rough structure for recovery. In the second stage, Joint Stage Feature Modulation (JSFM) utilizes the LQ images and stage features for joint modulation on multiple scales to balance fidelity and realism by combining clean spatial information of stage features and the tonal structure of LQ images. At the same time, the Up-Sampling Feature Supplement Block (UFSB) is used to reduce information loss due to channel fading and improve the network’s focus on face components and textures. In addition, we use the stage reconstruction loss and adjusted facial parsing maps to enhance the realism and symmetry of the generated results. Experiments with JSFM-GAN on synthetic and real-world datasets achieve good results, demonstrating the superior performance of our method.}, archive = {J_ASOC}, author = {Xianlun Tang and Xiaodong Qian and Jie Li and Binyu Lu and Wuquan Deng and Weisheng Li}, doi = {10.1016/j.asoc.2025.113974}, journal = {Applied Soft Computing}, month = {12}, pages = {113974}, shortjournal = {Appl. Soft. Comput.}, title = {Joint stage features modulation for progressive blind face restoration}, volume = {185}, year = {2025}, }
• (2025). Mamba-based multi-branch cost aggregation for stereo matching. ASOC, 185, 113973. (www)

  @article{ , abstract = {This study presents Mamba-Based Multi-Branch Cost Aggregation for Stereo Matching (MMBStereo), an innovative real-time stereo matching framework with high performance. The core innovation lies in the Mamba-based multi-branch cost aggregation network, which uses a unique three-branch aggregation strategy. The Mamba Aggregation Branch integrates the State Space Model from the Mamba structure, replacing conventional convolution and Transformer methods, significantly enhancing network performance and efficiency. The Spatial Aggregation Branch addresses the loss of spatial texture information, improving the scene’s contextual representation. Meanwhile, the Edge Aggregation Branch enhances edge responses, improving object boundary detection accuracy. Through a carefully designed multi-branch fusion strategy, the framework improves disparity prediction accuracy while maintaining real-time inference. Our method achieves competitive accuracy with non-real-time stereo matching frameworks, surpassing existing lightweight solutions in the widely recognized KITTI benchmark tests.}, archive = {J_ASOC}, author = {Xingyuan Lu and Yanbing Xue and Leida Li and Shiyin Li and Zan Gao}, doi = {10.1016/j.asoc.2025.113973}, journal = {Applied Soft Computing}, month = {12}, pages = {113973}, shortjournal = {Appl. Soft. Comput.}, title = {Mamba-based multi-branch cost aggregation for stereo matching}, volume = {185}, year = {2025}, }
• (2025). Multilinear hyperspectral unmixing based on autoencoder and recurrent neural network. ASOC, 185, 113972. (www)

  @article{ , abstract = {Spectral unmixing techniques estimate the endmember spectra and corresponding abundance fractions that constitute the pixels of hyperspectral remote sensing images, revealing the mixing mechanisms of materials within pixels. In recent years, deep learning has shown significant potential in advancing spectral unmixing, particularly in nonlinear scenarios. However, most existing nonlinear models rely on bilinear mixing frameworks, with limited focus on high-order nonlinear models. This restricts their ability to capture complex interactions such as multiple light scattering events. To address this issue, this work proposes an unsupervised unmixing method leveraging an autoencoder network framework and the multilinear mixing model (MLM). It employs a recurrent neural network (RNN) in the decoder to simulate the multiple scattering of light between materials. Unlike conventional multilinear approaches that rely on explicit mathematical formulations, the proposed method leverages the RNN to automatically learn and approximate the nonlinear interactions of light. Moreover, the RNN weights are adaptively updated during training and interpreted as transition probabilities representing further light interactions among materials, endowing the model structure with explicit physical interpretation. Besides, a new stopping criterion is also designed, which ensures better RNN weights are obtained during backpropagation. Experiments conducted on both synthetic and real datasets demonstrate the better performance of the proposed method.}, archive = {J_ASOC}, author = {Zehui Jin and Xiaorui Yi and Yue Liu and Hongjuan Zhang}, doi = {10.1016/j.asoc.2025.113972}, journal = {Applied Soft Computing}, month = {12}, pages = {113972}, shortjournal = {Appl. Soft. Comput.}, title = {Multilinear hyperspectral unmixing based on autoencoder and recurrent neural network}, volume = {185}, year = {2025}, }
• (2025). Deadline-constrained and bi-objective workflow scheduling with fuzziness in cloud computing systems. ASOC, 185, 113970. (www)

  @article{ , abstract = {Deploying intelligent expert systems on the cloud is a cost-effective solution for handling compute-intensive service requests, where each request is treated as a workflow processing procedure. Cloud workflows break down complex service requests into smaller tasks and take advantage of automatic maintenance services provided by the cloud workflow management system (CWMS). CWMS can orchestrate task execution, handle dependencies, and direct dynamic scaling of resources based on workload demands. For a CWMS, the main challenge lies in the uncertainty of workflow scheduling, i.e., the processing time, the data transmission time, and the due date are not crisp values. This paper investigates the problem of bi-objective workflow scheduling under fuzziness, aiming to minimize both the total rental cost and the degree of user dissatisfaction. Triangular fuzzy numbers are used to represent the uncertainty of temporal parameters. Two general pricing models in cloud systems are considered: on-demand and reserved price structures. A bi-objective fuzzy workflow scheduling framework is proposed, which consists of workflow sequencing, fuzzy solution generation and solution improvement components. The workflow sequencing component determines the priorities of the workflows. The fuzzy solution generation component assigns tasks to appropriate resources. The Simulated Annealing with Variable Neighborhood Search (SAVNS) method is developed for the solution improvement component. The experimental results demonstrate that the proposal can achieve better effectiveness and robust performance than the baseline algorithms compared. The proposed method can offer practical solutions for CWMS to optimize cost-performance trade-offs in uncertain environments.}, archive = {J_ASOC}, author = {Jie Zhu and Fengmei Liu and Jingzhe Sun and Haiping Huang}, doi = {10.1016/j.asoc.2025.113970}, journal = {Applied Soft Computing}, month = {12}, pages = {113970}, shortjournal = {Appl. Soft. Comput.}, title = {Deadline-constrained and bi-objective workflow scheduling with fuzziness in cloud computing systems}, volume = {185}, year = {2025}, }
• (2025). Detail-aware semantic segmentation network for brain tumor MRI images combining multi-frequency directional filtering and lifting wavelets. ASOC, 185, 113969. (www)

  @article{ , abstract = {Brain tumors segmentation in Magnetic Resonance Imaging (MRI) images poses significant challenges owing to the uncertain location and size of the tumors, the difficulty in describing their boundaries, and the fuzzy demarcation of diseased tissues. Although U-Net and its recent variants have emerged as leading models for semantic segmentation in medical imaging, they still face structural limitations. These limitations cause the erosion of detail information during downsampling and poor performance in segmenting small lesions when handling targets of varying sizes, indicating a lack of detail handling capability. To counteract these issues, we designed a segmentation model that enhances detail features using frequency information. To reduce the loss of feature information during downsampling, we developed a downsampling module based on lifting wavelets. By lifting wavelets to group and integrate features according to frequency from high to low, we reduce feature resolution while enhancing information transmission and minimizing feature information loss. In our designed multi-frequency directional filtering edge feature extraction module, we extract low-frequency and high-frequency features and construct a dual-channel multi-directional filtering combination. This combination extracts directional information from low-frequency and high-frequency features separately, increasing the multi-angle directional information of the features and enriching the detailed information such as direction and position within the features. On the BraTS2018, BraTS2020, and BraTS2024 brain tumor datasets, our model demonstrated optimal results compared to 14 other advanced models. The average Dice Similarity Coefficients are 78.48 %, 79.80 %, and 74.35 %, while the 95th percentile Hausdorff Distances are 5.75, 6.60, and 7.72. Our code link is https://github.com/Eric-H8/BraTS_Seg_Model .}, archive = {J_ASOC}, author = {Xin Hua and Zhijiang Du and Hongjian Yu and Zibo Li and Qiaohui Lu and Hui Zhao}, doi = {10.1016/j.asoc.2025.113969}, journal = {Applied Soft Computing}, month = {12}, pages = {113969}, shortjournal = {Appl. Soft. Comput.}, title = {Detail-aware semantic segmentation network for brain tumor MRI images combining multi-frequency directional filtering and lifting wavelets}, volume = {185}, year = {2025}, }
• (2025). Extracting knowledge from limited data: An updated review of data-driven and model-driven few-shot learning for agriculture. ASOC, 185, 113968. (www)

  @article{ , abstract = {Deep learning has demonstrated considerable success in agricultural applications. However, its conventional implementations heavily depend on large-scale labelled datasets—a requirement that is often impractical in agriculture due to data scarcity, high annotation costs, or environmental variability. While insufficient training data can significantly limit the performance of standard deep learning models, Few-Shot Learning (FSL) has emerged as a transformative paradigm, enabling robust model training with minimal labelled samples by utilising limited data for training instead. Despite its potential, a critical review assessing how FSL addresses expert system challenges in agriculture remains notably absent. This paper attempts to fill this void by presenting an updated comprehensive review of FSL's applications in agriculture. We categorise FSL methodologies into two primary approaches: data processing-driven and model learning-driven. Data processing–driven approaches address data scarcity by enriching representational diversity through synthetic samples generated with models such as generative adversarial networks, or by transferring knowledge from related domains to improve generalisation. In contrast, model learning–driven strategies confront the same challenge through specialised architectures and optimisation techniques that enable effective generalisation from limited samples. Within this taxonomy, data processing–driven paradigms include transfer learning and generative artificial intelligence, while model learning–driven paradigms cover metric learning methods such as Siamese or prototypical networks, together with model-based and optimisation approaches designed for efficient generalisation. Our analysis pinpoints cutting-edge technologies within each sector, shedding light on overlooked areas and opportunities where FSL can harness limited data to yield promising outcomes when used to solve problems in agriculture.}, archive = {J_ASOC}, author = {Kam Meng Goh and Usman Ullah Sheikh and Jun Kit Chaw and Weng Kin Lai and Weng Chun Tan and Santhi Krishnamoorthy}, doi = {10.1016/j.asoc.2025.113968}, journal = {Applied Soft Computing}, month = {12}, pages = {113968}, shortjournal = {Appl. Soft. Comput.}, title = {Extracting knowledge from limited data: An updated review of data-driven and model-driven few-shot learning for agriculture}, volume = {185}, year = {2025}, }
• (2025). Rapid attribute and scale selection with adaptive three-way sampling and neighborhood rough set. ASOC, 185, 113966. (www)

  @article{ , abstract = {As a key issue in knowledge reduction for multi-scale data, attribute and scale selection has attracted increasing attention in recent years. However, with the rapid growth of data volumes, most existing methods are inefficient for large-scale multi-scale data and struggle to effectively handle heterogeneous multi-scale data, significantly limiting their practical applications. To address this situation, this paper proposes a rapid attribute and scale selection method to deal with large nominal-and-numerical mixed multi-scale decision systems (NN-MDSs). First, the theory and algorithm of adaptive incremental support vector data description (AISVDD) are presented. The AISVDD algorithm overcomes the limitations of traditional support vector data description methods and efficiently processes both class-balanced and class-imbalanced data. By using the algorithm, support vectors can be quickly obtained from large data. Next, an adaptive three-way sampling technique is derived by combining AISVDD and three-way decision. With this technique, support vectors are extracted as sampling results and put into the boundary region, and outliers are seen as noise and put into the negative region. This significantly reduces the data size and improves the data quality. Then, a neighborhood rough set model is built to describe NN-MDSs. Multiple concepts and properties are discussed in the model. Finally, a heuristic attribute and scale selection algorithm is designed to simultaneously choose attributes and scales from the sampled NN-MDS. Detailed experiments demonstrate the effectiveness and superiority of the proposed method. The method performs better than state-of-the-art attribute and scale selection methods on both computational efficiency and classification performance under six benchmark classifiers. It is powerful in handling large NN-MDSs with complex characteristics. This work provides new insights into the complex multi-scale data processing.}, archive = {J_ASOC}, author = {Shujiao Liao and Nan Zhou and Ling Wei and Weiping Ding and Yidong Lin}, doi = {10.1016/j.asoc.2025.113966}, journal = {Applied Soft Computing}, month = {12}, pages = {113966}, shortjournal = {Appl. Soft. Comput.}, title = {Rapid attribute and scale selection with adaptive three-way sampling and neighborhood rough set}, volume = {185}, year = {2025}, }
• (2025). A hybrid wind-PV power generation forecasting model based on uncertainty quantification. ASOC, 185, 113965. (www)

  @article{ , abstract = {Accurate forecasts of wind and photovoltaic power generation are essential for the stable operation of power systems. However, traditional models struggle to quantify the uncertainty during the forecasting process. This paper proposes a hybrid forecasting model to quantify uncertainty. For low shared information, uncertainty is quantified separately and forecasted using independent models; for high shared information, a multi-task model enables joint forecasting. Hyperparameters are adjusted with an evolutionary optimization algorithm. Experimental results show that in short-term forecasting, the model achieves the best performance, with RMSE of 0.0362 and R 2 of 0.9561 for PV, and RMSE of 0.0572 and R 2 of 0.9384 for wind during October to December. The directional error metric indicates superior performance of the proposed model in wind power forecasting. In long-term and comprehensive forecasting experiments, the Diebold-Mariano test confirms the statistical superiority of the proposed model over traditional models. The proposed approach provides an effective model to support real-world decision-making in renewable energy integration.}, archive = {J_ASOC}, author = {Xuan Yang and Yunxuan Dong and Lina Yang and Thomas Wu}, doi = {10.1016/j.asoc.2025.113965}, journal = {Applied Soft Computing}, month = {12}, pages = {113965}, shortjournal = {Appl. Soft. Comput.}, title = {A hybrid wind-PV power generation forecasting model based on uncertainty quantification}, volume = {185}, year = {2025}, }
• (2025). Coverage exploration of unknown obstacle-cluttered environments using a swarm of ground robots. ASOC, 185, 113964. (www)

  @article{ , abstract = {This paper introduces a coverage exploration algorithm for unknown obstacle-cluttered environments using a swarm of ground robots. A key contribution of this work is the proposed fitness function, which balances multiple exploration objectives and encourages robots to disperse effectively, avoiding excessive overlapping visits. The robots are assumed to start from a single corner of the environment, reflecting practical situations where pre-distributing them is not feasible. This setup highlights a key feature of the algorithm, as it enables self-organization and effective distribution of the robots throughout the environment. The robustness of the method is demonstrated through experiments in various environmental setups, showing its resilience to different obstacle structures and reliable performance across diverse scenarios. The approach also leverages the benefits of swarm behavior, where an increasing number of robots improves exploration efficiency through enhanced collaboration and coverage. The algorithm is evaluated against a swarm random walk approach and two multi-robot meta-heuristic methods, significantly outperforming them in terms of coverage efficiency and robustness.}, archive = {J_ASOC}, author = {Khalil Al-rahman Youssefi and Wilfried Elmenreich}, doi = {10.1016/j.asoc.2025.113964}, journal = {Applied Soft Computing}, month = {12}, pages = {113964}, shortjournal = {Appl. Soft. Comput.}, title = {Coverage exploration of unknown obstacle-cluttered environments using a swarm of ground robots}, volume = {185}, year = {2025}, }
• (2025). Federated deep embedded clustering under privacy protection. ASOC, 185, 113963. (www)

  @article{ , abstract = {Deep clustering, a prominent research focus in data mining, utilizes deeply embedded features to reveal the intrinsic statistical structure of data. However, existing deep clustering models rely on centralized datasets, which are impractical in scenarios with data silos and privacy constraints, leading to degraded clustering performance. Considering the privacy protection characteristics of federated learning, this paper incorporates the idea of federated learning into deep clustering, and proposes a federated deep embedding clustering (FDEC) model under privacy protection. FDEC follows a universal client-server structure, coordinating training between clients through a central server to obtain a unified central model. The server updates the global deep embedding and cluster centers based on a hybrid federated averaging strategy, while each client conducts two-stage deep clustering on local data without sharing raw data. To enhance robustness under non-independent and identically distributed (non-IID) conditions, the hybrid strategy improves parameter aggregation effectiveness. Experimental results on both IID and non-IID datasets demonstrate that FDEC is more robust and consistently outperforms centralized deep clustering methods.}, archive = {J_ASOC}, author = {Xiao Xu and Hong Liao and Xu Yang}, doi = {10.1016/j.asoc.2025.113963}, journal = {Applied Soft Computing}, month = {12}, pages = {113963}, shortjournal = {Appl. Soft. Comput.}, title = {Federated deep embedded clustering under privacy protection}, volume = {185}, year = {2025}, }
• (2025). WamGLM: A multimodal large-scale language model for wafer map defect information in-depth query through multi-turn dialogue based on prototypical supervised contrastive learning. ASOC, 185, 113962. (www)

  @article{ , abstract = {To ensure production efficiency and process stability in semiconductor manufacturing, it is of critical importance to detect wafer map defects and perform information query for tracing and solving problems during the manufacturing process. Numerous vision models based on deep learning have been successfully applied to wafer map defect recognition (WMDR), yielding remarkable results. However, the dynamic and in-depth querying of wafer map defect information remains relatively underexplored. Leveraging the rapid advancements in multimodal large language models (MLLMs), this paper proposes a novel approach for wafer map defect information query (WMDIQ). First, following the paradigm of employing cross-modal alignment model to bridge vision and language models, an end-to-end response MLLM: general language model for wafer map (WamGLM), is constructed for WMDIQ. Concurrently, by designing an interactive dialogue framework between large language models (LLMs), the first large-scale multi-turn dialogue dataset: visual multi-turn question answering dataset for wafer map defects (WaferMapVMQA Dataset), is constructed for wafer map defect analysis. Subsequently, WamGLM is trained using a two-stage fine-tuning strategy. In the first stage, a visual fine-tuning method based on prototypical supervised contrastive learning (PSCL) is introduced to enhance the intra-class compactness and inter-class separability of defect features. In the second stage, language fine-tuning is conducted using the WaferMapVMQA Dataset to infuse specialized knowledge into WamGLM. To validate the effectiveness and superiority of the proposed method, experiments are conducted on a real wafer map dataset. The results demonstrate that the proposed method significantly outperforms other methods in both defect recognition performance and information query response performance. Our code is available at: https://github.com/ZihaoLei/WamGLM .}, archive = {J_ASOC}, author = {Shulong Gu and Zihao Lei and Guangrui Wen and Quanning Xu and Zhaojun Steven Li and Xuefeng Chen and Chunsheng Yang}, doi = {10.1016/j.asoc.2025.113962}, journal = {Applied Soft Computing}, month = {12}, pages = {113962}, shortjournal = {Appl. Soft. Comput.}, title = {WamGLM: A multimodal large-scale language model for wafer map defect information in-depth query through multi-turn dialogue based on prototypical supervised contrastive learning}, volume = {185}, year = {2025}, }
• (2025). Representing online reviews using interval type-2 fuzzy Z-numbers for ranking energy-saving appliances. ASOC, 185, 113961. (www)

  @article{ , abstract = {As e-commerce develops and the green consumption concept gains popularity, consumers are increasingly inclined to purchase energy-saving home appliances through e-commerce platforms. However, they often face technical complexities related to specialized energy-saving attributes and an overwhelming number of online reviews. To address these challenges, we have integrated energy-saving features into our online review analysis, incorporating weight calculations. Notably, we propose and prove a method that transforms online review information into interval type-2 fuzzy Z-numbers (IT2FZNs), which comprehensively represent the information to support product ranking. First, based on the energy-saving attributes of energy-saving appliances and their online review data, we extract energy-saving features and online review features, respectively. We then use a combination of TF-IDF-based text mining and BWM-based expert evaluation to determine the weight of each feature. Next, we convert the energy-saving feature data into IT2FZNs according to specific rules. The online review feature data is converted into interval type-2 fuzzy sets (IT2Fs) by considering the sentiment classification results and the accuracy and robustness of the model, and is further combined with the reliability of online reviews to form IT2FZNs. Finally, the alternative products are ranked based on the constructed decision matrix, and the final ranking results are determined. The method's effectiveness and practicality have been demonstrated using real data from energy-saving refrigerators on the JingDong (JD.com) platform, and its robustness and superiority have been further substantiated through comparative experiments.}, archive = {J_ASOC}, author = {Yue Xiao and Ming Li and Ying Li and Hongde Liu}, doi = {10.1016/j.asoc.2025.113961}, journal = {Applied Soft Computing}, month = {12}, pages = {113961}, shortjournal = {Appl. Soft. Comput.}, title = {Representing online reviews using interval type-2 fuzzy Z-numbers for ranking energy-saving appliances}, volume = {185}, year = {2025}, }
• (2025). Multi-criteria linguistic optimization for covert communication in secure LLM-based steganography. ASOC, 185, 113960. (www)

  @article{ , abstract = {This paper presents a novel framework for covert communication through secure steganography using large language models (LLMs). Our approach leverages multi-criteria linguistic optimization to encode secret information directly into stylistic features of auto-regressively generated text. This strategy balances embedding capacity with naturalness and coherence. The secret message is partitioned into fixed-size blocks. Each block is embedded into binary stylistic feature vectors via a surjective linear mapping, which introduces redundancy. This redundancy enables the use of a history-aware cost function that selects stylistic vectors to minimize abrupt transitions and preserve fluency across sentences. Candidate sentences are generated by prompting LLMs with contextual and stylistic constraints. Rejection sampling then ensures exact feature matching and high linguistic quality. Experimental evaluation in multiple LLMs, diverse text contexts, and parameter settings demonstrates effective embedding capacities of up to 0.30 bits per token while maintaining strong linguistic naturalness, validated through perplexity, lexical diversity, readability, and a linguistic acceptability metric. Importantly, decoding recovers the full secret with zero error under ideal conditions. This confirms the reliability of the method. The current work focuses on embedding efficiency and imperceptibility. Robustness against active text alterations and formal undetectability assessments remain open challenges for future research. The proposed multi-criteria linguistic optimization framework offers a promising avenue for advanced covert communication by harmonizing secure information embedding with fluent, human-like language generation.}, archive = {J_ASOC}, author = {Kamil Woźniak and Marek R. Ogiela and Lidia Ogiela}, doi = {10.1016/j.asoc.2025.113960}, journal = {Applied Soft Computing}, month = {12}, pages = {113960}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-criteria linguistic optimization for covert communication in secure LLM-based steganography}, volume = {185}, year = {2025}, }
• (2025). Cooperative driving route planning based on asymmetric multi-agent path planning problem with limited service area constraints. ASOC, 185, 113959. (www)

  @article{ , abstract = {Mobility and logistics service providers operating a vehicle fleet and serving several targets with each vehicle are faced with the challenge of planning efficient and cooperative driving routes while considering all the vehicles. To address this challenge, we present a novel driving route planning method based on an Asymmetric Multi-Agent Path Planning (AMAPP) problem, a variation of the classical Multiple Traveling Salesmen Problem (MTSP). Given a team of m agents (vehicles) that must visit n targets located in a real road network, a set of m optimized open paths (the Plan ) must be found such that each target is visited exactly once. The optimization objective is to minimize the driving distance of the path with the longest driving distance in the Plan (a Min-Max problem) so that this cooperative operation can be completed in the least amount of time. In several cases, the service area for each agent is limited (e.g., certain districts in a city). To simulate this real-world condition, two additional constraints are applied: the maximum geodetic range for each agent, and the maximum spatial range of targets for each agent. An easy-to-apply Genetic Algorithm (GA) with two novel initialization methods is presented to solve this route planning problem. In order to validate the developed route planning method and demonstrate its applicability, the method was tested in a real-world test case where it showed a decent performance. The results show that the applied limited service area constraints not only decrease the average driving distance of the longest route in the route plan, but also reduce the average runtime of the developed solution. Additionally, the performance of the proposed GA was benchmarked using 26 problems based on the TSPLIB instances, where the proposed GA achieved new Best Known Solution (BKS) values for 19 benchmark problems and a result equal to the BKS value for another two problems, demonstrating its superiority and robustness. The developed method can be used for route planning of the mobility and logistics services requiring multiple destinations to be reached by a fleet of vehicles, such as group ride-sharing and last-mile delivery.}, archive = {J_ASOC}, author = {Ali Maktabifard and Dávid Földes}, doi = {10.1016/j.asoc.2025.113959}, journal = {Applied Soft Computing}, month = {12}, pages = {113959}, shortjournal = {Appl. Soft. Comput.}, title = {Cooperative driving route planning based on asymmetric multi-agent path planning problem with limited service area constraints}, volume = {185}, year = {2025}, }
• (2025). A dual-branch self-supervised contrastive learning framework for emotion recognition based on time-frequency fusion. ASOC, 185, 113958. (www)

  @article{ , abstract = {Emotion recognition based on electroencephalography(EEG) signals is becoming a prominent research hotspot due to its wide-ranging applications in brain–computer interfaces (BCIs), mental health assessment, and human-computer interaction. Traditional emotion recognition methods often rely on supervised learning, which requires large amounts of labeled data to effectively train deep models. However, EEG signals exhibit inherent complexity and substantial variability across individuals and sessions, making it challenging to obtain consistent and reliable labels. In this paper, we propose a novel pretraining framework for EEG-based emotion recognition that enables mutual learning between time-domain and time-frequency-domain representations, while requiring simple network architectures. Experimental results demonstrate that our method achieves 84.39 % accuracy on the SEED dataset, and 89.01 % valence accuracy and 79.75 % arousal accuracy on the DEAP dataset using only 10 % labeled data, indicating strong performance under limited label conditions. Furthermore, we evaluate the transfer learning capability of our framework by pretraining it on the SEED dataset and then fine-tuning it on SEED-V. This cross-dataset transfer leads to a 1.9 % absolute improvement in classification accuracy on SEED-V, demonstrating the effectiveness of the learned representations in generalizing across datasets.}, archive = {J_ASOC}, author = {Jie Ouyang and Yangfan Liang and Hong Sun and Xianchao Zhang and Jingxue Chen and Gao Liu and Zhiquan Liu and Yining Liu}, doi = {10.1016/j.asoc.2025.113958}, journal = {Applied Soft Computing}, month = {12}, pages = {113958}, shortjournal = {Appl. Soft. Comput.}, title = {A dual-branch self-supervised contrastive learning framework for emotion recognition based on time-frequency fusion}, volume = {185}, year = {2025}, }
• (2025). A granularity time series forecasting model combining three-way decision and trend information granule. ASOC, 185, 113957. (www)

  @article{ , abstract = {Long-term forecasting of time series plays a vital role across diverse applications but is challenged by error accumulation arising from recursive predictions and the insufficient retention of trend information in conventional methods. To tackle these issues, we propose a novel forecasting model based on granular time series (GTS). The model utilizes an improved L 1 -trend filtering technique to achieve optimal segmentation of information granules, preserving essential trend features. Subsequently, we introduce dual evaluation functions based on distance similarity to jointly drive the three-way decision (TWD) process for aggregating information granules, thereby effectively reducing error propagation. Finally, the aggregated granules serve as inputs to a long short-term memory (LSTM) neural network to generate accurate forecasts. In addition, the proposed model is evaluated on several real-world datasets through sensitivity and comparative analyses. The results demonstrate that the model exhibits strong performance in long-term forecasting tasks.}, archive = {J_ASOC}, author = {Jianuan Qiu and Shuhua Su and Jingjing Qian}, doi = {10.1016/j.asoc.2025.113957}, journal = {Applied Soft Computing}, month = {12}, pages = {113957}, shortjournal = {Appl. Soft. Comput.}, title = {A granularity time series forecasting model combining three-way decision and trend information granule}, volume = {185}, year = {2025}, }
• (2025). Multi-objective genetic programming for binary classification with adaptive thresholds and a generalization-optimizing fitness function. ASOC, 185, 113956. (www)

  @article{ , abstract = {Genetic programming (GP) has been widely applied to classifier construction due to its flexible representation and powerful feature construction capabilities. Existing studies have proposed various fitness functions to improve GP-based classifiers, but most of them rely on a fixed decision threshold. However, when dealing with imbalanced classification problems, a fixed threshold often biases the model toward the majority class, thereby compromising overall performance. To address this issue, in this paper, we propose a novel multi-objective GP framework for constructing binary classifiers with adaptive threshold adjustment. During evolution, the method employs Youden’s Index to dynamically adjust the threshold of each individual, enabling the classifiers to better fit the underlying data distribution. In addition, we introduce a new class separation metric, dist t , to quantify the clarity of class boundaries and enhance the generalization ability of the evolved models. The framework jointly optimizes three objectives: minority class accuracy, majority class accuracy, and the proposed dist t metric. Experiments on 14 imbalanced datasets demonstrate that our method significantly outperforms conventional single-objective GP with fixed thresholds. Further results also confirm the positive impact of the proposed dist t metric on classification performance. Compared to seven existing GP algorithms and five traditional machine learning classifiers, our approach achieves superior overall performance and better generalization ability.}, archive = {J_ASOC}, author = {Minghui Bai and Yuan Gao and Xiaoying Gao and Jianbin Ma}, doi = {10.1016/j.asoc.2025.113956}, journal = {Applied Soft Computing}, month = {12}, pages = {113956}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-objective genetic programming for binary classification with adaptive thresholds and a generalization-optimizing fitness function}, volume = {185}, year = {2025}, }
• (2025). Adaptive fuzzy entropy optimization with opposition-based archimedes search for robust multilevel image segmentation. ASOC, 185, 113943. (www)

  @article{ , abstract = {Image segmentation plays a critical role in diverse computer vision applications. Multilevel thresholding (MLT) remains one of its most widely used unsupervised techniques due to its simplicity and interpretability. However, existing MLT methods often suffer from two major limitations: (1) the inability to adapt to local intensity variations and (2) the computational burden associated with high-dimensional threshold search. To address these challenges, this study proposes a novel segmentation framework that integrates a Proximity-Adaptive Fuzzy Entropy (PAFE) model with an Opposition-Based Learning-enhanced Archimedes Optimization Algorithm (OBL-EAOA). The PAFE model utilizes dynamically adjusted trapezoidal membership functions based on intensity proximity to candidate thresholds, allowing for a more adaptive and smooth entropy surface. Meanwhile, the OBL-EAOA enhances optimization performance through opposition-based learning and adaptive parameter control, improving exploration diversity and convergence speed. The proposed PAFE-EAOA framework is validated on two benchmark datasets, BSD500 and PASCAL VOC 2012, using five standard metrics: PSNR, SSIM, FSIM, SNR, and computation time. Compared with several state-of-the-art methods including Kapur Entropy (KE)-EAOA, Fuzzy Entropy (FE)-EAOA, Patch-Levy-Based Bees Algorithm (PLBA), Marine Predators Algorithm (MPA), Improved Grey Wolf Optimizer (IGWO), and standard Archimedes Optimization Algorithm (AOA), the proposed approach consistently achieves superior segmentation quality. Notably, it reduces computation time by up to 60 % and achieves statistically significant improvements, as confirmed by the Wilcoxon signed-rank test. These results demonstrate the framework’s robustness, scalability, and effectiveness for real-world MLT-based image segmentation.}, archive = {J_ASOC}, author = {Anusha Ganesan and Sungho Kim and Ganesan Nagabushnam}, doi = {10.1016/j.asoc.2025.113943}, journal = {Applied Soft Computing}, month = {12}, pages = {113943}, shortjournal = {Appl. Soft. Comput.}, title = {Adaptive fuzzy entropy optimization with opposition-based archimedes search for robust multilevel image segmentation}, volume = {185}, year = {2025}, }
• (2025). DT and LLM driven intelligent maintenance system for L-DED and DAG-based LLM fault diagnosis evaluation framework. ASOC, 185, 113942. (www)

  @article{ , abstract = {Metal additive manufacturing (AM) has revolutionized industries such as aerospace and automotive manufacturing due to its ability to rapidly prototype complex structures. Laser Directed Energy Deposition (L-DED) is a key AM technique, offering high deposition rates and superior mechanical properties. However, the inherent complexity and high cost of L-DED equipment demand reliable maintenance management to minimize downtime. Traditional maintenance approaches struggle to keep pace with escalating production demands and to cope with growing equipment complexity. To address this, we propose a dual-driven intelligent maintenance system for L-DED, integrating Digital Twins (DT) and Large Language Models (LLMs). The system features a comprehensive DT framework that synchronizes the virtual entity with the physical one in real time, it also incorporates an intelligent maintenance Q&A assistant powered by Retrieval-Augmented Generation (RAG), leveraging L-DED maintenance knowledge bases to provide accurate operational support. Additionally, we propose a Directed Acyclic Graphs (DAG)-based framework to assess LLMs’ ability to guide users through complete fault diagnosis. Our work aims to enhance the reliability and efficiency of L-DED maintenance through advanced digital technologies, ultimately improving productivity and reducing downtime in additive manufacturing.}, archive = {J_ASOC}, author = {Jian Tang and Shitong Peng and Jianan Guo and Danya Song and Dongna Gao and Weiwei Liu and Fengtao Wang}, doi = {10.1016/j.asoc.2025.113942}, journal = {Applied Soft Computing}, month = {12}, pages = {113942}, shortjournal = {Appl. Soft. Comput.}, title = {DT and LLM driven intelligent maintenance system for L-DED and DAG-based LLM fault diagnosis evaluation framework}, volume = {185}, year = {2025}, }
• (2025). A new large model with multi-scale feature fusion for fault diagnosis based on unified time series model. ASOC, 185, 113941. (www)

  @article{ , abstract = {Large model technology exemplified by large language models has been applied in the field of industrial fault diagnosis. However, existing large models are optimized for specific equipment types and have yet to fully exploit the potential of time-series monitoring data to enable widespread application across diverse mechanical equipment in various industrial scenarios. To address this challenge, a fault diagnosis large model (UniTS-FD) is designed based on unified time series model (UniTS). First, a multi-scale feature fusion backbone network is developed based on UniTS backbone to capture general mechanical fault features. Second, the fault classification head integrates the Pearson correlation coefficient to assess the similarity of class information within linear space for enabling adaptive classification. Third, P-LoRA fine-tuning approach incorporating LoRA and prompt technology is proposed to fine-tune the fault classification head, which enhances the generalization ability of the UniTS-FD model for fault diagnosis tasks of various mechanical equipment. Finally, the UniTS-FD model is pre-trained on 11 fault datasets and fine-tuning experiments were conducted on four different fault datasets to achieve cross-machine fault diagnosis. Experimental results demonstrate the effectiveness of the UniTS-FD in fault diagnosis tasks.}, archive = {J_ASOC}, author = {Zhiwei Zhang and Chengbin Wei and Weimin Zhang and Long Wen}, doi = {10.1016/j.asoc.2025.113941}, journal = {Applied Soft Computing}, month = {12}, pages = {113941}, shortjournal = {Appl. Soft. Comput.}, title = {A new large model with multi-scale feature fusion for fault diagnosis based on unified time series model}, volume = {185}, year = {2025}, }
• (2025). A federated learning-based method for personalized manufacturing service recommendation with collaborative relationships. ASOC, 185, 113940. (www)

  @article{ , abstract = {In the industrial Internet environment, the increasing complexity of manufacturing tasks has rendered them no longer accomplishable by independent manufacturing services. Meanwhile, current recommendation systems predominantly face challenges in maintaining data privacy and security during client parameter exchanges. To address these issues, this paper proposes CoFedSVD+ +, a federated learning-based method for personalized manufacturing service recommendation that integrates an enhanced SVD+ + algorithm with homomorphic encryption. First, we devise an enhanced similarity calculation method to analyze collaborative relationships among manufacturing services. Second, we implement a homomorphic encryption protocol within the federated learning framework to resolve data isolation challenges. Third, the improved SVD+ + algorithm is employed to capture implicit feedback information and predict missing Quality of Service (QoS) metrics. Fourth, a Top-N service composition recommendation list is generated through synergistic analysis of collaborative relationships and QoS predictions. Finally, we validate our approach using real-world case data from an industrial Internet platform. Experimental comparisons with existing recommendation algorithms demonstrate superior recommendation effectiveness of the proposed method.}, archive = {J_ASOC}, author = {Lei Wang and Jun Wang and Feng Xiang and Tongshun Li and Yang Xu and Yibing Li}, doi = {10.1016/j.asoc.2025.113940}, journal = {Applied Soft Computing}, month = {12}, pages = {113940}, shortjournal = {Appl. Soft. Comput.}, title = {A federated learning-based method for personalized manufacturing service recommendation with collaborative relationships}, volume = {185}, year = {2025}, }
• (2025). Span-level emotion-cause-category triplet extraction with instruction tuning LLMs and data augmentation. ASOC, 185, 113938. (www)

  @article{ , abstract = {Span-level emotion-cause-category triplet extraction is a fine-grained task in emotion cause analysis that aims to identify emotion spans, cause spans, and their corresponding emotion categories from documents. Existing methods, including clause-level emotion-cause pair extraction and span-level emotion-cause detection, often suffer from redundant information and difficulties in accurately classifying emotion categories, particularly when emotions are expressed implicitly or ambiguously. To overcome these challenges, this study explores a fine-grained approach to span-level emotion-cause-category triplet extraction and introduces an innovative framework that leverages instruction tuning and data augmentation techniques based on large language models. The proposed method employs task-specific triplet extraction instructions and utilizes low-rank adaptation to fine-tune large language models, eliminating the necessity for intricate task-specific architectures. Furthermore, an LLM-based data augmentation strategy is developed to address data scarcity by guiding large language models in generating high-quality synthetic training data. Extensive experimental evaluations demonstrate that the proposed approach significantly outperforms existing baseline methods, achieving at least a 12.8 % improvement in span-level emotion-cause-category triplet extraction metrics. The results demonstrate the method’s effectiveness and robustness, offering a promising avenue for advancing research in emotion cause analysis.}, archive = {J_ASOC}, author = {Xiangju Li and Dong Yang and Xiaogang Zhu and Faliang Huang and Peng Zhang and Zhongying Zhao}, doi = {10.1016/j.asoc.2025.113938}, journal = {Applied Soft Computing}, month = {12}, pages = {113938}, shortjournal = {Appl. Soft. Comput.}, title = {Span-level emotion-cause-category triplet extraction with instruction tuning LLMs and data augmentation}, volume = {185}, year = {2025}, }
• (2025). Deep cross-visual semantic hashing with self-calibrated collaborative attention. ASOC, 185, 113937. (www)

  @article{ , abstract = {Deep hashing has garnered considerable attention due to its remarkable retrieval efficiency and low storage cost, particularly in visual retrieval scenarios. However, current deep hashing methods generally integrate hash coding into a single-stream architecture, which limits the discriminative power of learned visual features and yields suboptimal hash codes. Additionally, over-reliance on semantic labels shared across samples fails to fully exploit the intrinsic semantic correlations between labels and corresponding visual features. To address these issues, we propose a deep cross-visual semantic hashing (DCvSH) method for image retrieval. First, we develop a visual image feature decoupling encoding network that leverages a self-calibrated collaborative attention mechanism to disentangle common and specific semantics across related images. These decoupled features are fed into a shared decoder for image reconstruction, yielding discriminative visual feature representations. Second, we construct a cross-visual semantic representation learning network with a two-level multi-layer perceptron to capture the underlying relationships between semantic label encodings and visual feature embeddings, while a hypergraph structure is introduced to preserve pairwise similarity relationships. Experimental results on the CIFAR-10, NUS-WIDE, and MIRFLICKR datasets demonstrate consistent improvements, with average mean average precision (mAP) scores reaching 0.895, 0.874, and 0.881 at different code lengths, respectively. Notably, DCvSH outperforms other baselines across all evaluation metrics.}, archive = {J_ASOC}, author = {Hao Feng and Xiangbo Zhou and Yue Wu and Jian Zhou and Banglei Zhao}, doi = {10.1016/j.asoc.2025.113937}, journal = {Applied Soft Computing}, month = {12}, pages = {113937}, shortjournal = {Appl. Soft. Comput.}, title = {Deep cross-visual semantic hashing with self-calibrated collaborative attention}, volume = {185}, year = {2025}, }
• (2025). Large model for fault diagnosis of industrial equipment based on a knowledge graph construction. ASOC, 185, 113936. (www)

  @article{ , abstract = {To address the significant heterogeneity of multi-modal data and the challenges in capturing fault semantics for industrial equipment, a fault diagnosis framework that integrates a time-frequency knowledge graph with the large model DeepSeek-V3 is proposed. Specifically, an unsupervised knowledge graph construction method is designed based on multi-modal vibration data signals. This method mines temporal evolution relationships using dynamic time warping and quantifies the relevance between features and faults via mutual information, thereby forming a dynamic graph representation. Additionally, DeepSeek-V3 encodes the natural language descriptions of vibration features, integrating graph structure and time-frequency map features to achieve collaborative reasoning and diagnosis among text, graphs, and maps. Experimental results show that the proposed method achieves high accuracy and significantly outperforms benchmark models, surpassing traditional methods. The proposed framework, through the deep integration of data-driven knowledge graphs and large model semantic understanding, demonstrates high precision, strong robustness, and transparent decision-making capabilities, providing new insights for intelligent diagnosis of industrial equipment.}, archive = {J_ASOC}, author = {Jichao Zhuang and Jiaming Yang and Weigang Li and Jian Chen and Yunjun Zheng and Zhuyun Chen}, doi = {10.1016/j.asoc.2025.113936}, journal = {Applied Soft Computing}, month = {12}, pages = {113936}, shortjournal = {Appl. Soft. Comput.}, title = {Large model for fault diagnosis of industrial equipment based on a knowledge graph construction}, volume = {185}, year = {2025}, }
• (2025). Interval-valued pythagorean fuzzy distance-based extended inferior ratio method for multiattribute decision-making: Application to green supplier selection in manufacturing industry. ASOC, 185, 113935. (www)

  @article{ , abstract = {Interval-valued Pythagorean fuzzy sets (IVPFSs) have emerged as a powerful tool for handling uncertainty and vagueness in multiattribute decision-making (MADM). In this paper, we first propose a novel distance measure for IVPFSs based on triangular divergence, which satisfies all core distance axioms and significantly improves discrimination ability compared to existing measures. Building on this, we introduce a maximizing deviation strategy with a new loss function to objectively determine attribute weights. Furthermore, we develop an extended inferior ratio (EIR) method that incorporates a dynamic weight parameter to flexibly balance the influence of positive and negative ideal solutions. The performance of the proposed method is demonstrated through a case study on green supplier selection in the manufacturing industry. The results indicate that, among the seven criteria evaluated, the most suitable suppliers are ranked as follows: β (1.0000), α (0.6471), δ (0.3500), ϵ (0.0690), and θ (0.0000). In addition, sensitivity and comparative analyses confirm the robustness and consistency of the proposed method, reflecting its effectiveness and practical value for sustainable decision-making in real-world scenarios.}, archive = {J_ASOC}, author = {Zhe Liu and Donglai Wang and Muhammet Deveci and Sukumar Letchmunan}, doi = {10.1016/j.asoc.2025.113935}, journal = {Applied Soft Computing}, month = {12}, pages = {113935}, shortjournal = {Appl. Soft. Comput.}, title = {Interval-valued pythagorean fuzzy distance-based extended inferior ratio method for multiattribute decision-making: Application to green supplier selection in manufacturing industry}, volume = {185}, year = {2025}, }
• (2025). Multidimensional trade performance assessment for integrating sustainability and economic diversification in OECD countries using a spherical fuzzy SIWEC-SPC-based decision support model. ASOC, 185, 113934. (www)

  @article{ , abstract = {Countries participate in regional trade blocks to enhance their trade activities and trade performance. This study proposes a novel approach to trade performance assessment, introducing innovations both in terms of performance parameters and methodology. From a performance parameter perspective, the inclusion of sustainable development and economic diversity levels in trade performance evaluation differentiates this study from traditional trade performance measurement approaches. From a methodological perspective, a hybrid model that simultaneously considers both subjective and objective criterion weighting based on expert opinions is introduced. The spherical fuzzy (SF)−simple weight calculation (SIWEC)−symmetry point of criterion (SPC)−opportunity losses-based polar coordinate distance (OPLO-POCOD) model, developed as a decision support system, is proposed for evaluating the trade performance of country blocs. SF-SIWEC is employed as the subjective criterion weighting method, while SPC serves as the objective criterion weighting method. The OPLO-POCOD alternative ranking method is employed to calculate the trade performance of countries. The proposed methodology is applied to the Organization for Economic Cooperation and Development (OECD) countries. According to the subjective weighting method, "sustainable development (0.0978)" emerges as the most important criterion, whereas in the objective weighting method, "number of product types (export) (0.1612)" is identified as the most significant one. In the final criterion weights, "number of product types (export) (0.1232)" is also determined to be the most important criterion. Considering the final criterion weights, the United States (0.9871) has the highest trade performance among the OECD countries. Thus, when both sustainability and economic diversification are considered, it is understood that the most influential criteria in determining multidimensional trade performance are the number of exported product types and sustainable development. From this perspective, the United States stands out as the country with the highest multidimensional trade performance among OECD countries. This study contributes to the literature by integrating sustainability and economic diversification parameters into trade performance measurement as well as proposing a comprehensive methodology for performance evaluation in trade blocs.}, archive = {J_ASOC}, author = {Galip Cihan Yalçın and Karahan Kara and Emre Kadir Özekenci and Vladimir Simic and Dragan Pamucar}, doi = {10.1016/j.asoc.2025.113934}, journal = {Applied Soft Computing}, month = {12}, pages = {113934}, shortjournal = {Appl. Soft. Comput.}, title = {Multidimensional trade performance assessment for integrating sustainability and economic diversification in OECD countries using a spherical fuzzy SIWEC-SPC-based decision support model}, volume = {185}, year = {2025}, }
• (2025). Optimizing supply routes in a network interdiction model with dual defense operations. ASOC, 185, 113933. (www)

  @article{ , abstract = {This study introduces a novel bi-level defender–attacker model (BDAM) designed to address real-world homeland defense scenarios. Building on the shortest path network interdiction problem (SPNIP), BDAM incorporates dual defense operations—node interdiction and edge destruction—while explicitly modeling the defender’s supply support. Unlike conventional SPNIP formulations, BDAM jointly considers the attacker’s path disruption and the defender’s logistical requirements, ensuring that all interdicted nodes are supported by available supply nodes without exceeding their capacity. To solve this NP-hard problem, a hybrid metaheuristic algorithm named Improved Simplified Swarm Optimization with Dijkstra (iSSOD) is proposed. The method integrates a population-based SSO framework with a randomized repair mechanism to ensure feasibility and an entropy-guided local search to enhance exploitation. The attacker’s optimal response is computed efficiently using Dijkstra’s algorithm, embedded within the defender’s fitness evaluation. The experimental results on 36 artificial instances demonstrate that iSSOD consistently outperforms several benchmark evolutionary algorithms, providing high-quality solutions through a defense-aware, supply-constrained optimization framework. Furthermore, a real-world case study based on geographic data validates the model’s applicability under realistic defense conditions.}, archive = {J_ASOC}, author = {Wei-Chang Yeh and Chyh-Ming Lai and Tsung-Hua Wu}, doi = {10.1016/j.asoc.2025.113933}, journal = {Applied Soft Computing}, month = {12}, pages = {113933}, shortjournal = {Appl. Soft. Comput.}, title = {Optimizing supply routes in a network interdiction model with dual defense operations}, volume = {185}, year = {2025}, }
• (2025). A continuous encoding-based representation for efficient multi-fidelity multi-objective neural architecture search. ASOC, 185, 113932. (www)

  @article{ , abstract = {Neural architecture search (NAS) is a powerful tool for automatically designing optimized deep learning models but is often limited by high computational costs, especially in multi-objective settings. To address this, an adaptive Co-Kriging-assisted multi-fidelity multi-objective NAS algorithm is proposed to reduce the computational cost and accelerate convergence of NAS by incorporating a clustering-based local multi-fidelity infill sampling strategy. Additionally, we introduce a novel continuous encoding method to compactly represent node connections within a generalized U-Net backbone, significantly reducing search dimensionality. Extensive experiments demonstrate that our method consistently outperforms state-of-the-art NAS approaches under limited computational budgets on three benchmarks, a 2D Darcy flow regression task, a CHASE_DB1 biomedical image segmentation task, and an urban wind velocity prediction task. Analysis further shows that our algorithm autonomously identifies design patterns consistent with expert-curated U-Net variants in literature, confirming its efficiency and potential for insight into performant architectures.}, archive = {J_ASOC}, author = {Zhao Wei and Chin Chun Ooi and Yew-Soon Ong}, doi = {10.1016/j.asoc.2025.113932}, journal = {Applied Soft Computing}, month = {12}, pages = {113932}, shortjournal = {Appl. Soft. Comput.}, title = {A continuous encoding-based representation for efficient multi-fidelity multi-objective neural architecture search}, volume = {185}, year = {2025}, }
• (2025). Fall detection system using tabular GAN for data augmentation with integration of isolation forest model. ASOC, 185, 113931. (www)

  @article{ , abstract = {Effective Fall Detection Systems (FDS) are essential to minimize the risk of severe injuries among the elderly. However, the limited availability and imbalanced nature of fall detection data pose significant challenges to developing accurate models. This paper proposes a novel approach to enhance fall detection accuracy by using synthetic data generated through Tabular Generative Adversarial Network (GAN), combined with Isolation Forest and Autoencoder models. The dataset was augmented by factors of 5 and 10, and the models were evaluated using the area under the curve-receiver operating characteristic (AUC-ROC) and area under the curve–precision recall (AUC-PR) metrics. Notably, the Isolation Forest model improved from an AUC-ROC of 0.49 and AUC-PR of 0.43 (without augmentation) to 0.59 and 0.63, respectively, with 5x augmentation. Similarly, the Autoencoder showed an increase from 0.4 (AUC-ROC) and 0.2 (AUC-PR) to 0.5 and 0.54 with the same augmentation. These results demonstrate the effectiveness of synthetic data in improving anomaly detection performance. The findings suggest that advanced data augmentation techniques significantly improve FDS, thereby enhancing safety and quality of life for the vulnerable population.}, archive = {J_ASOC}, author = {Ali Nawaz and Najah Abu Ali and Amir Ahmad}, doi = {10.1016/j.asoc.2025.113931}, journal = {Applied Soft Computing}, month = {12}, pages = {113931}, shortjournal = {Appl. Soft. Comput.}, title = {Fall detection system using tabular GAN for data augmentation with integration of isolation forest model}, volume = {185}, year = {2025}, }
• (2025). Meta-learning-based adaptive operator selection for traveling salesman problem. ASOC, 185, 113930. (www)

  @article{ , abstract = {In evolutionary optimization, effectively leveraging knowledge about search operator performance is crucial for enhancing algorithmic results. Traditional operator selection strategies often rely on fixed heuristics or trial-and-error, which struggle to adapt to the nonstationary search dynamics of evolutionary runs—i.e., the stage-dependent, instance-dependent, and population-dependent shifts in operator effectiveness—and typically yield suboptimal performance. To address these challenges, we propose a novel meta-learning-based adaptive operator selection (AOS) framework. It leverages a Long Short-Term Memory (LSTM) neural network to learn temporal patterns of operator performance from historical data and dynamically adjust operator choice on-the-fly. The framework also integrates domain-specific biases to preserve population diversity and promote effective exploration, and it continuously updates its selection policy through dynamic online learning as the evolutionary process unfolds. Experiments on the Traveling Salesman Problem (TSP) benchmark demonstrate that the proposed LSTM-based AOS method significantly outperforms conventional approaches to operator selection. In particular, it achieved a median optimality gap of 9.87 % on a suite of TSP instances—approximately a 20 % improvement over the best fixed-operator configuration—indicating superior solution quality. Moreover, our approach consistently surpassed other state-of-the-art AOS techniques, underscoring the efficacy of the LSTM-driven framework and its significant potential to enhance evolutionary algorithm performance on complex optimization tasks.}, archive = {J_ASOC}, author = {Ho Young Jeong and Byung Duk Song}, doi = {10.1016/j.asoc.2025.113930}, journal = {Applied Soft Computing}, month = {12}, pages = {113930}, shortjournal = {Appl. Soft. Comput.}, title = {Meta-learning-based adaptive operator selection for traveling salesman problem}, volume = {185}, year = {2025}, }
• (2025). MACityChat: Integrating remote sensing professional large model with general-purpose large model for multi-domain urban land use analysis. ASOC, 185, 113929. (www)

  @article{ , abstract = {Urbanization remains a global trend, with urban land use being a key component of the process. The effective integration and management of land use are critical for the sustainable development of cities. Traditional urban land use analysis methods can fit dynamic models of land use changes nonlinearly, but they face two challenges: First, the analysis process of existing technologies is often a black-box, with unknown principles, reducing the reliability and authenticity of results. Second, traditional machine learning can only analyze urban land use changes from a single domain, such as remote sensing, overlooking the influence of economic and sociological factors. We propose an interpretable urban land use change analysis task and design MACityChat, a framework that combines remote sensing-specific large models with general-purpose large language models for multidisciplinary generalized analysis, while also visualizing the model’s analytical results. In this framework remote sensing images are input into a remote sensing large model, which transforms the semantic objects in the images into textual descriptions. These descriptions are then fed into a general-purpose large language model. A regional tag-guiding module directs the general-purpose language model to incorporate local economic, policy, and cultural knowledge to perform generalized analysis. Finally, the analysis results are visualized on the remote sensing images, providing a detailed examination of urban land use. Extensive experiments show that MACityChat can provide detailed and effective analyses of urban land use changes and visualize these analyses, offering an interpretable and superior solution to urban land use problems.}, archive = {J_ASOC}, author = {Tianyi Zhou and Zijie Huang and Hui Lin and Zhaobin Zhou and Jia Hu}, doi = {10.1016/j.asoc.2025.113929}, journal = {Applied Soft Computing}, month = {12}, pages = {113929}, shortjournal = {Appl. Soft. Comput.}, title = {MACityChat: Integrating remote sensing professional large model with general-purpose large model for multi-domain urban land use analysis}, volume = {185}, year = {2025}, }
• (2025). Causal inference and attribute correlation consistency for eliminating popularity bias in recommendation system. ASOC, 185, 113928. (www)

  @article{ , abstract = {Popularity bias has long been a persistent issue in recommendation systems, leading to misleading results and significant problems such as the Matthew Effect and the Information Cocoon Room. Existing studies have primarily focused on the elevation of long-tailed items, overlooking the crucial connection between users and items. Drawing inspiration from causal graphs, this paper introduces a novel framework called CIACC (Causal Inference and Attribute Correlation Consistency) to tackle the challenges posed by popularity bias. The framework leverages causal graphs to evaluate the compatibility between users and items and to gauge the influence of item popularity on rankings. It employs counterfactual inference to estimate the impact of item popularity on rankings and adheres to the consistent principle of attribute correlation to enhance the feature representation of long-tailed items. Through rigorous experiments conducted on three public datasets, we demonstrate that our CIACC framework outperforms state-of-the-art methods.}, archive = {J_ASOC}, author = {Bo Huang and Zhenhao Wang and Feifan Yan and Jin Liu and Hamido Fujita and Xiao Liu and Hanan Aljuaid}, doi = {10.1016/j.asoc.2025.113928}, journal = {Applied Soft Computing}, month = {12}, pages = {113928}, shortjournal = {Appl. Soft. Comput.}, title = {Causal inference and attribute correlation consistency for eliminating popularity bias in recommendation system}, volume = {185}, year = {2025}, }
• (2025). Strategy allocation for financial trading using competitive reinforcement learning and fuzzy logic. ASOC, 185, 113927. (www)

  @article{ , abstract = {Reinforcement learning has been widely adopted for quantitative trading and portfolio management. Research on reinforcement learning methodologies has simulated how a trading agent interacts with the financial market to realize goals, such as maximizing total profit or minimizing risk to optimize a portfolio within a specific period. Moreover, effective technical indicators have been developed for identifying price trends, but they often rely on a singular trading method, potentially limiting their effectiveness in dynamic, noisy markets. To address this limitation, we propose an intelligent, flexible trading system that employs multiple strategies, reflecting real-world trading practices. Our system, aimed at multistrategy allocation management, includes a global manager at a higher level and several local traders at a lower level. To address inherent noise in financial markets and prevent overfitting of the hyperparameters for each trading strategy, the system incorporates fuzzy logic that enhances its environmental representation. The system is tested in the Taiwan TXF and E-mini Standard and Poor’s 500 Index futures markets using 15-minute frequency data. The results demonstrate the system’s robustness and its effective market timing ability, marking a significant advancement in the field.}, archive = {J_ASOC}, author = {Ju-Chun Huang and Chiao-Ting Chen and Chih-Chung Chang and Szu-Hao Huang}, doi = {10.1016/j.asoc.2025.113927}, journal = {Applied Soft Computing}, month = {12}, pages = {113927}, shortjournal = {Appl. Soft. Comput.}, title = {Strategy allocation for financial trading using competitive reinforcement learning and fuzzy logic}, volume = {185}, year = {2025}, }
• (2025). A fast and robust ensemble evolving pixel cloud-based image segmentation approach. ASOC, 185, 113926. (www)

  @article{ , abstract = {The existing cluster-based image segmentation algorithms have the burden of iterative computation caused by the change of cluster centers and are sensitive to noise. In this paper, we present a fast and robust ensemble evolving pixel cloud-based image segmentation approach. The concept of pixel clouds by clustering pixels of the same pattern around their focal pixels is proposed. The following attributes distinguish the proposed algorithm: (1) The pixel clouds are evolvable according to the global densities of the incoming pixels and the number of pixel clouds is automatically determined. (2) The focal pixels of pixel clouds are dynamically updated with the highest local densities by using the recursive density estimation, which avoids redundant distance calculations when a new pixel arrives. (3) A multiscale morphological gradient reconstruction operation is employed to merge or filter meaningless pixel clouds, especially in noisy images, which helps to adaptively polish neighboring pixel clouds and compact the pixel clouds. (4) An ensemble structure is introduced to fasten the image segmentation speed by splitting the whole image into multiple independent sub-images, in which the pixel clouds are independently formed and evolved. Comprehensive experiments on natural images, remote sensing images and medical images reveal that the proposed approach surpasses the state-of-the-art algorithms in both segmentation accuracy and computational efficiency. Even for the noisy images, the proposed approach demonstrates more robust performance.}, archive = {J_ASOC}, author = {Tao Zhang and Hai-Jun Rong and Zhao-Xu Yang and Chi-Man Vong}, doi = {10.1016/j.asoc.2025.113926}, journal = {Applied Soft Computing}, month = {12}, pages = {113926}, shortjournal = {Appl. Soft. Comput.}, title = {A fast and robust ensemble evolving pixel cloud-based image segmentation approach}, volume = {185}, year = {2025}, }
• (2025). A data-driven approach to tackling academic stress-coping and mental health issues in college students using spherical fuzzy MARCOS methodology. ASOC, 185, 113925. (www)

  @article{ , abstract = {The drastically developing nature of the knowledge economy and the rising need for top-notch expertise have placed tremendous pressure on college students. As higher education becomes more accessible, masses of students are enrolling in colleges, which puts additional pressure on colleges and institutions; as a result, they cannot provide adequate resources to the students. As the class size increases, many students require mental health assistance, academic guidance, and financial aid, which then puts pressure on the teachers and the facilities. This flood of students overloads the facilities, resulting in it becoming more challenging to provide attention and concern, leading many students to feel overlooked and affecting their mental health. Due to not getting timely support, students may find it challenging to handle their academic responsibilities. Moreover, the students face a heavy workload, unclear guidance, and limited resource access. The objective of this study is to develop a structured, data-driven decision-making framework for systematically evaluating and improving student mental health and academic stress-coping strategies in a college setting. To address this, a comprehensive decision-making structure, measurement of alternatives, and ranking according to the compromised solution (MARCOS) within the spherical fuzzy (SF) environment, has been applied, which evaluates the key factors causing mental health issues by comparing the ideal and anti-ideal alternatives. The novelty of the proposed approach lies in leveraging the SF framework’s explicit ability to model hesitation (abstinence) alongside truth and falsity degrees, enabling more accurate representation of subjective psychological assessments compared to traditional fuzzy models. Furthermore, the method calculates utility functions corresponding to each alternative (coping technique), prioritizes the strategies, and selects the most effective intervention. The results reveal that personalized mental health plans emerged as the top-ranked coping strategy, highlighting the importance of tailored support in culturally and contextually diverse academic environments.}, archive = {J_ASOC}, author = {Raiha Imran and Munazza Amin and Kifayat Ullah and Dragan Pamucar and Zeeshan Ali and Oumaima Saidani and Vladimir Simic}, doi = {10.1016/j.asoc.2025.113925}, journal = {Applied Soft Computing}, month = {12}, pages = {113925}, shortjournal = {Appl. Soft. Comput.}, title = {A data-driven approach to tackling academic stress-coping and mental health issues in college students using spherical fuzzy MARCOS methodology}, volume = {185}, year = {2025}, }
• (2025). Secure and efficient vehicle control of autonomous vehicles using federated deep reinforcement learning. ASOC, 185, 113924. (www)

  @article{ , abstract = {Autonomous driving is largely considered a revolutionary technology and the ultimate alternative for smart urban mobility. Artificial Intelligence (AI) has been the main pillar of AV technology. However, despite the significant success achieved through the application of various Deep Reinforcement Learning (DRL) techniques in the field of AVs, numerous challenges remain to be addressed. Particularly, in the case of vehicle control, existing works have shown limited results when extensive action and state spaces are involved, and where the efficacy of agents is often compromised due to the variability of states and actions. In response to these challenges, we introduce a pioneering approach leveraging Federated Deep Reinforcement Learning (FDRL), which fosters the exchange of experiences among participating agents while safeguarding their privacy. FDRL enhances the exploration of all agents’ actions and states in different environments and effectively overcomes the problem of low sample efficiency in action and state spaces for all agents. Our approach is based on three distinct FDRL algorithms: Federated Proximal Policy Optimization (FPPO), Federated Deep Deterministic Policy Gradient (FDDPG), and Federated Deep Q-Network (FDQN), each tailored to control AVs within unique environments. Our results demonstrate the superiority of our approach in terms of average reward, waiting time, and speed, when compared to local models such as PPO, DDPG, and DQN.}, archive = {J_ASOC}, author = {Badr Ben Elallid and Nabil Benamar and Miloud Bagaa and Nabil Mrani}, doi = {10.1016/j.asoc.2025.113924}, journal = {Applied Soft Computing}, month = {12}, pages = {113924}, shortjournal = {Appl. Soft. Comput.}, title = {Secure and efficient vehicle control of autonomous vehicles using federated deep reinforcement learning}, volume = {185}, year = {2025}, }
• (2025). T5-based anomaly-behavior video captioning using semantic relation mining. ASOC, 185, 113923. (www)

  @article{ , abstract = {Video data consist of a series of images that change over time. The sequence of frames in a video provides important information on the motion and continuity of the video. Therefore, this dynamic information can be used to analyze the movement and behavior patterns of objects. Video captioning, which is used to explain a video, can describe the content of the video data and provide subtitles or descriptions in various languages. It can also explain the main points in a video with complex content, facilitating the information provided to users. In captioning, semantic analysis is used to identify the overall context of the data and generate the correct captions. However, captions are usually generated by focusing on major objects and actions, making it difficult to capture the details. In this paper, we propose text-to-text transfer transformer (T5)-based abnormal behavior video capturing using semantic relation mining. The proposed method generates captions with semantic features from video data based on environmental factors and improves the accuracy of video description by identifying the similarity of each caption for similar video and caption classification. This enables the classification and search of video data and is useful in video analysis systems, such as video monitoring and media analysis.}, archive = {J_ASOC}, author = {Min-Jeong Kim and Kyungyong Chung}, doi = {10.1016/j.asoc.2025.113923}, journal = {Applied Soft Computing}, month = {12}, pages = {113923}, shortjournal = {Appl. Soft. Comput.}, title = {T5-based anomaly-behavior video captioning using semantic relation mining}, volume = {185}, year = {2025}, }
• (2025). Simulating phenomenal consciousness using generative agents based on large language models. ASOC, 185, 113922. (www)

  @article{ , abstract = {Large Language Models (LLMs) still face challenges in tasks requiring understanding implicit instructions and applying common-sense knowledge. In such scenarios, LLMs may require multiple attempts to achieve human-level performance, potentially leading to inaccurate responses or inferences in practical environments, affecting their long-term consistency and behavior. This paper introduces the Internal Time-Consciousness Machine (ITCM), a computational consciousness structure to simulate the process of human consciousness. We further propose the ITCM-based Agent (ITCMA), which supports action generation and reasoning in open-world settings, and can independently complete tasks. ITCMA enhances LLMs’ ability to understand implicit instructions and apply common-sense knowledge by considering agents’ interaction and reasoning with the environment. The trained ITCMA performs better than state-of-the-art (SOTA) in the seen set. Even untrained ITCMA can achieve higher task completion rates than SOTA on the seen set, indicating its superiority over traditional intelligent agents in utility and generalization. In real-world tasks with quadruped robots, the task completion rate of untrained ITCMA is close to its performance in the unseen set, demonstrating its comparable utility and universality in real-world settings. CCS Concepts: ∙ Human-centered computing → Interactive systems and tools; ∙ Computing methodologies → Natural language processing.}, archive = {J_ASOC}, author = {Hanzhong Zhang and Jibin Yin and Haoyang Wang and Ziwei Xiang}, doi = {10.1016/j.asoc.2025.113922}, journal = {Applied Soft Computing}, month = {12}, pages = {113922}, shortjournal = {Appl. Soft. Comput.}, title = {Simulating phenomenal consciousness using generative agents based on large language models}, volume = {185}, year = {2025}, }
• (2025). Asymmetrical variable driven simulated binary crossover operator for large scale multi-objective optimization. ASOC, 185, 113921. (www)

  @article{ , abstract = {Due to the excessive number of decision variables, large scale multi-objective optimization has gradually become a hot research topic over the past few years. Although various reproduction operators have been proposed to effectively generate offspring solutions in the huge decision space, they have a common issue in that most of them are focused on the symmetrical variables and neglect asymmetrical variables. Based on the summary above, it is empirically proved that asymmetrical variables with great similarities play an important role in facilitating each other ′ s effective exploration of the huge decision space. Therefore, to effectively tackle large scale multi-objective optimization problems, the asymmetrical variables are incorporated into the design of a new asymmetrical variable driven simulated binary crossover operator. On the basis of the proposed asymmetrical variable driven simulated binary crossover operator, this paper further constructs a large scale multi-objective evolutionary framework based on asymmetrical variable driven simulated binary crossover operator. Extensive experiments and analyses on typical large scale multi-objective optimization problems with up to 10,000 decision variables and practical engineering problems with 6000 decision variables show its superiority over state-of-the-art optimizers.}, archive = {J_ASOC}, author = {Maoqing Zhang and Kun Wang}, doi = {10.1016/j.asoc.2025.113921}, journal = {Applied Soft Computing}, month = {12}, pages = {113921}, shortjournal = {Appl. Soft. Comput.}, title = {Asymmetrical variable driven simulated binary crossover operator for large scale multi-objective optimization}, volume = {185}, year = {2025}, }
• (2025). Towards agentic smart design: An industrial large model-driven human-in-the-loop agentic workflow for geometric modelling. ASOC, 185, 113920. (www)

  @article{ , abstract = {Agentic workflows, powered by Industrial Large Models (ILMs), represent a significant development emphasizing collaboration between humans and intelligent systems. This paper presents a structured perspective on the role of agentic workflows for smart design and manufacturing, grounded in integrating ILMs. We define an agentic workflow as a labeled Activity-on-Vertex (AOV) graph, where each node represents a functionally closed subtask and is executed by an ILM-based agent, a human operator, or an automated system. This formalism supports analyzable, modular, and hybrid execution, offering a foundation for modeling complex, mixed-initiative processes in manufacturing environments. To support real-world deployment, we introduce a set of reusable agentic workflow patterns that describe how ILM agents perceive, plan, and act in coordination with other components. Besides, a proof-of-concept case study illustrates the practical application of the human-in-the-loop framework through the agentic generation of CAD models. The study covers task decomposition, workflow implementation, and benchmarking, providing evidence for the feasibility of agentic workflows. Building upon these findings, this work contributes to advancing the development and application of agentic workflows in smart manufacturing contexts.}, archive = {J_ASOC}, author = {Keyou Zheng and Yuanwei Zhong and Xuyang Su and Jiewu Leng and Qiang Liu and Xin Chen}, doi = {10.1016/j.asoc.2025.113920}, journal = {Applied Soft Computing}, month = {12}, pages = {113920}, shortjournal = {Appl. Soft. Comput.}, title = {Towards agentic smart design: An industrial large model-driven human-in-the-loop agentic workflow for geometric modelling}, volume = {185}, year = {2025}, }
• (2025). Adaptive fault diagnosis of railway vehicle on-board controller with large language models. ASOC, 185, 113919. (www)

  @article{ , abstract = {Accurately identifying fault types of the Vehicle On-Board Controller (VOBC) in railway systems is of great significance for ensuring the safe operation of trains. Recently, Large Language Models (LLMs) have demonstrated excellent semantic understanding and natural language interaction capabilities, offering a novel solution for VOBC fault diagnosis. However, LLMs pretrained on general domains lack specific knowledge related to railway VOBC fault diagnosis scenarios, resulting in insufficient adaptability to railway-specific text corpora. This paper conducts an in-depth study on the adaptability of LLMs to VOBC fault diagnosis and proposes Railway Fault Diagnosis Large Language Model (RFD-LLM). First, we adopt railway domain adaptation based on Low-Rank Adaptation (LoRA) to match VOBC fault patterns. Second, instruction tuning is applied to achieve domain knowledge alignment and enhance the model’s ability to follow instructions. The proposed RFD-LLM is the first large language model-based fault diagnosis model for railway VOBC, capable of efficiently and accurately identifying seven types of VOBC fault patterns. RFD-LLM provides a new solution for the development of large models in the railway domain.}, archive = {J_ASOC}, author = {Cong Peng and Jiali Peng and Zisheng Wang and Zongyao Wang and Junjie Chen and Jianping Xuan and Tielin Shi}, doi = {10.1016/j.asoc.2025.113919}, journal = {Applied Soft Computing}, month = {12}, pages = {113919}, shortjournal = {Appl. Soft. Comput.}, title = {Adaptive fault diagnosis of railway vehicle on-board controller with large language models}, volume = {185}, year = {2025}, }
• (2025). An MADM model using frank operations based power aggregation operator under p,q-quasirung orthopair fuzzy sets for highway selection in war-plane landing. ASOC, 185, 113918. (www)

  @article{ , abstract = {In military logistics and operational planning, selecting an optimal highway for war-plane landings and take-offs is a critical and strategic decision. This process involves several key factors that directly affect mission success, operational safety, and public security. Among the most important attributes are the highway’s straight and long stretch with sufficient width to accommodate war-plane landing distances, and its surface condition, which must be free from obstacles, debris, and damage. Low traffic density is crucial to avoid the risk of collisions during landing. Additionally, favourable weather conditions, proximity to military camps, availability of emergency services and fuel, and a secure and hazard-free surrounding terrain are essential for safe and efficient operations. These factors collectively form the backbone of a reliable and tactical approach to highway selection for military air operations. Thus, in order to assess and rank various options for the landing and take-off of war planes, a strong and trustworthy procedure for making decisions is required. The purpose of this experiment is to build a comprehensive structure in multi-attribute decision making environment, using suggested p , q -quasirung orthopair fuzzy Frank power averaging as well as p , q -quasirung orthopair fuzzy Frank power geometric operators to capture ambiguity and uncertainty in highway selection. Furthermore, p , q -quasirung orthopair fuzzy Frank power weighted aggregation along with p , q -quasirung orthopair fuzzy Frank power weighted geometric operators are implemented for integrating the distance as well as similarity measures. Finally, sensitivity analysis and a comparison with the present technique are included to further demonstrate the superiority and validity of the technique that is suggested.}, archive = {J_ASOC}, author = {Sanjita Giri and Sankar Kumar Roy and Muhammet Deveci}, doi = {10.1016/j.asoc.2025.113918}, journal = {Applied Soft Computing}, month = {12}, pages = {113918}, shortjournal = {Appl. Soft. Comput.}, title = {An MADM model using frank operations based power aggregation operator under p,q-quasirung orthopair fuzzy sets for highway selection in war-plane landing}, volume = {185}, year = {2025}, }
• (2025). Real-time traffic flow optimization using large language models and reinforcement learning for smart urban mobility. ASOC, 185, 113917. (www)

  @article{ , abstract = {The exponential growth of metropolitan populations causes transportation network congestion, which increases fuel usage, travel time, and environmental damage. Traditional traffic management systems (TMS) seldom handle these issues in real time. Recently developed Large Language Models (LLMs), especially those using Reinforcement Learning (RL), may enhance urban transportation systems. Traffic management technology's real-time flexibility and shifting congestion patterns provide improved potential. Traditional approaches cannot estimate traffic flow or adapt to urban settings. A strong AI-driven method is needed to improve urban mobility and traffic flow. This paper introduces the LLM-RL Traffic Optimization Framework (LLM-RL-TOF). LLMs analyze real-time traffic data and give predictive insights in this context. Due to these new insights, the RL algorithm can improve traffic flow in real time and reduce congestion via dynamic traffic management. IoT sensors and urban traffic cameras capture real-time traffic data, including traffic volume and incidents. This data helps the LLM estimate bottlenecks, accidents, and traffic congestion. An RL agent uses LLM outputs to adjust traffic signal timing and suggest alternate routes. With real-time alternatives, traffic flow and urban mobility may be optimized. The junction throughput rate rose 17.5 %, the queue length accumulation index fell 22.3 %, and the average vehicle delay fell 18.6 %. The decrease in average vehicle delay enabled all these gains.}, archive = {J_ASOC}, author = {Arvind R. Singh and Muhammad Wasim Abbas Ashraf and Rajkumar Singh Rathore and Bin Li and M.S. Sujatha}, doi = {10.1016/j.asoc.2025.113917}, journal = {Applied Soft Computing}, month = {12}, pages = {113917}, shortjournal = {Appl. Soft. Comput.}, title = {Real-time traffic flow optimization using large language models and reinforcement learning for smart urban mobility}, volume = {185}, year = {2025}, }
• (2025). Progressive auto-encoding for domain adaptation in evolutionary multi-task optimization. ASOC, 185, 113916. (www)

  @article{ , abstract = {In recent years, evolutionary multi-task optimization (EMTO) has emerged as an effective paradigm for solving multiple optimization tasks simultaneously by leveraging knowledge transfer across tasks. The domain adaptation technique plays an important role in EMTO, as it helps align search spaces to support knowledge transfer among tasks. However, most existing domain adaptation methods rely on static pre-training or periodic re-matched mechanism, which do not adapt well to the dynamic change in evolving populations. In this paper, we propose a progressive auto-encoding (PAE) technique that enables continuous domain adaptation throughout the EMTO process. The PAE incorporates two complementary adaptation strategies: i) segmented PAE, which employs staged training of auto-encoders to achieve effective domain alignment across different optimization phases, and ii) smooth PAE, which utilizes eliminated solutions from the evolutionary process to facilitate more gradual and refined domain adaptation. We integrate the PAE into both single-objective and multi-objective multi-task evolutionary algorithms, yielding MTEA-PAE and MO-MTEA-PAE , respectively. Comprehensive experiments conducted on six benchmark suites and five real-world applications validate the effectiveness of our proposed PAE technique in enhancing domain adaptation capabilities within EMTO.}, archive = {J_ASOC}, author = {Qiong Gu and Yanchi Li and Wenyin Gong and Zhiyuan Yuan and Bin Ning and Chunyang Hu and Jicheng Wu}, doi = {10.1016/j.asoc.2025.113916}, journal = {Applied Soft Computing}, month = {12}, pages = {113916}, shortjournal = {Appl. Soft. Comput.}, title = {Progressive auto-encoding for domain adaptation in evolutionary multi-task optimization}, volume = {185}, year = {2025}, }
• (2025). Improving speech emotion recognition using gated cross-modal attention and multimodal homogeneous feature discrepancy learning. ASOC, 185, 113915. (www)

  @article{ , abstract = {Speech emotion recognition (SER) remains a significant and crucial challenge due to the complex and multifaceted nature of human emotions. To tackle this challenge, researchers strive to integrate information from diverse modalities through multimodal learning. However, existing multimodal fusion techniques often overlook the intricacies of interactions between different modalities, resulting in suboptimal feature representations. In this paper, we propose WavFusion, a multimodal framework designed for SER that tackles key research challenges, such as effective multimodal fusion, modality heterogeneity, and discriminative representation learning. By utilizing a gated cross-modal attention mechanism and multimodal homogeneous feature discrepancy learning, WavFusion outperforms existing state-of-the-art methods on benchmark datasets. Our research highlights the importance of capturing subtle cross-modal interactions and learning discriminative representations for accurate multimodal SER. Experimental results indicate that the proposed method is highly competitive and better than most of the latest state-of-the-art methods for SER. WavFusion achieves 0.78 % and 1.27 % improvement in accuracy and 0.74 % and 0.44 % improvement in weighted F1 score over the previous methods on the IEMOCAP and MELD datasets, respectively.}, archive = {J_ASOC}, author = {Feng Li and Jiusong Luo and Wanjun Xia}, doi = {10.1016/j.asoc.2025.113915}, journal = {Applied Soft Computing}, month = {12}, pages = {113915}, shortjournal = {Appl. Soft. Comput.}, title = {Improving speech emotion recognition using gated cross-modal attention and multimodal homogeneous feature discrepancy learning}, volume = {185}, year = {2025}, }
• (2025). Wind turbine blades defect detection based on global and local attention with multi-feature fusion. ASOC, 185, 113914. (www)

  @article{ , abstract = {Wind turbine blades are prone to small-scale defects—such as cracks, corrosion, and contamination—during long-term operation. Accurate detection of these defects is essential for ensuring the safety and efficiency of wind power systems. However, small-object detection remains challenging due to limited feature representation and weak discriminative cues. To address this, an enhanced YOLOX-s-based framework called Global-Frequency Dual-aware YOLOX (GFD-YOLOX) is proposed. GFD-YOLOX introduces three main improvements. First, the Path Aggregation Feature Pyramid Network (PAFPN) in the neck is replaced with Dual-Frequency Fused Bidirectional Feature Pyramid Network (DFF-BiFPN) to strengthen multi-scale contextual representation. Second, the backbone bottleneck is redesigned with a lightweight structure, improving computational efficiency and convergence speed. Third, a Hierarchical Frequency-Adaptive Fusion (HFAF) module is integrated to enhance cross-scale feature interaction by combining fine-grained and global information. On the self-constructed WTBlade-Defect dataset (3570 annotated images, five defect types: corrosion, hide-craze, surface-eye, thunderstrike, dirt), GFD-YOLOX achieves mAP@0.5 and mAP@0.5:0.95 scores of 94.5 % and 68.9 %, respectively, with 44.3 FPS inference—improving by 13.6 % and 14.4 % over state-of-the-art models. On the public dataset of Ashley Foster et al., it achieves 94.8 % and 69.3 %, with gains of 10.4 % and 10.9 %. These results demonstrate that GFD-YOLOX delivers substantial accuracy gains while maintaining real-time speed and strong cross-dataset generalization, indicating high potential for deployment in operational wind turbine inspection systems.}, archive = {J_ASOC}, author = {Dandan Liu and Mingjie Liu}, doi = {10.1016/j.asoc.2025.113914}, journal = {Applied Soft Computing}, month = {12}, pages = {113914}, shortjournal = {Appl. Soft. Comput.}, title = {Wind turbine blades defect detection based on global and local attention with multi-feature fusion}, volume = {185}, year = {2025}, }
• (2025). Heterogeneous feature selection with group structure mining in fuzzy decision systems for medical diagnosis. ASOC, 185, 113913. (www)

  @article{ , abstract = {In practical applications such as medical diagnosis and group decision making, the potential structural information contained in multi-dimensional features in the form of group domains plays an important role. However, most existing feature selection methods adopt transformed feature spaces for group structure analysis, which lack intrinsic semantic information interpretation. Meanwhile, fuzzy and uncertain heterogeneous data acquired from multiple devices increase the difficulty of task learning. Motivated by these two issues, this work devises a Heterogeneous Feature Selection method with Group Structure Mining in fuzzy decision systems (HFS-GSM), which follows the principle of one “strategy" and one “mechanism". Specifically, a feature group generation strategy based on fuzzy approximation Markov blanket is first designed for mining features with group structure, which introduces the concept of Markov blanket into the fuzzy rough set and utilizes the idea of approximation and fuzzy uncertainty measures. Then, a fuzzy dependency-based overlapping group elimination mechanism is proposed by attribution division, which avoids local redundancy while preserving global discriminative information. Furthermore, the effectiveness of HFS-GSM is verified in comparison with seven representative feature selection methods on publicly available medical datasets. Finally, medical diagnosis data provided by a hospital are obtained to demonstrate the reliability and utility of HFS-GSM in practical applications.}, archive = {J_ASOC}, author = {Jihong Wan and Hongmei Chen and Li Xiao and Chuangpeng Shen and Wei Huang and Xiaoping Li}, doi = {10.1016/j.asoc.2025.113913}, journal = {Applied Soft Computing}, month = {12}, pages = {113913}, shortjournal = {Appl. Soft. Comput.}, title = {Heterogeneous feature selection with group structure mining in fuzzy decision systems for medical diagnosis}, volume = {185}, year = {2025}, }
• (2025). Ahybrid ICEEMDAN-BO-GRU model for real-time grouting parameter prediction. ASOC, 185, 113912. (www)

  @article{ , abstract = {Unit injection volume is one of the core control indicators for evaluating the construction quality of curtain grouting. In actual construction processes, accurate prediction of unit injection volume enables early warning of abnormal conditions during construction. However, geological conditions and construction parameters significantly influence unit injection volume, among other factors, and the data exhibits high nonlinearity. Previous studies have achieved suboptimal prediction accuracy. To address the issue of low prediction accuracy in traditional algorithms when handling highly nonlinear data, this study first applies the Improved Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (ICEEMDAN) algorithm to decompose the raw data, and the nonlinear features in the curtain grouting data are effectively eliminated. Subsequently, the Gated Recurrent Unit (GRU) and Bayesian Optimization (BO) algorithms are organically integrated, and Bayesian optimization is applied to the hyperparameters of the GRU model to enhance its predictive performance, thereby constructing an intelligent predictive model for the curtain grouting unit injection volume. Finally, an engineering application study was conducted using an actual curtain grouting project at a pumped-storage power station. The results indicate that the model exhibits good computational accuracy and efficiency, providing theoretical and methodological support for constructing intelligent prediction models in curtain grouting.}, archive = {J_ASOC}, author = {Fei Tong and Dongqing Bai and Xufei Ma and Lin Cheng and Jie Yang and Xiangyu Cao}, doi = {10.1016/j.asoc.2025.113912}, journal = {Applied Soft Computing}, month = {12}, pages = {113912}, shortjournal = {Appl. Soft. Comput.}, title = {Ahybrid ICEEMDAN-BO-GRU model for real-time grouting parameter prediction}, volume = {185}, year = {2025}, }
• (2025). DefGCL: Defence-enhanced graph contrastive learning against attribute inference attacks. ASOC, 185, 113911. (www)

  @article{ , abstract = {Graph-structured data are prevalent in many real-world applications, such as social networks, drug discovery, and fraud detection. While Graph Neural Networks (GNNs) have shown remarkable performance by capturing rich relational patterns, their success often relies on large labeled datasets and raises growing privacy concerns. Graph Contrastive Learning (GCL) has emerged as a powerful unsupervised alternative by leveraging data augmentations to learn robust representations without labeled data. However, recent studies reveal that GCL models are particularly vulnerable to attribute inference attacks, and existing works prioritize performance improvement over privacy protection. To address this issue, we propose a D e f ense-enhanced G raph C ontrastive L earning, dubbed DefGCL , that integrates four coordinated defense strategies to enhance privacy without degrading utility. Specifically, DefGCL employs edge-based graph augmentations to limit exposure to structural attributes, selects negative samples with low attribute sensitivity scores to reduce leakage, modifies the contrastive loss to decouple graph embeddings from attributes, and injects differential privacy noise during the embedding stage. Extensive experiments on five benchmark datasets demonstrate that DefGCL achieves state-of-the-art (SOTA) performance in both privacy preservation and task accuracy. For instance, on the AIDS dataset, DefGCL reduces attribute inference accuracy by 35 % while incurring only a 0.60 % drop in main task performance. Additionally, DefGCL improves computational efficiency by reducing runtime by nearly 50 % compared to baseline methods. 1}, archive = {J_ASOC}, author = {Jinyin Chen and Fanyu Ao and Wenbo Mu and Haiyang Xiong}, doi = {10.1016/j.asoc.2025.113911}, journal = {Applied Soft Computing}, month = {12}, pages = {113911}, shortjournal = {Appl. Soft. Comput.}, title = {DefGCL: Defence-enhanced graph contrastive learning against attribute inference attacks}, volume = {185}, year = {2025}, }
• (2025). Interval multi-feature sparse transformer-CNN: A synergistic approach to precise and efficient spatio-temporal wind speed interval-value prediction. ASOC, 185, 113910. (www)

  @article{ , abstract = {Accurate and reliable wind speed prediction is critical for stabilizing wind power integration. However, current methods are limited by accuracy and stability issues, hindering their large-scale application in wind farms. To overcome these problems, this study innovatively proposes an IMFSformer-CNN model integrating three core components. First, the spatio-temporal and multi-factor feature extraction technology comprehensively captures the spatio-temporal patterns and complex dependencies of wind speed dynamics, incorporating multiple factors such as meteorological variables and spatial correlation. Second, the multi-feature sparse attention mechanism reduces computational complexity by combining sparse attention with multi-feature attention, enhancing representation ability and scalability for precise interval value prediction. Finally, the enhanced interval spatio-temporal prediction fusion model combines the global dependency modeling capabilities of the improved Transformer architecture with the local receptive field advantages of CNN. This hybrid design facilitates the simultaneous capture of both macro-scale atmospheric patterns and micro-scale wind speed fluctuations. The model achieved prediction interval coverage probabilities of 0.921 and 0.899, and coverage width criteria of 1.493 and 3.776, outperforming other models on both datasets. This significantly enhances accuracy and practical value for wind farm cluster forecasting, supporting more reliable and efficient wind energy integration into power grids.}, archive = {J_ASOC}, author = {Weiyi Jiang and Jujie Wang and Xuecheng He}, doi = {10.1016/j.asoc.2025.113910}, journal = {Applied Soft Computing}, month = {12}, pages = {113910}, shortjournal = {Appl. Soft. Comput.}, title = {Interval multi-feature sparse transformer-CNN: A synergistic approach to precise and efficient spatio-temporal wind speed interval-value prediction}, volume = {185}, year = {2025}, }
• (2025). Multi-granularity spatiotemporal fusion neural network with denoising reconstruction for human motion prediction. ASOC, 185, 113909. (www)

  @article{ , abstract = {Human motion prediction has significant application value in many fields. However, existing methods often fail to fully capture the spatial relationships between joints and the temporal flow of information when modeling complex spatiotemporal dependencies. Additionally, these methods are prone to overfitting dominant features while neglecting other important aspects, and struggle with perceiving contour features effectively. To address these issues, this study introduces a novel encoder-decoder framework. The encoder generates a dual-layer adaptive adjacency matrix using a distance partition strategy to parameterize joint relationships, while incorporating a gating mechanism to control the temporal flow of information. The decoder then employs separate spatiotemporal attention modules to decode temporal and spatial features independently. These features are subsequently reconstructed through a spatiotemporal fusion strategy, effectively decoupling and modeling complex spatiotemporal dependencies. To address the issue of overfitting to dominant features, we introduce a denoising reconstruction strategy that allows the model to learn richer combinations of spatiotemporal features under multiple constraints. Furthermore, a multi-granularity information adaptive fusion module is incorporated to achieve adaptive fusion of both local and contour features. Experimental results across several benchmark datasets demonstrate that our method significantly outperforms the state-of-the-art approaches, showcasing its effectiveness in human motion prediction tasks.}, archive = {J_ASOC}, author = {Yong Li and Linfeng Zhu and Haofei Xie and Xinchang Yi}, doi = {10.1016/j.asoc.2025.113909}, journal = {Applied Soft Computing}, month = {12}, pages = {113909}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-granularity spatiotemporal fusion neural network with denoising reconstruction for human motion prediction}, volume = {185}, year = {2025}, }
• (2025). FFNN: Fractional order basis function multi-step neural network method for fractional partial differential equations. ASOC, 185, 113907. (www)

  @article{ , abstract = {With the advancement in artificial intelligence technology, the increasing number of researchers utilize it to address complex equations in ocean engineering. So the technology of artificial intelligence has become a practical area of research. In this paper, we design a novel method to solve the fractional order long water wave equation, which is called the fractional order basis function multi-step neural network. Firstly, a power series is constructed based on a fractional order basis function, which serves as the approximate solution. Secondly, neural networks and the initial conditions of differential equations are integrated into the construction of approximate solutions. Furthermore, the solution is discretized, and a multi-step unfolding strategy is employed on the resulting discrete solution. This approach ensures that each point in the solution is influenced by its predecessor. By means of repeated applications of the optimization algorithm, the residuals are successively diminished, thereby yielding approximate solutions to the equations. Finally, the efficacy and versatility of the proposed strategy were validated through a series of numerical experiments. Compared with the method of fractional physics-informed neural networks, there are up to 18.7 -fold and 22.8 -fold increases in stability of average and maximum residuals. Simultaneously, initial conditions are retained in new solutions.}, archive = {J_ASOC}, author = {Jianke Zhang and Xudong Tian and Chang Zhou}, doi = {10.1016/j.asoc.2025.113907}, journal = {Applied Soft Computing}, month = {12}, pages = {113907}, shortjournal = {Appl. Soft. Comput.}, title = {FFNN: Fractional order basis function multi-step neural network method for fractional partial differential equations}, volume = {185}, year = {2025}, }
• (2025). MCSMOTE: A transition matrix-driven oversampling technique for class imbalance. ASOC, 185, 113906. (www)

  @article{ , abstract = {Class imbalance presents a challenge in machine learning, often skewing predictive performance toward the majority class and undermining the accuracy of minority class predictions. To address this, we introduce MCSMOTE, a novel resampling method that employs a transition matrix-based Monte Carlo mechanism for generating synthetic samples. MCSMOTE differentiates itself by modeling the relationships among features and leveraging probabilistic transitions to generate synthetic data points that effectively capture the underlying data structure. This approach ensures enhanced representativeness of the minority class while approximating the local structure of the minority class and thereby generating samples that reflect the underlying data patterns. Comprehensive experiments across 63 diverse imbalanced datasets demonstrate that MCSMOTE consistently outperforms nine widely used resampling techniques—NORES, ROS, SMOTE, ADASYN, BLSMOTE, RWO, SMOTEWB, DeepSMOTE, RWO, and GQEO—when evaluated using multiple classifiers and six key performance metrics: balanced accuracy, F1-score, G-mean, MCC, ROCAUC, and ROCAUC. Results show that MCSMOTE achieves the highest average performance across all metrics. Friedman and Nemenyi tests confirm that these improvements are statistically significant. An ablation study further highlights the stability and effectiveness of MCSMOTE’s hyperparameter choices across different data characteristics. These findings establish MCSMOTE as a powerful and reliable solution for addressing class imbalance in machine learning applications.}, archive = {J_ASOC}, author = {Fatih Sağlam and Mehmet Ali Cengiz}, doi = {10.1016/j.asoc.2025.113906}, journal = {Applied Soft Computing}, month = {12}, pages = {113906}, shortjournal = {Appl. Soft. Comput.}, title = {MCSMOTE: A transition matrix-driven oversampling technique for class imbalance}, volume = {185}, year = {2025}, }
• (2025). Limited-budget consensus with maximum consensus level for group decision making. ASOC, 185, 113905. (www)

  @article{ , abstract = {Group decision making usually requires in-depth discussions to form a consensus acceptable to the entire group, which has attracted more and more research in recent years. Despite extensive studies on soft consensus, the relationship between consensus level and consensus cost remains unclear. This study establishes—for the first time—a precise mathematical relationship demonstrating that higher consensus levels require proportionally greater consensus costs. This finding provides critical theoretical grounding for consensus modeling. Recognizing that the cost of achieving consensus cannot be infinite and must be within a certain budget, we develop a model to determine the maximum achievable consensus level under a limited-budget. The consensus model with non-cooperators is also explored and formulated. The proposed models are applied to online lending platforms, providing a practical framework for measuring consensus levels and achieving soft consensus between lenders and borrowers within a limited-budget. This work contributes to understanding the relationship between consensus level and consensus cost, as well as the achievement of the maximum possible consensus level under limited-budget, which is relevant in scenarios where resources are finite.}, archive = {J_ASOC}, author = {Huanhuan Zhang and Dongjie Guo and Yifeng Ma}, doi = {10.1016/j.asoc.2025.113905}, journal = {Applied Soft Computing}, month = {12}, pages = {113905}, shortjournal = {Appl. Soft. Comput.}, title = {Limited-budget consensus with maximum consensus level for group decision making}, volume = {185}, year = {2025}, }
• (2025). Discrimination index based attribute reduction for partially labeled heterogeneous data via a new prediction label strategy and statistical distribution of data. ASOC, 185, 113904. (www)

  @article{ , abstract = {Existing methods often struggle to effectively utilize the statistical distribution of data and unlabeled information when dealing with partially labeled heterogeneous data, leading to limited performance in attribute reduction. To address this issue, this paper presents a novel semi-supervised attribute reduction method that integrates statistical distribution of data, conditional discrimination index and a new prediction label strategy. Initially, the similarity between objects is constructed by analyzing the statistical distribution of data. Subsequently, a new prediction label strategy is introduced, which not only utilizes existing label information but also completes missing information by predicting new labels, thereby enhancing the completeness and usability of data. Finally, conditional discrimination index, a tool for measuring the importance of attributes in classification tasks, is employed to design an attribute reduction algorithm. The experimental results on real-world partially labeled heterogeneous datasets show that the proposed p-CDIAR algorithm exhibits superior performance compared to the existing nine reduction algorithms, with an average increase of 4.67 % in classification accuracy and 6.32 % in outlier detection performance.}, archive = {J_ASOC}, author = {Qingnian Li and Haixin Huang and Tao Lu and Huaming Wei and Zhaowen Li}, doi = {10.1016/j.asoc.2025.113904}, journal = {Applied Soft Computing}, month = {12}, pages = {113904}, shortjournal = {Appl. Soft. Comput.}, title = {Discrimination index based attribute reduction for partially labeled heterogeneous data via a new prediction label strategy and statistical distribution of data}, volume = {185}, year = {2025}, }
• (2025). An unsupervised framework for drift-aware anomaly detection in streaming time series. ASOC, 185, 113903. (www)

  @article{ , abstract = {This paper presents an unsupervised adaptive drift-aware anomaly detection framework (ADA-ADF) designed to address the challenges of concept drift in time series data streams. ADA-ADF integrates a hybrid drift detection mechanism, combining statistical tests with performance-based metrics to accurately identify and distinguish between sudden and incremental drifts. To ensure effective adaptation, it employs a replay-based model update strategy that adjusts replay ratios in a drift-specific manner and incorporates representative historical data based on reconstruction errors. This approach allows the model to seamlessly adapt to evolving data distributions while maintaining high stability and accuracy. Extensive experiments on four diverse datasets demonstrate ADA-ADF’s superior performance in managing various drift and application scenarios. It consistently outperforms state-of-the-art methods, particularly in environments characterized by incremental or sudden drifts. With robust adaptability to changing data patterns and accurate anomaly detection capabilities, ADA-ADF provides a reliable solution for real-world applications, such as IoT and environmental monitoring.}, archive = {J_ASOC}, author = {Danlei Li and Nirmal-Kumar C. Nair and Kevin I-Kai Wang}, doi = {10.1016/j.asoc.2025.113903}, journal = {Applied Soft Computing}, month = {12}, pages = {113903}, shortjournal = {Appl. Soft. Comput.}, title = {An unsupervised framework for drift-aware anomaly detection in streaming time series}, volume = {185}, year = {2025}, }
• (2025). A MADM framework for classifying wireless sensor networks in industrial automation and monitoring using hesitant bipolar complex fuzzy dombi power operators. ASOC, 185, 113902. (www)

  @article{ , abstract = {Wireless sensor networks (WSNs) are essential for industrial automation and monitoring because they eliminate the need for wires by enabling real-time data collection, processing, and transmission. They are highly effective for a wide range of applications, from optimizing industrial processes to monitoring machinery and environmental conditions. Using standard methods for evaluating WSNs is insufficient to identify many of the features that are important for making decisions. However, a major flaw in the existing approaches is their inability to simultaneously consider the negative features and extra information associated with attributes. There may be a greater chance of significant information loss as a result. Keeping in mind all those flaws, this manuscript has formulated a new methodology for the evaluation of the best WSNs classification. The hesitant bipolar complex fuzzy (HBCF) Dombi power approach is probably different from all other existing approaches because of its different affordable characteristics of hesitancy nature with dual aspects and saving extra information without any loss. Moreover, this novel approach can easily manage the bipolar nature of any information. Also, in this manuscript, a case study focused on WSNs has been examined. The comparative analysis and results are also discussed, which demonstrate the superiority and effectiveness of the proposed work.}, archive = {J_ASOC}, author = {Tahir Mahmood and Hafiz Muhammad Waqas and Ubaid ur Rehman}, doi = {10.1016/j.asoc.2025.113902}, journal = {Applied Soft Computing}, month = {12}, pages = {113902}, shortjournal = {Appl. Soft. Comput.}, title = {A MADM framework for classifying wireless sensor networks in industrial automation and monitoring using hesitant bipolar complex fuzzy dombi power operators}, volume = {185}, year = {2025}, }
• (2025). Extended belief rule-based system with online joint learning strategy. ASOC, 185, 113901. (www)

  @article{ , abstract = {With the proliferation of dynamic data streams in the advanced technology environment, it is necessary to solve the evolving classification problems by using adaptable and interpretable artificial intelligence techniques. To meet this challenge, a new extended belief rule-based (EBRB) system incorporating online joint learning strategy is proposed in this paper. The online joint learning strategy comprises two key components: rule update and parameter update schemes. In the rule update scheme, different rule incorporation processes are designed for the labeled or unlabeled input data while overlapping and redundant rules are removed from the rule base. To adapt the updated rule base, the parameter update scheme is designed to retune the parameters within updated rule base. The antecedent attribute weights are optimized using the Bayesian optimization algorithm and the rule weights are updated based on the consistency of rules. To evaluate the performance of the developed system, it is applied to assist radiologists in diagnosing thyroid nodules. Compared with the existing offline EBRB systems and online learning methods, the proposed online joint learning EBRB system could generate higher classification accuracy with fewer rules in the limited running time.}, archive = {J_ASOC}, author = {Bingbing Hou and Min Xue and Leilei Chang and Zijian Wu}, doi = {10.1016/j.asoc.2025.113901}, journal = {Applied Soft Computing}, month = {12}, pages = {113901}, shortjournal = {Appl. Soft. Comput.}, title = {Extended belief rule-based system with online joint learning strategy}, volume = {185}, year = {2025}, }
• (2025). A collaborative competition multitasking framework for constrained multi-objective optimization. ASOC, 185, 113900. (www)

  @article{ , abstract = {Constrained multi-objective optimization problems (CMOPs) are common in the real world. Constrained multi-objective evolutionary algorithms (CMOEAs) based on evolutionary multi-tasking show excellent performance in solving CMOPs. However, not all tasks can find useful information during the process of evolution, which inevitably results in a waste of computing resources. In this paper, a CMOEA based on collaborative competition multitasking (TCCMT) is proposed, in which two auxiliary tasks are constructed to co-evolve with the main task in a collaborative competition manner. During the process of evolution, only the dominant auxiliary task is selected to help the main task evolve, which reduces the resource consumption to evolve the invalid tasks. Meanwhile, the evolutionary process is divided into three stages in order to balance exploration and exploitation. The auxiliary tasks customize the constrained adaptive regression strategy and double angle enhancement strategy respectively to improve the ability to solve different problems. Compared with the nine most advanced CMOEAs on 33 benchmark problems and 7 real-world engineering problems, the Friedman test results show that TCCMT achieves the best rank on all test problems and exhibits a statistically significant difference.}, archive = {J_ASOC}, author = {Xinyu Feng and Qianlong Dang and Xiaochuan Gao and Yanghui Wu and Lifei Zheng}, doi = {10.1016/j.asoc.2025.113900}, journal = {Applied Soft Computing}, month = {12}, pages = {113900}, shortjournal = {Appl. Soft. Comput.}, title = {A collaborative competition multitasking framework for constrained multi-objective optimization}, volume = {185}, year = {2025}, }
• (2025). A Q-learning based genetic algorithm for collaborative optimization of import container allocation and yard crane deployment in container terminal. ASOC, 185, 113899. (www)

  @article{ , abstract = {The implementation of truck appointment systems in container terminals has led to a greater focus on optimizing terminal operations using appointment information. Container allocation and yard crane deployment problems are the primary issues of yard management that are influenced by truck appointment information. This paper investigates the impact of appointment information on yard operation management, specifically focusing on the container allocation for import tasks and optimizing the deployment of yard cranes based on the workload. A collaborative optimization model is proposed to minimize the workload imbalance across blocks. This model considers the impact of truck appointment information, allocating storage space and storage numbers for import tasks, as well as the minimum number of transfers to arrange yard cranes. Due to the complexity of the model, a self-learning genetic algorithm utilizing Q-learning is designed to solve the proposed model. A comparison was made between the optimization model that takes truck appointments into account and the traditional one which did not. The results indicate that the workload imbalance can be decreased by a minimum of 22.06 % when considering information on the truck appointments. The experimental results demonstrate that the proposed approach successfully reduces workload imbalance among blocks and mitigates the negative effects caused by yard congestion.}, archive = {J_ASOC}, author = {CuiJie Diao and Ying Huang and KangZhen Peng and ZhiHong Jin}, doi = {10.1016/j.asoc.2025.113899}, journal = {Applied Soft Computing}, month = {12}, pages = {113899}, shortjournal = {Appl. Soft. Comput.}, title = {A Q-learning based genetic algorithm for collaborative optimization of import container allocation and yard crane deployment in container terminal}, volume = {185}, year = {2025}, }
• (2025). Fusing local density and approximate distance for nonparametric outlier detection. ASOC, 185, 113898. (www)

  @article{ , abstract = {Outlier detection is an essential yet challenging task in intelligent data analysis, and some density-based unsupervised methods have been introduced to identify outliers in low-density regions. However, these methods still suffer from inaccurate density estimation and limited capability in detecting diverse types of outliers. In this study, we propose a nonparametric outlier detection method with the fusion of density and distance (POD-FDD). The proposed method employs adaptive kernel density estimation based on natural neighborhoods, which reduces the sensitivity to parameters in density estimation. Moreover, the optimistic and pessimistic densities are introduced to enhance the reliability of density estimation in the local neighborhood. In addition, approximate reachability distance information is integrated to improve the capability of identifying cluster outliers. Ultimately, a robust parametric-free outlier detection method is developed to detect different types of outliers. Extensive comparative experiments and statistical significance analysis on synthetic and public datasets demonstrate its superior performance, achieving an average improvement of 1.97 % in the AUC metric.}, archive = {J_ASOC}, author = {Zhiyu Chen and Can Gao and Jie Zhou and Ying Yu}, doi = {10.1016/j.asoc.2025.113898}, journal = {Applied Soft Computing}, month = {12}, pages = {113898}, shortjournal = {Appl. Soft. Comput.}, title = {Fusing local density and approximate distance for nonparametric outlier detection}, volume = {185}, year = {2025}, }
• (2025). Prediction of the risk level of saltwater intrusion in the modaomen waterway of the pearl river estuary based on the deep temporal clustering model. ASOC, 185, 113897. (www)

  @article{ , abstract = {In recent years, extreme events caused by global climate change have intensified the phenomenon of saltwater intrusion (SWI) in estuaries. The nonlinear and non-stationary characteristics of estuarine SWI have led to an exponential decline in the timeliness of traditional regression prediction models, making it difficult to meet the operational needs of SWI forecasting. To address this, this study proposed a technical framework for SWI risk level forecasting based on temporal clustering, with its core innovation lying in algorithmic improvements for accurately characterizing complex disaster systems. The key challenges in forecasting SWI risk levels involved capturing the dynamic nonlinear relationships between multidimensional disaster factors (such as runoff, tide level, and wind) and SWI severity, as well as enhancing feature discriminability in label-limited scenarios. Accordingly, this study optimized algorithms through dual-path supervised and unsupervised learning: In the supervised learning framework, LightGBM, RF, XGBoost, and Extra trees were introduced as base learners into the Deep Forest (DF) model. The complementary feature-space partitioning of diverse learners was leveraged to improve the model’s ability to distinguish risk -level boundaries, achieving an average performance gain of 7.8 %. In the unsupervised learning framework, discriminative regularization was incorporated into the Extreme Learning Machine-Autoencoder (ELM-AE) model. By forcing features of samples from the same class to cluster toward the class center, the model’s feature separability for rare events (e.g., severe SWI) was enhanced, leading to an average performance improvement of 11 %. Finally, the optimal model was used to extract dynamic evolution patterns between multidimensional disaster factors and SWI risk levels, with interpretability analysis conducted for real-world forecasting. Notably, upstream flow sequences exhibited high distinguishability between no-SWI and severe-SWI, while mild and moderate SWI showed similar flow patterns, with tidal sequences being the primary differentiator. The algorithmic advancements not only enhanced the accuracy and efficiency of SWI forecasting but also provided a generalizable framework for risk classification in nonlinear hydrological systems.}, archive = {J_ASOC}, author = {Qingqing Tian and Hongyu Yang and Yu Tian and Peiyao Weng}, doi = {10.1016/j.asoc.2025.113897}, journal = {Applied Soft Computing}, month = {12}, pages = {113897}, shortjournal = {Appl. Soft. Comput.}, title = {Prediction of the risk level of saltwater intrusion in the modaomen waterway of the pearl river estuary based on the deep temporal clustering model}, volume = {185}, year = {2025}, }
• (2025). Contrastive learning with mirror-task for multimodal sentiment analysis. ASOC, 185, 113896. (www)

  @article{ , abstract = {Multi-Task Learning (MTL) in Multimodal Sentiment Analysis (MSA) involves implementing various parameter-sharing strategies among tasks. Currently, MSA primarily focuses on hard parameter-sharing mechanisms based on encoder sharing, while soft parameter-sharing is often neglected. To explore a reasonable combination of soft and hard mechanisms in MSA and optimize multimodal representations, along with multimodal contrastive learning, we propose D 3 MSA. It consists of D ouble network (primaryNet and MirrorNet), D ouble parameter-sharing strategies and D ouble contrastive learning modes for multimodal sentiment analysis. D 3 MSA utilizes hard-sharing to consolidate correlations between positive samples of intra-sample contrastive learning. In soft-sharing, we propose a pre-trained MirrorNet (MN) that generates negative samples by the learned inverse distributions. This optimizes the feature space of negative samples. MN interacts with the MSA task through soft-sharing during inter-sample contrastive learning. Experimental results demonstrate that our proposed method can achieve advanced performance on the CMU-MOSI and CMU-MOSEI datasets with lightweight training that requires only a small number of parameters.}, archive = {J_ASOC}, author = {Hang Shi and Lianmin Zhou and Yuanyuan Pu and Zhengpeng Zhao and Jinjing Gu and Dan Xu}, doi = {10.1016/j.asoc.2025.113896}, journal = {Applied Soft Computing}, month = {12}, pages = {113896}, shortjournal = {Appl. Soft. Comput.}, title = {Contrastive learning with mirror-task for multimodal sentiment analysis}, volume = {185}, year = {2025}, }
• (2025). A nearest-best neighbors optimization algorithm for constrained multimodal multiobjective problems. ASOC, 185, 113895. (www)

  @article{ , abstract = {Constrained multimodal multiobjective problems (CMMOPs) have multiple equivalent constrained Pareto optimal sets in the decision space corresponding to the identical constrained Pareto front in the objective space. The key to solving CMMOPs is how to balance feasibility, convergence, and diversity of solutions in both the decision and objective spaces. In view of this, this paper proposes a Nearest-Best neighbors optimization algorithm with constraint-based fitness (NBNOA) to solve CMMOPs. First, a constraint-based fitness assignment scheme is designed to assign specific fitness values to individuals in the population. Then, the Nearest-better-neighbor clustering method is adopted to identify the nearest-better neighbor and best neighbor of each individual according to the specific fitness values. On this basis, a Nearest-Best neighbors guided strategy is developed to guide the search direction of individuals, striking a better balance between exploration and exploitation capabilities. Moreover, a CDP-density elite selection mechanism is constructed to obtain feasible Pareto optimal solutions with higher precision and better diversity. Extensive experiments on two CMMOPs test suites demonstrated that the proposed NBNOA significantly outperforms nine state-of-the-art algorithms. Notably, NBNOA ranks first among all ten algorithms and achieves the best values for 23 out of 31 benchmark functions regarding the reciprocal of Pareto sets proximity and inverted generational distance. Furthermore, NBNOA is applied to a real-world CMMOP, verifying its effective practical application capability. Additionally, NBNOA is tested on two high-dimensional constrained multiobjective optimization problems test suites, further proving its competitive performance in solving complex problems.}, archive = {J_ASOC}, author = {Xuming Han and Ting Zhou and Limin Wang and Yali Chu}, doi = {10.1016/j.asoc.2025.113895}, journal = {Applied Soft Computing}, month = {12}, pages = {113895}, shortjournal = {Appl. Soft. Comput.}, title = {A nearest-best neighbors optimization algorithm for constrained multimodal multiobjective problems}, volume = {185}, year = {2025}, }
• (2025). Pathology characteristics-aware federated learning for weakly supervised nuclei segmentation. ASOC, 185, 113894. (www)

  @article{ , abstract = {In federated learning, a key challenge in nuclei segmentation lies in data heterogeneity, primarily resulting from the diverse sources of pathology images. Nuclei in pathological images are typically small and densely distributed, making accurate annotation highly labor-intensive and reliant on specialized expertise. Weakly supervised learning is widely adopted for this task, as it only requires point annotations at the centers of nuclei. However, point annotations lack precise boundary information, thereby exacerbating the difficulties introduced by data heterogeneity. To address this issue, we propose a preprocessing strategy that leverages the unique optical properties of H&E stained images to generate Contrast-Difference Enhanced Images (CDEI). These CDEI highlight nucleus boundaries to varying extents based on the tonal characteristics of H&E stained images. Building on this strategy, we propose a Multi-source Hierarchical Enhancement Network (MHEN) as the client-side architecture. MHEN takes both the H&E stained images and the corresponding CDEI as input, effectively mitigating the limitations of weak labels by incorporating enhanced boundary cues. Furthermore, considering the characteristics of nuclei segmentation, we design a Federated Nuclei-Weighted Aggregation strategy on the server side. This strategy estimates each client’s contribution to the global model by quantifying the number of nuclei present in its local pathology images. To thoroughly assess the effectiveness of our approach, we compare it with both conventional weakly supervised methods and existing federated weak supervision frameworks. The experimental results demonstrate that our proposed federated learning framework for weakly supervised nuclei segmentation significantly outperforms existing methods. Our source code is available on GitHub. 1}, archive = {J_ASOC}, author = {Yi Qian and Xipeng Pan and Yimin Wen and Xinjun Bian and Shilong Song}, doi = {10.1016/j.asoc.2025.113894}, journal = {Applied Soft Computing}, month = {12}, pages = {113894}, shortjournal = {Appl. Soft. Comput.}, title = {Pathology characteristics-aware federated learning for weakly supervised nuclei segmentation}, volume = {185}, year = {2025}, }
• (2025). Frequency decomposition and patch modeling framework for time-series forecasting. ASOC, 185, 113890. (www)

  @article{ , abstract = {Time series forecasting is widely applied across diverse fields, including finance, transportation, and energy, and has made significant contributions in these areas. However, in real-world applications, time series data can be complex and dynamic. Current methodologies still encounter several challenges in managing high-dimensional data, extracting intricate features, and making long-term forecasts. In this study, we propose a Frequency Decomposition and Patch Modeling Framework (FPF). Our FPF consists of the Frequency Domain Decomposition Block (FDB) and the Dual Patch Modeling Block (DPMB). DPMB consists of Patch Enhancement Block and Patch Mixing Block. First, FDB transforms the input sequence to the frequency domain through the Fast Fourier Transform and designs frequency masks to decompose the data into high-frequency and low-frequency components, to extract fast-changing patterns and trend information respectively. Subsequently, DPMB divides the components into patches, where the high-frequency components are modeled by MLP-based Patch Enhancement Block to capture local features, and the low-frequency components are modeled by Transformer-based Patch Mixing Block to capture global dependencies and cross-patch correlations. We conducted comprehensive experiments using seven real-world time series forecasting datasets, including ETT, Traffic, Electricity, and Weather. The findings indicate that this method demonstrates superior performance in the field of time series forecasting.}, archive = {J_ASOC}, author = {Denghui Xu and Hua Wang and Fan Zhang}, doi = {10.1016/j.asoc.2025.113890}, journal = {Applied Soft Computing}, month = {12}, pages = {113890}, shortjournal = {Appl. Soft. Comput.}, title = {Frequency decomposition and patch modeling framework for time-series forecasting}, volume = {185}, year = {2025}, }
• (2025). OdML: An optimization-driven meta-learning framework for multi-task approximate model predictive control. ASOC, 185, 113882. (www)

  @article{ , abstract = {Recent advances in approximate model predictive control (MPC) have leveraged deep neural networks (DNNs) to imitate optimal control laws, significantly reducing the computational cost of real-time optimization. However, these methods often struggle to adapt efficiently to previously unseen system dynamics and suffer from poor data efficiency in real time. In this paper, we address these challenges by treating control problems with different system parameters as separate tasks within a meta-learning scope. Under this scope, we propose OdML, an Optimization-driven Meta-Learning approach for approximate MPC that enables rapid online fine-tuning of DNN-based controllers. We introduce an optimization-driven fine-tuning mechanism that allows for fast adaptation to new tasks using limited online data, without requiring full knowledge of the system parameters. Furthermore, to ensure safety during adaptation, we incorporate control barrier functions into the optimization process, allowing the controller to satisfy safety constraints even under previously unseen conditions. We demonstrate the effectiveness of OdML through various simulation scenarios, highlighting its ability to achieve safe and efficient control.}, archive = {J_ASOC}, author = {Junbo Tong and Shuhan Du and Daming Shi and Wenhui Fan}, doi = {10.1016/j.asoc.2025.113882}, journal = {Applied Soft Computing}, month = {12}, pages = {113882}, shortjournal = {Appl. Soft. Comput.}, title = {OdML: An optimization-driven meta-learning framework for multi-task approximate model predictive control}, volume = {185}, year = {2025}, }
• (2025). A deep reinforcement learning trader without offline training. ASOC, 185, 113881. (www)

  @article{ , abstract = {In this paper we pursue the question of a fully online trading algorithm (i.e. one that does not need offline training on previously gathered data). For this task we consider Double Deep Q -learning in the episodic setting with Fast Learning Networks approximating the expected reward Q . Additionally, we define the possible terminal states of an episode in such a way as to introduce a mechanism to conserve some of the money in the trading pool when market conditions are seen as unfavourable. Some of these money are taken as profit and some are reused at a later time according to certain criteria. After describing the algorithm, we test it using 1-minute-tick price data for 4 major cryptocurrencies from Binance. We see that the agent performs better than trading with randomly chosen actions on each timestep. And it does so when tested on the whole dataset for a given market as well as on different subsets, representing different market trends.}, archive = {J_ASOC}, author = {Boian Lazov}, doi = {10.1016/j.asoc.2025.113881}, journal = {Applied Soft Computing}, month = {12}, pages = {113881}, shortjournal = {Appl. Soft. Comput.}, title = {A deep reinforcement learning trader without offline training}, volume = {185}, year = {2025}, }
• (2025). Density peak clustering algorithm based on boundary elimination and backbone construction. ASOC, 185, 113880. (www)

  @article{ , abstract = {Density peak clustering (DPC) is an effective clustering algorithm, but it still has some problems and faces some challenges. For instance, it cannot identify the variable density datasets, the assignment strategy is easy to produce domino phenomenon, and the clustering results of DPC and its improved algorithms are easily affected by the intersection points between clusters. To solve these problems, in this paper, we propose a novel density peak clustering algorithm based on boundary elimination and backbone construction, called BEBC-DPC. A new local density is defined based on the natural neighbor search, and the boundary degree is defined by the position relationship between each point and its neighbors, which accurately describes the local distribution information of the point. The boundary points of clusters are eliminated by fusing the density and the boundary degree, which reduces the influence of the intersection points on the cluster division. In addition, the cluster backbone construction method based on representative points and representative sets is proposed. The density relationship among non-boundary points is used to form representative sets, and the similarity between representative sets is used to construct the cluster backbones, which can effectively describe the overall distribution structure characteristics of the clusters. Moreover, the adjacency degree of each boundary point is defined by using the neighbor information and distance information, and the boundary points are gradually assigned to the most appropriate cluster backbone based on it to complete the clustering. Finally, sufficient experiments are performed on synthetic, UCI and image datasets, and the proposed BEBC-DPC is compared with DPC and its improved algorithms. Experimental results show the effectiveness of the proposed BEBC-DPC on various types of datasets.}, archive = {J_ASOC}, author = {Zhizhong Zhao and Sugen Chen and Cong Hu}, doi = {10.1016/j.asoc.2025.113880}, journal = {Applied Soft Computing}, month = {12}, pages = {113880}, shortjournal = {Appl. Soft. Comput.}, title = {Density peak clustering algorithm based on boundary elimination and backbone construction}, volume = {185}, year = {2025}, }
• (2025). Multi-criteria decision analysis-based framework for supply chain management evaluation with multi-dimensional sensitivity analysis: A green logistics perspective. ASOC, 185, 113879. (www)

  @article{ , abstract = {The transition toward sustainable Supply Chain Management (SCM) presents complex decision-making challenges that require robust and transparent evaluation methods. Effective decision-making in this context requires robust evaluation methods capable of handling complex, multi-dimensional aspects of the decision process. This study proposes a comprehensive decision-support framework that integrates Multi-Criteria Decision Analysis (MCDA) with advanced sensitivity analysis techniques to assess the stability and reliability of alternative rankings under uncertainty. The framework combines established MCDA methods with submodel exclusion analysis and the Comprehensive Sensitivity Analysis Method (COMSAM), which allows for systematic perturbation of the decision matrix and evaluation of robustness across multiple dimensions. Applied to a green logistics case study, the framework demonstrates its capacity to support sustainable decision-making by accounting for varying stakeholder priorities and data uncertainty. The approach offers methodological advances in robustness assessment, practical relevance for sustainability-focused SCM, and open-source implementation to ensure reproducibility. The proposed framework is adaptable to a wide range of decision contexts, contributing to the development of more reliable and explainable MCDA-based evaluations.}, archive = {J_ASOC}, author = {Jakub Więckowski and Wojciech Sałabun}, doi = {10.1016/j.asoc.2025.113879}, journal = {Applied Soft Computing}, month = {12}, pages = {113879}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-criteria decision analysis-based framework for supply chain management evaluation with multi-dimensional sensitivity analysis: A green logistics perspective}, volume = {185}, year = {2025}, }
• (2025). Hierarchical layered multigraph network with scale importance estimation for image classification. ASOC, 185, 113877. (www)

  @article{ , abstract = {This work introduces a novel image representation and processing approach using Graph Neural Networks (GNNs). We propose a multigraph representation named H i E rarchical L ayered M ultigraph (HELM), which explicitly encodes spatial and hierarchical relationships as distinct edge types, overcoming the limitations of existing methods that fail to fully exploit relational information in images. A multi-scale representation is generated through hierarchical segmentation of a superpixel base graph, enabling the computation of spatial and hierarchical relationships within and across scales. To effectively process this multi-relational information, we introduce the H i E rarchical L ayered M ultigraph Net work (HELMNet), a novel GNN architecture incorporating specialized mechanisms for selectively aggregating and fusing information from each distinct edge type. Additionally, it includes a Region Graph Readout (RGR) module that employs an attention mechanism to dynamically weight the contribution of each representation scale during the aggregation process for classification. Experimental results demonstrate the greater efficacy of HELMNet for image classification. Compared to hierarchical models that do not distinguish between edge types, HELMNet obtains substantial average accuracy gains of 2.1% (significant at 3% level) and 10% (significant at 0.1% level) on the CIFAR-10 and STL-10 datasets, respectively. On the EUROSAT dataset, HELMNet achieves over 95% accuracy, requiring only 0.73% of the best-performing state-of-the-art model size (in number of parameters). For the more demanding and high-resolution RESISC45 dataset, the proposed model still delivers impressive results, achieving an accuracy of over 85%.}, archive = {J_ASOC}, author = {João Pedro Oliveira Batisteli and Nicolas Passat and Silvio Jamil Ferzoli Guimarães and Zenilton Kleber Gonçalves do Patrocínio Júnior}, doi = {10.1016/j.asoc.2025.113877}, journal = {Applied Soft Computing}, month = {12}, pages = {113877}, shortjournal = {Appl. Soft. Comput.}, title = {Hierarchical layered multigraph network with scale importance estimation for image classification}, volume = {185}, year = {2025}, }
• (2025). Boosting fuzzy classification rules under footprint of uncertainty of type-2 fuzzy sets. ASOC, 185, 113876. (www)

  @article{ , abstract = {This paper presents a novel approach to improving classification accuracy in fuzzy rule-based systems by selecting Embedded Type-1 Fuzzy Sets (ET1 FSs) from Footprint of Uncertainty (FOU) areas. The method consists of three stages: (1) learning Type-1 fuzzy rules from predefined linguistic variables, (2) generating FOU areas with Interval Type-2 Fuzzy Sets (IT2 FSs), and (3) using the adaboost ensemble method, where multi-class problems are decomposed into binary classification tasks, and ET1 FSs are iteratively selected via genetic algorithms. By relying on IT2 FSs for the flexible partitioning of classification boundaries, the method enhances accuracy while addressing challenges in high-dimensional and multi-class problems. Experiments were performed on 12 UCI datasets and three image classification tasks using features from pre-trained convolutional neural networks. These datasets were selected to ensure diversity in dimensionality and class distribution. Comparative analyses with several state-of-the-art classification methods demonstrate that IT2 FSs can be effectively used to develop accurate classification systems. Additionally, this work analyzes trade-offs between complexity and interpretability by tuning FOU size (distinguishability) and adjusting the number of rules. The results show that a balanced FOU size and rule count yield better accuracy gains than either alone. Furthermore, several suitable trade-off regions with their parameters are presented.}, archive = {J_ASOC}, author = {Jidong Li and Jian Cui and Qian Su}, doi = {10.1016/j.asoc.2025.113876}, journal = {Applied Soft Computing}, month = {12}, pages = {113876}, shortjournal = {Appl. Soft. Comput.}, title = {Boosting fuzzy classification rules under footprint of uncertainty of type-2 fuzzy sets}, volume = {185}, year = {2025}, }
• (2025). Reliable type 2 fuzzy Min–Max neural networks for pattern classification. ASOC, 185, 113875. (www)

  @article{ , abstract = {The Fuzzy Min–Max (FMM) algorithm is a powerful classification method capable of handling non-linear class boundaries and making both hard and soft decisions while learning from online data. However, it faces significant challenges, including sensitivity to the expansion coefficient, information loss during the contraction stage, and the overlap problem. To address these limitations, we propose a Reliable Type-2 Fuzzy Min–Max (RT2FMM) algorithm, which incorporates type-2 fuzzy logic to consider hyperbox uncertainty and effectively resolve the overlap problem. By assigning distinct certainties to overlapping regions, RT2FMM eliminates the need for the contraction stage and the overlap test. Additionally, we introduce weighted factors for hyperboxes, which enhances the reliability of membership values and models their mutual effects. Our comprehensive experimental evaluation across twenty datasets demonstrates that RT2FMM significantly outperforms existing FMM-based models in terms of robustness and accuracy. The Friedman test further confirms the superior performance of RT2FMM compared to commonly used classifiers, highlighting its potential as a robust solution for complex classification tasks.}, archive = {J_ASOC}, author = {Ali Nik-Khorasani and Mohammad-R. Akbarzadeh-T.}, doi = {10.1016/j.asoc.2025.113875}, journal = {Applied Soft Computing}, month = {12}, pages = {113875}, shortjournal = {Appl. Soft. Comput.}, title = {Reliable type 2 fuzzy Min–Max neural networks for pattern classification}, volume = {185}, year = {2025}, }
• (2025). Fortifying vision models: A comprehensive survey of defences against adversarial examples. ASOC, 185, 113874. (www)

  @article{ , abstract = {Artificial Intelligence and Machine learning (ML) have seen many advancements in the past two decades. It has led to the creation of several techniques, including Deep Neural Networks (DNN), Convolution Neural Networks (CNN), Autoencoders, Generative Adversarial Networks (GAN) and Diffusion models. These techniques have been applied to various real-world applications, such as self-driving cars, medical diagnosis and voice assistants. Despite these advancements, a carefully crafted input can fool the ML model. Such attacks are known as adversarial examples. It is a serious threat to safety critical systems. This survey provides a comprehensive review of defences against adversarial examples by tracing their evolution from early empirical methods to more principled, theoretically grounded approaches. We systematically categorise defences based on their underlying mechanisms. In addition to surveying state-of-the-art techniques, we spotlight emerging trends such as generative defences and diffusion-based purification. Finally, we identify persistent vulnerabilities and outline promising directions for future research towards building truly resilient vision models. This work aims to equip researchers and practitioners with a deep understanding of current defences and inspire innovation in adversarial robustness for the next generation of vision applications.}, archive = {J_ASOC}, author = {Siddheshwar Kumar and Shashank Srivastava and Shashwati Banerjea}, doi = {10.1016/j.asoc.2025.113874}, journal = {Applied Soft Computing}, month = {12}, pages = {113874}, shortjournal = {Appl. Soft. Comput.}, title = {Fortifying vision models: A comprehensive survey of defences against adversarial examples}, volume = {185}, year = {2025}, }
• (2025). AOT-PixelNet: Lightweight and interpretable detection of forged images via adaptive orthogonal transform. ASOC, 185, 113873. (www)

  @article{ , abstract = {Generative image detection faces persistent challenges in terms of generalization and interpretability, limiting its reliability in complex scenarios. To address these issues, we propose AOT-PixelNet, a lightweight and interpretable detection framework that integrates an Adaptive Orthogonal Transform (AOT) module with a streamlined 1 × 1 convolution-based PixelNet architecture. The AOT module leverages diverse orthogonal transforms, such as FFT and DCT, to extract informative frequency-domain features, thereby enhancing sensitivity to medium- and high-frequency artifacts. Meanwhile, PixelNet minimizes parameter count (only 0.98 million) while effectively capturing cross-channel inconsistencies and mitigating overfitting. Experimental evaluations on multiple unseen GAN and diffusion-based datasets demonstrate that AOT-PixelNet achieves superior performance with minimal computational cost. Specifically, it outperforms the NPR method by 0.6% and 11.76% on the ForenSynths and GenImage datasets, respectively, validating the framework’s robustness, effectiveness, and interpretability.}, archive = {J_ASOC}, author = {Dengtai Tan and Deyi Yang and Boao Tan and Chengyu Niu and Yang Yang and Shichao Li}, doi = {10.1016/j.asoc.2025.113873}, journal = {Applied Soft Computing}, month = {12}, pages = {113873}, shortjournal = {Appl. Soft. Comput.}, title = {AOT-PixelNet: Lightweight and interpretable detection of forged images via adaptive orthogonal transform}, volume = {185}, year = {2025}, }
• (2025). Status prediction using attentive and cascaded deep network by fault tolerant and priority-based scheduling for load balancing in cloud. ASOC, 185, 113872. (www)

  @article{ , abstract = {The cloud facilitates the user to complete their work utilizing the cost strategy of pay-as-you-go, which is based on the consumed Virtual Machine (VM) hours. Thus, the scheduler must offer the highest throughput to attain efficient allocation of resources in the cloud paradigm. Cloud services are dependent on characteristics such as fault tolerance, security, scalability, and availability. Hence, an effective scheduler is necessary to arrange the scheduling tasks and adjust the server loads. Typically, a load-balancing task focuses on detecting the overloaded and under-loaded nodes and adjusting the load between them. When considering the significant role of fault-tolerance in load-balancing algorithms, it seems to suffer from poor organization and a lack of in-depth experiments in this sector. This paper proposes a new task for the load-balancing operation. Initially, task scheduling is performed where the fault tolerance and the priority-aided scheduling approach are adopted. Furthermore, resource optimization is carried out in the scheduling task using Randomly Improved Electric Fish Optimization (RIEFO). To validate the load balancing operation, several multi-objective functions such as resource utilization, delay, time, makespan, active servers, throughput, success rate, fault tolerance rate, and energy consumption are derived. Moreover, because of the system’s dynamic environment, the status of the server varies simultaneously. The server status prediction is significant in allocating the tasks to the server or the VM resources. Thus, the Attention-based Cascaded Residual Bidirectional Long Short-Term Memory (ACRes-BiLSTM) is employed to predict the server status before performing the resource allocation. Finally, the tasks are scheduled effectively using the predicted server status. The performance is estimated using numerous performance metrics.}, archive = {J_ASOC}, author = {Gudivada Lokesh and Kasarapu Ramani and K.K. Baseer}, doi = {10.1016/j.asoc.2025.113872}, journal = {Applied Soft Computing}, month = {12}, pages = {113872}, shortjournal = {Appl. Soft. Comput.}, title = {Status prediction using attentive and cascaded deep network by fault tolerant and priority-based scheduling for load balancing in cloud}, volume = {185}, year = {2025}, }
• (2025). A hybrid deep learning framework for detecting grape leaf diseases by integrating ResNeSt-50 and CBAM attention into DeepLabv3 +. ASOC, 185, 113871. (www)

  @article{ , abstract = {Grape leaf diseases, such as black rot, powdery mildew, and downy mildew, pose a significant threat to global viticulture, leading to substantial yield losses and reduced fruit quality. Early and accurate identification of these diseases is essential for precision agriculture and sustainable crop management. This study presents a comprehensive comparison of traditional and deep learning-based image segmentation methods for detecting grape leaf lesions. A series of classical segmentation techniques, including Mean Shift, Fuzzy C-Means (FCM), Normalized Cut, K-Means, and Fuzzy K-Means (FKM), were evaluated alongside an advanced DeepLabv3 + model. The baseline DeepLabv3 + architecture was further enhanced by integrating a ResNeSt-50 backbone with various attention mechanisms, including Squeeze-and-Excitation (SE) Block, Convolutional Block Attention Module (CBAM), Bottleneck Attention Module (BAM), Self-Attention, and Dual Attention Network (DANet). Among all models, DeepLabv3 + with ResNeSt-50 and CBAM achieved the highest performance, attaining 98.2 % accuracy, 97.1 % precision, 96.7 % recall, 96.6 % mean Intersection over Union (mIoU), and a 96.8 % Dice Score. The results demonstrate that attention-augmented deep networks significantly outperform classical methods, especially in handling complex lesion structures under diverse environmental conditions. While traditional algorithms remain useful in resource-constrained scenarios, deep learning models, particularly those enhanced with spatial and channel-wise attention, offer greater accuracy and robustness, making them ideal for integration into intelligent agricultural platforms such as drones, mobile scanners, and automated disease monitoring systems. Future work will focus on incorporating temporal and multimodal data, expanding dataset diversity, and optimizing lightweight models for real-time deployment on edge devices.}, archive = {J_ASOC}, author = {Kittipol Wisaeng}, doi = {10.1016/j.asoc.2025.113871}, journal = {Applied Soft Computing}, month = {12}, pages = {113871}, shortjournal = {Appl. Soft. Comput.}, title = {A hybrid deep learning framework for detecting grape leaf diseases by integrating ResNeSt-50 and CBAM attention into DeepLabv3 +}, volume = {185}, year = {2025}, }
• (2025). A stochastic proportional–differential TLBO algorithm and its applications for wafer transfer finger. ASOC, 185, 113870. (www)

  @article{ , abstract = {The Teaching-Learning-Based optimization (TLBO) algorithm, which includes teacher phase and learner phase, is a widely used method for global optimization. However, TLBO will experience premature convergence and get stuck in local optimum when faced with complex optimization challenges. Especially when tackling complex problems in practical engineering applications, which involves multiple variables and numerous constraints. To address this issue, a new variant termed Stochastic Proportional–Differential TLBO (SPD-TLBO) has been developed. The SPD phase allows students to learn not only from the current population but also from previous stochastic errors and their generation differences using adaptive random operators. By incorporating an SPD operator into the original TLBO framework, the algorithm’s search diversity is enhanced, reducing the likelihood of premature convergence to local optimum. The experimental results conducted at the IEEE Conference on Evolutionary Computation 2014 (CEC 2014) indicated that the proposed SPD-TLBO algorithm achieved an effective balance between exploration and exploitation capabilities. Specifically, the SPD-TLBO algorithm achieves the highest ranking in 21 out of 30 cases (70%) for 30-dimensional problems and 18 out of 30 cases (60%) for 50-dimensional problems. Statistical tests and convergence analyses show that the SPD-TLBO algorithm outperforms other algorithms in solving global optimization problems. Additionally, when applied to engineering optimization problems, the SPD-TLBO algorithm shows significant advantages over other algorithms. Therefore, the SPD-TLBO algorithm is further applied to optimize the structure of a wafer transfer finger in semiconductor manufacturing.}, archive = {J_ASOC}, author = {Jinfeng Sun and Yunlang Xu and Haibo Zhou}, doi = {10.1016/j.asoc.2025.113870}, journal = {Applied Soft Computing}, month = {12}, pages = {113870}, shortjournal = {Appl. Soft. Comput.}, title = {A stochastic proportional–differential TLBO algorithm and its applications for wafer transfer finger}, volume = {185}, year = {2025}, }
• (2025). Prediction of the health effects of COVID using hybrid classifier with attention-based LSTM-deep temporal convolution network. ASOC, 185, 113867. (www)

  @article{ , abstract = {Coronavirus Disease 2019 (COVID-19) is an infectious illness that affects both humans and animals. Individuals infected with COVID-19 are prone to lung complications during the recovery phase . Radiography and Computed Tomography (CT) are the most commonly used methods for diagnosing lung-related diseases. The primary aim of this paper is to assess the impact of COVID-19 on patients’ lungs, heart, and blood sugar levels using a deep learning-based approach. Initially, data related to the heart, blood sugar levels, and lungs of COVID-19-infected individuals are collected. From this dataset, three types of features are extracted. Deep features are obtained using Iterated Dilated Convolutional Neural Networks (IDCNN). From these deep features, which are obtained from the IDCNN, the optimal weighted features are derived by implementing the Hybrid Dolphin Pod Cuttlefish Optimization (HDPCO) algorithm. Subsequently, the HDPCO algorithm is also employed for optimal feature extraction. In addition, dimensionality reduction is performed using Principal Component Analysis (PCA). These three sets of features from the IDCNN, HDPCO, and PCA, are then fused into a single feature set . This fused feature set is fed into a hybrid classifier composed of a Deep Temporal Convolutional Network (DTCN) and an Attention-based Long Short-Term Memory (ALSTM) network . The classifier parameters are optimized using the HDPCO algorithm. The output from the hybrid classifier provides the final prediction result. Experimental results demonstrate that the proposed COVID-19 impact prediction model significantly outperforms existing models in terms of prediction accuracy and efficiency.}, archive = {J_ASOC}, author = {Sadanandam Kalvala and B. Baranidharan}, doi = {10.1016/j.asoc.2025.113867}, journal = {Applied Soft Computing}, month = {12}, pages = {113867}, shortjournal = {Appl. Soft. Comput.}, title = {Prediction of the health effects of COVID using hybrid classifier with attention-based LSTM-deep temporal convolution network}, volume = {185}, year = {2025}, }
• (2025). Quantum fuzzy logic for edge detection: A demonstration on NISQ hardware. ASOC, 185, 113866. (www)

  @article{ , abstract = {Quantum computing offers the potential to enhance computational efficiency beyond classical methods, but practical implementation remains challenging due to the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware, namely, restricted qubit counts, limited connectivity, and the presence of noise and decoherence. This study presents a novel approach to edge detection by leveraging a recently developed Quantum Fuzzy Inference Engine, implemented on a NISQ device. We introduce an optimized quantum circuit for its implementation, reducing qubit requirements and gate depth to improve execution on NISQ hardware. To overcome constraints related to large-scale image processing, a hybrid quantum–classical lookup table approach is employed. Edge detection performance is evaluated on the Berkeley Segmentation Data Set and Benchmarks 500 dataset under different conditions, including classical execution, ideal quantum simulation, noisy quantum simulation, and NISQ hardware calculation. Results demonstrate that the quantum fuzzy logic-based edge detection achieves outcomes comparable to classical methods by using fewer operations, marking a step toward practical quantum-enhanced image processing.}, archive = {J_ASOC}, author = {G. Nunziata and S. Crisci and G. De Gregorio and R. Schiattarella and G. Acampora and L. Coraggio and N. Itaco}, doi = {10.1016/j.asoc.2025.113866}, journal = {Applied Soft Computing}, month = {12}, pages = {113866}, shortjournal = {Appl. Soft. Comput.}, title = {Quantum fuzzy logic for edge detection: A demonstration on NISQ hardware}, volume = {185}, year = {2025}, }
• (2025). Multi-agent cooperation-based bi-criteria evolutionary many-objective optimization. ASOC, 185, 113865. (www)

  @article{ , abstract = {Many-objective evolutionary algorithms (MaOEAs) excel in solving many-objective optimization problems (MaOPs), which are mainly classified into two frameworks: the Pareto domination and the non-Pareto domination. The Pareto criterion (PC) obtains a well-converged solution set in multi-objective spaces through the Pareto dominance relationship between solutions. However, insufficient environmental selection pressure in many-objective spaces leads to slow convergence. The non-Pareto criterion (NPC) enhances the selection pressure by evaluating the solution set with a set of sortable scalar values. However, it is difficult to ensure the Pareto-optimal consistency of convergence and distribution when facing highly irregular Pareto fronts (PFs). Therefore, combining the two sets of criteria can satisfy the demand for uniform distribution while bringing significant selection pressure. A multi-agent cooperative strategy is proposed in this study to realize the combination of the two criteria. This strategy controls the evolutionary direction of two populations separately by deploying two agents, and promotes cooperative evolution between these populations through the exchange and flow of large amounts of information. In order to better realize the cooperative effect, we adopt the multi-agent reinforcement learning (MARL) strategy to accurately regulate the variation operator and parameter configurations of the bi-population. In addition, the effectiveness of the proposed method is validated on 74 test problems (DTLZ, WFG, and UF) and 3 real-world problems. The results show that the proposed algorithm is more competitive than 6 state-of-the-art algorithms.}, archive = {J_ASOC}, author = {Jiazheng Li and Yuan Liu and Juan Zou and Shuyi Liu and Shengxiang Yang and Jinhua Zheng}, doi = {10.1016/j.asoc.2025.113865}, journal = {Applied Soft Computing}, month = {12}, pages = {113865}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-agent cooperation-based bi-criteria evolutionary many-objective optimization}, volume = {185}, year = {2025}, }
• (2025). ORESTE methodology within a circular intuitionistic fuzzy framework for preferential outranking in hybrid cloud service selection. ASOC, 185, 113864. (www)

  @article{ , abstract = {This paper advances the ORESTE (Organísation, Rangement Et Synthèse de Données Relarionnelles) methodology within the Circular Intuitionistic Fuzzy (CIF) framework, highlighting its potential in practical decision analytics. The study first enhances CIF aggregation by employing the generalized mean technique, offering a flexible way to combine evaluative ratings and significance weights. Through modulation of the averaging parameter, decision-makers are able to accentuate either lower or higher values, thereby overcoming the constraints associated with conventional arithmetic means. The framework further improves decision precision through CIF similarity-driven appraisal indices, which utilize refined similarity metrics grounded in axiomatic properties such as symmetry, boundedness, identity, and monotonicity. These indices quantify the similarity between evaluative ratings and anchor references, while also revealing indifference and incomparability—thus equipping decision-makers with a comprehensive toolset for handling uncertainty. The CIF ORESTE framework comprises two methodologies. CIF ORESTE I delivers a global weak ranking using similarity-driven indices and generalized projection-related distances. CIF ORESTE II addresses the limitations of weak rankings by incorporating an Indifference-Preference-Incomparability (I-P-R) structure, which uses mean and net preference intensities to establish thresholds and clarify outranking relations. Applied to the evaluation of hybrid cloud services for a technology corporation, the CIF ORESTE framework demonstrates its effectiveness in resolving group decisions, managing uncertainty, and structuring preferences. Comparative analyses further underscore its robustness in handling CIF-based data and delivering reliable results.}, archive = {J_ASOC}, author = {Ting-Yu Chen}, doi = {10.1016/j.asoc.2025.113864}, journal = {Applied Soft Computing}, month = {12}, pages = {113864}, shortjournal = {Appl. Soft. Comput.}, title = {ORESTE methodology within a circular intuitionistic fuzzy framework for preferential outranking in hybrid cloud service selection}, volume = {185}, year = {2025}, }
• (2025). Prompted complex context generation guided fine-grained ship recognition. ASOC, 185, 113856. (www)

  @article{ , abstract = {Fine-grained ship recognition in complex marine environments is challenged by background interference, high inter-class similarity, and limited labeled data. Existing methods often rely on inefficient cascades or holistic feature extraction, which limits both accuracy and efficiency. To address these issues, we propose a Prompted Complex Context Generation Guided Fine-Grained Ship Recognition framework, consisting of two core modules. The Cross-Attention Context Generation Module utilizes a diffusion model to generate diverse background images from prompts, maintaining target consistency and enriching the training data to mitigate data scarcity. It also employs a cross-attention map to highlight target-relevant regions, guiding the Attention Map Guided Fusion Module. The Attention Map Guided Fusion Module adopts a dual-branch transformer architecture: one branch extracts global features from background-enhanced images, and the other captures local features through attention-guided cropping of target-specific regions. By integrating both global and local features, our method effectively identifies key target characteristics. Experimental results demonstrate that our approach achieves 97.04% accuracy on the publicly available MAR-ships dataset and 84.57% accuracy on the challenging GCS dataset, outperforming state-of-the-art methods.}, archive = {J_ASOC}, author = {Runtian Wang and Kejun Wu and Renjie Qiao and Chunsheng Yang and Chengtao Cai}, doi = {10.1016/j.asoc.2025.113856}, journal = {Applied Soft Computing}, month = {12}, pages = {113856}, shortjournal = {Appl. Soft. Comput.}, title = {Prompted complex context generation guided fine-grained ship recognition}, volume = {185}, year = {2025}, }
• (2025). Genetic algorithm for path-based testing of component outage situations in IoT system processes. ASOC, 185, 113854. (www)

  @article{ , abstract = {Component outages often affect IoT system operations and processes. These components can be physical devices, infrastructure parts, or system modules. Among other possible causes, outages are often due to limited or intermittent network connectivity. To ensure reliable operations, connection outage scenarios must be reviewed systematically, which is especially important for critical systems. Path-based testing techniques are preferable for this task, as they sequence events in the system and, therefore, allow to verify the effects of the limited network connectivity on the system processes. Because the available path-based testing techniques provide only a limited ability to solve this problem effectively, in this study, we propose an adaptation of a genetic algorithm to generate specialized test paths from a model that captures the system under test processes. Compared with the four path-based testing alternatives for solving the testing problem, the proposed algorithm yielded the best results in all four defined test set metrics for the two defined test coverage criteria. Regarding the average total length of the test paths, which served as a proxy for testing costs, those produced by the proposed adapted genetic algorithm outperformed the best of the proposed baselines by 23.5% and 29% for individual test coverage criteria.}, archive = {J_ASOC}, author = {Matej Klima and Miroslav Bures and Bestoun S. Ahmed and Hannan Hindy and Xavier Bellekens and Angelo Gargantini}, doi = {10.1016/j.asoc.2025.113854}, journal = {Applied Soft Computing}, month = {12}, pages = {113854}, shortjournal = {Appl. Soft. Comput.}, title = {Genetic algorithm for path-based testing of component outage situations in IoT system processes}, volume = {185}, year = {2025}, }
• (2025). Multi-label feature selection via asymmetric redundancy and variable precision dependency. ASOC, 185, 113852. (www)

  @article{ , abstract = {Multi-label feature selection is an effective data preprocessing technique that can significantly mitigate the challenges posed by high-dimensional features in multi-label learning. However, the exploration of feature-label correlations has often been strictly limited to inclusion relationships, while ignoring the fusion of local and global label information. Moreover, most previous work has typically assumed that redundancy between features is fully symmetric, overlooking the valuable insights that asymmetric redundancy provides for designing feature selection. To address these issues, this paper proposes a novel multi-label feature selection via asymmetric redundancy and variable precision dependency. Specifically, it constructs a conditional probability model to reflect the local label semantics, incorporating this into the construction of the variable precision dependency through a fusion indicator. Subsequently, the optimistic and pessimistic information overlap between features is discussed, allowing variable precision granularity to capture asymmetric redundancy between features. Building upon this, an information fusion method is proposed to quantify the pessimistic asymmetric redundancy between features by inducing knowledge granularity in the feature space. Finally, a comprehensive evaluation metric, Maximum Correlation-maximum Discrimination-minimum Redundancy (MCDR), is proposed to evaluate the significance of features. The experimental results on fifteen multi-label benchmark datasets indicate that the proposed method outperforms the other seven state-of-the-art methods.}, archive = {J_ASOC}, author = {Wenbin Qian and Xiwen Lu and Shiming Dai and Jintao Huang}, doi = {10.1016/j.asoc.2025.113852}, journal = {Applied Soft Computing}, month = {12}, pages = {113852}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-label feature selection via asymmetric redundancy and variable precision dependency}, volume = {185}, year = {2025}, }
• (2025). A multi-granularity decision tree algorithm based on variable precision rough sets and zentropy. ASOC, 185, 113851. (www)

  @article{ , abstract = {The existing decision tree algorithms often use a single-layer measure to process data, which cannot fully consider the complex interactions and dependencies between different granularity levels. In addition, decision tree algorithms inevitably face the issue of multi-value preference, which may lead to the selection of unreasonable attributes in the process of partition, thereby affecting the performance of the algorithms. Therefore, this paper proposes an improved decision tree algorithm, called Ze-VNDT, which combines variable precision rough sets with Zentropy. First, to avoid the information loss caused by data discretization, this paper introduces variable precision neighborhood rough sets for data processing. Second, by analyzing the granularity level structure within the variable precision neighborhood rough set model, knowledge uncertainty is analyzed from three granularity levels: decision classes, approximate relations, and similarity classes. We describe the uncertain knowledge from the overall to the internal using the idea of going from coarse to fine, and design a Zentropy to measure uncertainty. To address the issue of multi-value preference, an adaptive weighted Zentropy uncertainty measure is designed based on the definition of uncertainty measure based on Zentropy. Third, when constructing the improved decision tree algorithm, the optimal attributes are selected based on the designed uncertainty measure. Finally, numerical experiments on 18 UCI datasets validated the effectiveness and rationality of the proposed algorithm. The experimental results showed that, compared to traditional algorithms and the latest improved algorithms, the proposed algorithm achieved an average accuracy of 94.79%, an average precision of 85.77%, an average recall rate of 84.68%, and an F1-score of 84.97% across the 18 datasets. It ranked first in all five evaluation metrics, demonstrating higher stability and accuracy.}, archive = {J_ASOC}, author = {Hui Dong and Caihui Liu and Xiying Chen and Duoqian Miao}, doi = {10.1016/j.asoc.2025.113851}, journal = {Applied Soft Computing}, month = {12}, pages = {113851}, shortjournal = {Appl. Soft. Comput.}, title = {A multi-granularity decision tree algorithm based on variable precision rough sets and zentropy}, volume = {185}, year = {2025}, }
• (2025). Skin lesion classification with mini-batch sampling and deep metric learning. ASOC, 185, 113850. (www)

  @article{ , abstract = {Skin lesion image classification based on deep learning has recently garnered significant attention. However, directly applying methods that perform well in general computer vision tasks to skin lesion image classification is not ideal, as skin lesion image datasets possess intrinsic characteristics, such as class imbalance, intra-class variability, and inter-class similarity. To tackle these challenges simultaneously, we propose a novel unified learning framework, named mBSML, which integrates mini-batch sampling and deep metric learning. In this framework, mini-batch sampling re-samples data in real-time during each iteration of learning, while a new loss function combines mini-batch distance metric-based loss with cross-entropy loss. Through the alternating training procedure on both imbalanced training data and balanced re-sampling data, mBSML effectively learns from global distribution information and local similarity information, not only from the original dataset but also from the minority classes. Extensive experiments conducted on two publicly available datasets demonstrate the effectiveness of mBSML for skin lesion image classification.}, archive = {J_ASOC}, author = {Shengdan Hu and Zhifei Zhang and Li Ying and Guangming Lang}, doi = {10.1016/j.asoc.2025.113850}, journal = {Applied Soft Computing}, month = {12}, pages = {113850}, shortjournal = {Appl. Soft. Comput.}, title = {Skin lesion classification with mini-batch sampling and deep metric learning}, volume = {185}, year = {2025}, }
• (2025). AOD-YOLO: A self-modulating multi-scale feature aggregation mechanism for small object detection in airport surface scenes. ASOC, 185, 113849. (www)

  @article{ , abstract = {Object detection in airport surface scenes is crucial for enhancing safety. However, the coexistence of objects with significant scale disparities within the same region complicates feature representation, limiting existing models’ ability to capture fine-grained details, especially for small objects. To address this challenge, we propose AOD-YOLO, an Airport Object Detection (AOD) model incorporating a Self-Modulating Multi-Scale Feature Aggregation Mechanism. This model introduces two key innovations: (1) Enhanced Context Modeling: By leveraging large-kernel convolution, frequency-domain modulation, and statistical feature analysis, our approach effectively adjusts feature contributions across different object scales, improving contextual understanding in complex scenes; (2) Optimized Small Object Representation: A dynamic gradient gain allocation strategy refines small-object features, enhancing detection accuracy and overall feature presentation. AOD-YOLO consistently improves performance across model scales. On our self-constructed Airport dataset and the public VisDrone-DET2019 dataset, it achieves mean Average Precision (mAP 0.5 ) of 87.9% and 44.9%, respectively—outperforming state-of-the-art models like YOLOv11 and Gold-YOLO by substantial margins. Additionally, through optimized network module placement, AOD-YOLO achieves 112 FPS, striking a balance between computational efficiency and accuracy, making it well-suited for real-time airport object detection.}, archive = {J_ASOC}, author = {Yingqing Wang and Weili Zeng and Ziyu Zhao and Baogeng Li and Zhibin Quan}, doi = {10.1016/j.asoc.2025.113849}, journal = {Applied Soft Computing}, month = {12}, pages = {113849}, shortjournal = {Appl. Soft. Comput.}, title = {AOD-YOLO: A self-modulating multi-scale feature aggregation mechanism for small object detection in airport surface scenes}, volume = {185}, year = {2025}, }
• (2025). Gloss-free sign language translation based on fusion attention. ASOC, 185, 113848. (www)

  @article{ , abstract = {Sign language translation converts sign language videos into spoken language text. Traditional gloss-based approaches require costly gloss annotations, driving recent interest in gloss-free methods. In this paper, we propose a novel gloss-free sign language translation method based on fusion attention (SLTFA) that uniquely models the intrinsic logical structure of sign language. The key innovation is the development of a dual-attention mechanism that mimics the natural hierarchical structure of sign language: intra-gloss attention captures fine-grained relationships within video frame sequences representing individual semantic units, while inter-gloss attention models the broader contextual connections between these units, similar to how words form coherent sentences. Additionally, we introduce a contrastive loss strategy for cross-modal soft alignment that effectively bridges the gap between visual and textual representations. Extensive experiments on the RWTH-PHOENIX-WEATHER-2014T dataset demonstrate SLTFA’s superior performance, achieving a BLEU-4 score of 16.99 and a ROUGE score of 40.82. On the CSL-Daily dataset, our approach achieves a BLEU-1 score of 25.56 and a ROUGE score of 27.51, demonstrating strong performance across different sign languages.}, archive = {J_ASOC}, author = {Yingchun Xie and Wei Su and Chongliang Zhong and Chuan Cai and Yongna Yuan}, doi = {10.1016/j.asoc.2025.113848}, journal = {Applied Soft Computing}, month = {12}, pages = {113848}, shortjournal = {Appl. Soft. Comput.}, title = {Gloss-free sign language translation based on fusion attention}, volume = {185}, year = {2025}, }
• (2025). An efficient mathematical-based optimization method to optimize multi-hydropower operating rules. ASOC, 185, 113846. (www)

  @article{ , abstract = {Optimizing hydropower multi-reservoir systems requires both effective operating rules and efficient optimization techniques. The main contribution of this paper is offering a unique approach that elegantly combines two important parts: creating an efficient optimization method and developing hydropower operating rules. In this regard, a nonlinear rule curve (NLRC) and a linear rule curve (LRC), are tailored for the coordination of a hydropower multi-reservoir system (HMRS) in Iran. To optimize operating rules, the study fabricates a novel algorithm termed the multi-operator weighted mean of vectors (MINFO). The algorithm combines a powerful global search strategy (GSS) that thoroughly searches the solution space with an efficient local search (LS), striking a balance between solution diversity and convergence speed. To fine-tune this balance, an adaptive parameter-tuning strategy is applied. Furthermore, the active-set sequential quadratic programming (ASQP) serves as a localized escaping operator to enhance the algorithm's convergence speed. The effectiveness of the proposed MINFO algorithm is first evaluated through a nonlinear five-reservoir problem. The findings indicate that the MINFO algorithm outperforms a set of 14 distinct optimization methods. Subsequently, the MINFO algorithm is applied to identify optimal NLRC and LRC for a six-reservoir hydropower system. The results underscore the superiority of optimized NLRC, yielding a potential power augmentation of up to 17 % in comparison to the LRC approach. In summation, this study constitutes a seminal contribution by cultivating an efficient rule curve framework for the management of HMRSs.}, archive = {J_ASOC}, author = {Shuguang Li and Iman Ahmadianfar and Aitazaz A. Farooque and Zaher Mundher Yaseen}, doi = {10.1016/j.asoc.2025.113846}, journal = {Applied Soft Computing}, month = {12}, pages = {113846}, shortjournal = {Appl. Soft. Comput.}, title = {An efficient mathematical-based optimization method to optimize multi-hydropower operating rules}, volume = {185}, year = {2025}, }
• (2025). Advanced YOLOv4 for real-time underwater object detection: An application-oriented approach. ASOC, 185, 113837. (www)

  @article{ , abstract = {Detecting debris and monitoring marine life in sea aquaculture face challenges due to limited visibility and the presence of diverse. Underwater object detection by Autonomous Unmanned Vehicle(AUV) is inherently more challenging than land due to light attenuation and water turbidity, especially for small and dense objects in murky images, where extracting high-quality features is hindered. In this paper, we present an efficient approach for real-time underwater object detection through improvements in image enhancement, data augmentation, and feature aggregation. Initially, U-Shape Transformer is applied to enhance the original images. For data augmentation, it is observable that while Mosaic data augmentation enhances complex images but fails to improve small-object detection due generation of less number of images with small objects. To address this limitation, we propose Underwater-Mosaic (U-Mosaic), a modified Mosaic data augmentation technique designed to enhance small-object detection. Additionally, it was noted that existing YOLOv4 struggles with detecting small and densely populated objects in underwater images as unable to get sufficient features for small objects due to downsampling, image quality and also found difficulty in selecting anchor box size. Therefore, we propose a model called Advanced YOLOv4, tailored for underwater object detection. The proposed Advanced YOLOv4 aims to improve object detection efficiency by altering the neck and prediction layers of YOLOv4. Moreover, we introduce an additional spatial pyramid pooling layer to aggregate features and reduce feature dimensions thereby improving object detection rates. Also, the proposed work concentrates on very large object detection and for this purpose used downsampling during the detection of large objects. The proposed approach is validated through two distinct application areas: (i) detecting and locating debris (ii) detecting fish from underwater images. For validation, the Trash ICRA19 dataset is used for debris detection, while the Brackish dataset is employed for fish detection. UIQM and UCIQE, image enhancement assessment metrics are used to measure quality of enhanced images and found more than 20% better result for both the datasets. The proposed real-time underwater object detection model outperformed single-stage object detectors like YOLOv3, YOLOv4, YOLOv5, YOLOv7, and KPE-YOLOv5 by 5% in terms of mean Average Precision(mAP). Also proposed work compared with two-stage detector RCNN and found 8% better mAP than RCNN.}, archive = {J_ASOC}, author = {Pratima Sarkar and Sourav De and Prasenjit Dey and Sandeep Gurung}, doi = {10.1016/j.asoc.2025.113837}, journal = {Applied Soft Computing}, month = {12}, pages = {113837}, shortjournal = {Appl. Soft. Comput.}, title = {Advanced YOLOv4 for real-time underwater object detection: An application-oriented approach}, volume = {185}, year = {2025}, }
• (2025). Multi-branch and multi-loss learning for fine-grained image retrieval. ASOC, 185, 113833. (www)

  @article{ , abstract = {To effectively address the problem of low accuracy of fine-grained image retrieval due to significant intra-class differences and small inter-class differences, we propose a novel and highly reliable fine-grained deep hashing learning framework dubbed MBLNet to accurately retrieve fine-grained images. Specifically, we propose (i) a dual-selected significant region erasure method for generating compact binary codes for fine-grained images; (ii) a dual filtering object location method for mining discriminative local features; and (iii) a new multi-stage loss function for optimizing network training. We conducted extensive experiments on three fine-grained datasets, Stanford Cars, FGVC-Aircraft, and CUB-200-2011, and achieved mAP results of 89.3%, 87.2%, and 80.6%, respectively. Additionally, the ablation study demonstrates that both the dual-selected significant region erasure method and the dual filtering object location method contribute to the improved accuracy of fine-grained image retrieval, further validating the effectiveness of the proposed method. Code can be found at https://github.com/luhongchun/MBLNet.git .}, archive = {J_ASOC}, author = {Hongchun Lu and Min Han and Songlin He and Xue Li and Chase Wu}, doi = {10.1016/j.asoc.2025.113833}, journal = {Applied Soft Computing}, month = {12}, pages = {113833}, shortjournal = {Appl. Soft. Comput.}, title = {Multi-branch and multi-loss learning for fine-grained image retrieval}, volume = {185}, year = {2025}, }
• (2025). UniCon: Unified image-guiding generation with noise consistency. ASOC, 185, 113832. (www)

  @article{ , abstract = {Diffusion models have demonstrated remarkable capabilities in image-to-image tasks. However, existing methods typically focus either on structural (e.g., layout, content) or stylistic guidance, with few approaches effectively excel at both. On the other hand, many methods require time-consuming fine-tuning or high inference latency, making interactive generation applications challenging to realize. To address these issues, we propose a two-stage framework referred as UniCon ( Uni fied Image-guiding Generation with Noise Con sistency). To improve time efficiency, we follow the paradigm of inversion-based image manipulation and introduce a novel method called Noise Consistency Inversion . Leveraging the nature of Consistency Models, this inversion process is highly efficient, requiring only a single neural function evaluation (NFE) in the inversion process. To achieve high consistency and finer control, we introduce a unified attention-based guidance mechanism that supports structural, stylistic, or joint reference inputs, without any additional fine-tuning. Experiments with structure- and style-specific methods show that our approach performs competitively or better in each individual aspect. In comparison of style transfer tasks that demand both structure and style, our method outperforms state-of-the-art baselines, confirming the effectiveness of our union control strategy. And overall, our approach also achieves the best efficiency in terms of runtime performance.}, archive = {J_ASOC}, author = {Yuanjun Liao and Yuning Gong and Yanci Zhang}, doi = {10.1016/j.asoc.2025.113832}, journal = {Applied Soft Computing}, month = {12}, pages = {113832}, shortjournal = {Appl. Soft. Comput.}, title = {UniCon: Unified image-guiding generation with noise consistency}, volume = {185}, year = {2025}, }
• (2025). Evaluation of the financial performance of the textile and apparel industry in interval type-2 fuzzy environment. ASOC, 185, 113830. (www)

  @article{ , abstract = {The Turkish textile and apparel sector plays a crucial role in the national economy through employment, exports, and investment. The financial performance of companies is a key determinant of their sustainability and competitiveness, especially in global markets. The Turkish textile and apparel sector is one of the essential industries in terms of macro-economic indicators such as net foreign exchange inflow, employment and investment. This sector is also one of the critical actors in world trade. A robust performance evaluation model is essential for stakeholders such as investors, creditors, and managers. However, the assessment of firms is a very critical decision involving uncertainty due to various conflicting criteria based on judgements. In this study, an integrated multi-criteria decision-making (MCDM) model including interval type-2 fuzzy hierarchy process (IT2FAHP) and Compromise Ranking of Alternatives from Distance to Ideal Solution (CRADIS) approaches are proposed to assess the financial performance of Turkish textile and clothing firms that are traded in Borsa İstanbul (BİST) in the period from 2006 to 2020. In line with the determined purpose, the arithmetic average of the determined financial ratios during the analysis period covering 15 years is computed to obtain long-term performance indicators. The importance weights of the selected financial criteria for the performance evaluation model are identified by employing the IT2FAHP approach. Then, the firms are ranked according to their financial performances with the CRADIS method. In addition, the results from the sensitivity analysis validate the proposed approach and prove that it is practical. Moreover, practical and managerial implications are discussed based on the results. The results offer valuable insights for strategic decision-making and can support efforts to enhance financial stability in the textile and apparel sector. According to the results, "LUKSK" had the highest long-term financial performance among the 11 companies discussed. This company is followed by BOSSA, YATAS, and ATEKS companies. The alternatives confirm the robustness of the proposed model in maintaining its place in the ranking in 190 scenarios. In addition, the comparative analysis confirms the consistency of the proposed ranking framework.}, archive = {J_ASOC}, author = {Ömer Faruk Görçün and Mohsin Shabir and Ahmet Çalık and Özcan Işık}, doi = {10.1016/j.asoc.2025.113830}, journal = {Applied Soft Computing}, month = {12}, pages = {113830}, shortjournal = {Appl. Soft. Comput.}, title = {Evaluation of the financial performance of the textile and apparel industry in interval type-2 fuzzy environment}, volume = {185}, year = {2025}, }
• (2025). An interpretable dual-output multivariate wind speed interval prediction scheme using hyper-heuristic optimization algorithm and deep neural networks. ASOC, 185, 113829. (www)

  @article{ , abstract = {Uncertainty analysis of wind speed forecasting using the Lower Upper Bound Estimation (LUBE) represents an advanced interval prediction method that does not require assumptions about data distribution. Previous studies, however, have exclusively focused on univariate prediction models, neglecting the information from other variables, and have not fully exploited the prediction errors in their loss function during training. To address these issues, an interpretable dual-output multivariate wind speed interval prediction scheme (IMWSIPS) that utilizes a hyper-heuristic optimization algorithm and a deep neural network is proposed, along with a novel loss function for training. The system initially takes multiple inputs such as historical wind speed and other influencing factors including wind direction, density, temperature, and pressure into a deep neural network. The actual wind speeds are then scaled up and down by factors of 1 + θ 1 (0 <θ 1 <1) and 1 + θ 2 (-1 <θ 2 <0), respectively, to produce two outputs from the network. On this basis, an optimization problem to minimize interval width under a given coverage probability is formulated and solved using the developed hyper-heuristic algorithm, yielding optimal values for θ 1 and θ 2 and the prediction intervals for sub-models. Subsequently, the advantages of five deep neural network models are leveraged to construct an ensemble model, with weights optimized by the hyper-heuristic algorithm to derive the final prediction intervals. Ultimately, the system's interpretability is analyzed at both variable and sub-model levels. Experimental and discussion results demonstrate that the introduction of IMWSIPS not only signifies enhancements in forecasting performance but also implies improvements in wind energy utilization efficiency and reductions in operational costs for power systems.}, archive = {J_ASOC}, author = {Mengzheng Lv and Jianzhou Wang and Shuai Wang and Yang Zhao and Jialu Gao and Yuansheng Qian}, doi = {10.1016/j.asoc.2025.113829}, journal = {Applied Soft Computing}, month = {12}, pages = {113829}, shortjournal = {Appl. Soft. Comput.}, title = {An interpretable dual-output multivariate wind speed interval prediction scheme using hyper-heuristic optimization algorithm and deep neural networks}, volume = {185}, year = {2025}, }
• (2025). The fuzzified grey wolf: An improved grey wolf optimizer based on dynamic fuzzy system FGWO. ASOC, 185, 113818. (www)

  @article{ , abstract = {The Grey Wolf Optimizer (GWO) is a leading, powerful, and effective algorithm in swarm optimization techniques, showing competitive performance across various optimization problems. Yet, GWO is burdened by high tendencies toward exploitation and imprecise population diversity. This work introduces an improved GWO called the Fuzzified Grey Wolf Optimizer (FGWO) for solving global optimization problems. FGWO benefits from a dynamic fuzzy inference system (DFIS) to capture the optimal value of a → throughout iterations. DFIS integrates two inputs: the diversity rate and iteration number, and by inferring the optimal value of a → , FGOW determines whether to exploit or explore. Moreover, DFIS employs an adaptive membership function to capture the precise value of population diversity throughout the course of iteration. This optimal a → determination strategy can achieve a balanced exploitation–exploration ratio, mitigating premature convergence and enhancing diversity. FGWO is evaluated on CEC2017 benchmark functions, four engineering designs, and a breast cancer genes feature selection design. FGWO was compared with three other improved GWOs, and across all experiments, the outcomes demonstrate its superiority in terms of efficiency and applicability to real-world designed problems.}, archive = {J_ASOC}, author = {Mohammed Dheyaa Algubili and Labiba M. Alhelfi and Hana’ M. Ali}, doi = {10.1016/j.asoc.2025.113818}, journal = {Applied Soft Computing}, month = {12}, pages = {113818}, shortjournal = {Appl. Soft. Comput.}, title = {The fuzzified grey wolf: An improved grey wolf optimizer based on dynamic fuzzy system FGWO}, volume = {185}, year = {2025}, }
• (2025). Fuzzy lagrange interpolation method from summation of interactive fuzzy numbers. ASOC, 185, 113817. (www)

  @article{ , abstract = {This article proposes a novel approach to extending the sum of interactive fuzzy numbers, which is independent of the order of its operands. Interactive fuzzy numbers are fuzzy quantities in which the values across different α -cuts are not assumed to vary independently, incorporating dependencies that better reflect real-world uncertainty. A characterization of the proposed summation is given in terms of α -cuts, making computational implementation easier. It is shown that this operation preserves essential mathematical properties, including associativity. This is particularly important, as it enables the consistent aggregation of multiple fuzzy quantities without concern for the order in which the operands are grouped. The norm and width behaviors under this new summation are also analyzed. To illustrate the theoretical results, several examples are provided. As a practical application, the classical Lagrange polynomial interpolation method is extended to handle uncertain parameters represented by interactive fuzzy numbers. A fuzzy curve fitting problem is examined using this framework, and a comparative discussion highlights the advantages of the proposed method over existing approaches.}, archive = {J_ASOC}, author = {Geizane Lima da Silva and Estevão Esmi and Vinícius Francisco Wasques and Laécio Carvalho de Barros}, doi = {10.1016/j.asoc.2025.113817}, journal = {Applied Soft Computing}, month = {12}, pages = {113817}, shortjournal = {Appl. Soft. Comput.}, title = {Fuzzy lagrange interpolation method from summation of interactive fuzzy numbers}, volume = {185}, year = {2025}, }
• (2025). Decision analytics for indian culinary tourism: A holistic group approach considering correlation. ASOC, 185, 113812. (www)

  @article{ , abstract = {In today’s data-driven world, making informed decisions in dynamic fields like culinary tourism is crucial. An enhanced multi-attribute decision-making (MADM) model is presented in this study to tackle the uncertainty and interdependencies of India’s culinary tourism landscape. The main goals are to (i) address uncertainty and correlations in MADM scenarios, (ii) calculate objective attribute weights, and (iii) resolve conflicts among alternatives based on preference, indifference, and incomparability. To manage uncertainty, the proposed model incorporates r , s -quasirung orthopair fuzzy set ( r , s -QOFS), while to capture relational dynamics among factors Aczel–Alsina operations based geometric Heronian mean operator is developed. Attribute weighting is performed with MEREC (method based on the removal effects of criteria) method, while a modified ORESTE (organísation, rangement et Synthèse dedonnées relarionnelles (in French)) method within the r , s -QOFS is initiated to rank alternatives, introducing a new ranking measure in place of Besson’s traditional rank. Finally, to test the effectiveness and practical value, a case study of culinary tourism destinations across 36 Indian states and union territories is conducted and then ranked using the proposed model. The results highlight southern Indian states as preferred destinations. Thus, this work contributes in two ways: first, by providing a general decision-making model for imprecise and data, and second, by offering valuable insights into the future of Indian culinary tourism.}, archive = {J_ASOC}, author = {Kaushik Debnath and Sankar Kumar Roy}, doi = {10.1016/j.asoc.2025.113812}, journal = {Applied Soft Computing}, month = {12}, pages = {113812}, shortjournal = {Appl. Soft. Comput.}, title = {Decision analytics for indian culinary tourism: A holistic group approach considering correlation}, volume = {185}, year = {2025}, }
• (2025). Bridging the semantic-numerical gap: A numerical reasoning method of cross-modal knowledge graph for material property prediction. ASOC, 185, 113776. (www)

  @article{ , abstract = {Material properties are illustrated by numerical data and semantic factors. In general, existing methods typically adopt machine learning (ML) algorithms to regress numerical properties or transfer other pre-trained knowledge graphs (KGs) to the material, due to the limitations of small-sample datasets. However, integrating semantic and numerical information from multi-modal data which across diverse experimental conditions remains a significant challenge in materials science. In this paper, a numerical reasoning method for material KGs (NR-KG) 1 was proposed, which constructs a cross-modal KG using semantic nodes and numerical proxy nodes. Both types of information by projecting KG into a canonical KG were captured and a graph neural network to predict material properties was utilized. In process, a novel projection prediction loss is proposed to extract semantic features from numerical information. NR-KG facilitates end-to-end processing of cross-modal data, mining relationships and cross-modal information in small-sample datasets, and fully utilizes effective experimental data to enhance the accuracy of material prediction. We propose two new high-entropy alloys (HEA) property datasets with semantic descriptions. NR-KG outperforms state-of-the-art (SOTA) methods on two material datasets, with MSE values of 3520 and 2.210, and achieving relative improvements of 25.9% and 16.1%, respectively, over the second-best methods, KANO and PCHMLP (semantic). It also achieves RMSE values of 0.584 and 0.521 on the FreeSolv and ESOL public molecular datasets, surpassing SOTA methods by 48.8% and 22.2% over KANO, highlighting its potential application and generalizability.}, archive = {J_ASOC}, author = {Guangxuan Song and Dongmei Fu and Zhongwei Qiu and Zijiang Yang and Jiaxin Dai and Lingwei Ma and Dawei Zhang}, doi = {10.1016/j.asoc.2025.113776}, journal = {Applied Soft Computing}, month = {12}, pages = {113776}, shortjournal = {Appl. Soft. Comput.}, title = {Bridging the semantic-numerical gap: A numerical reasoning method of cross-modal knowledge graph for material property prediction}, volume = {185}, year = {2025}, }
• (2025). Transformer-based actor–critic for adaptive cryptocurrency portfolio rebalancing. ASOC, 185, 113697. (www)

  @article{ , abstract = {High-frequency trading in volatile markets, such as cryptocurrencies, requires portfolio models that can swiftly adapt to regime shifts while controlling risk. We propose a novel approach that frames portfolio management as a dynamic strategy-selection problem. Instead of directly predicting asset weights, our agent selects from a pool of expert strategies based on recent market trends. We introduce a Transformer-based Variational Autoencoder (VAE) to extract disentangled trend representations, and a trend-aware actor–critic model to perform expert selection. Experiments demonstrate that this modular, strategy-level control mechanism outperforms existing methods in risk-sensitive crypto portfolio management.}, archive = {J_ASOC}, author = {Ahmad Asadi and Reza Safabakhsh}, doi = {10.1016/j.asoc.2025.113697}, journal = {Applied Soft Computing}, month = {12}, pages = {113697}, shortjournal = {Appl. Soft. Comput.}, title = {Transformer-based actor–critic for adaptive cryptocurrency portfolio rebalancing}, volume = {185}, year = {2025}, }

AUTOM - 77

• (2026). Physics-informed learning-based distributed cooperative tracking control for multiple Euler–Lagrange systems. AUTOM, 183, 112653. (www)

  @article{ , abstract = {This article addresses the robust consensus tracking problem of multiple Euler–Lagrange systems subject to unknown dynamics and disturbances, in which only the root agent can access to the prescribed time-varying trajectory. A network structure that integrates the enhanced gate recurrent unit (GRU) and the physical-informed deep neural network (PI-DNN) is first developed to learn unknown dynamics. A distributed leader state estimator is designed and a distributed PI-DNN-GRU controller with weight adaptive law is further proposed. The closed-loop system is proved to achieve robust asymptotic consensus. Finally, numerical simulations demonstrate the effectiveness and advantages of the proposed method over the existing approaches.}, archive = {J_AUTOM}, author = {Kunfeng Yang and Huiping Li and Panfeng Huang}, doi = {10.1016/j.automatica.2025.112653}, journal = {Automatica}, month = {1}, pages = {112653}, shortjournal = {Automatica}, title = {Physics-informed learning-based distributed cooperative tracking control for multiple Euler–Lagrange systems}, volume = {183}, year = {2026}, }
• (2026). Reachable set estimation for cone-preserving linear systems with constrained exogenous inputs. AUTOM, 183, 112650. (www)

  @article{ , abstract = {This paper focuses on estimating the reachable set of cone-preserving linear systems subject to constrained exogenous inputs. Specifically, the input signal belongs to the space of essentially bounded vector-valued functions equipped with cone linear absolute norms, or to the space of vector-valued functions with the integral of their cone linear absolute norms being bounded. By adopting an auxiliary function composed of the maximum of a set of linear functions with respect to system states, sufficient conditions are provided to ensure that the reachable set is bounded by a given polyhedron. This treatment does not require the auxiliary function to be positive definite, and it is compatible with unstable systems, which shows a significant improvement over existing methods that use Lyapunov functions. Furthermore, we demonstrate that the proposed method is also suitable for delay systems. Finally, simulation examples are presented to verify the effectiveness of the proposed approach.}, archive = {J_AUTOM}, author = {Hongling Qiu and Jun Shen}, doi = {10.1016/j.automatica.2025.112650}, journal = {Automatica}, month = {1}, pages = {112650}, shortjournal = {Automatica}, title = {Reachable set estimation for cone-preserving linear systems with constrained exogenous inputs}, volume = {183}, year = {2026}, }
• (2026). Comment on “Anti-unwinding sliding mode attitude control via two modified rodrigues parameter sets for spacecraft” [Automatica 129 (2021) 109642]. AUTOM, 183, 112646. (www)

  @article{ , abstract = {This correspondence points out a flaw in Dong et al., (2021), making the proposed approach therein doubtful.}, archive = {J_AUTOM}, author = {Yuxin Su}, doi = {10.1016/j.automatica.2025.112646}, journal = {Automatica}, month = {1}, pages = {112646}, shortjournal = {Automatica}, title = {Comment on “Anti-unwinding sliding mode attitude control via two modified rodrigues parameter sets for spacecraft” [Automatica 129 (2021) 109642]}, volume = {183}, year = {2026}, }
• (2026). Unified PID control analysis for time-delay plants. AUTOM, 183, 112644. (www)

  @article{ , abstract = {In this paper, the gradient vector analysis and D-partition are combined to solve the general PID tuning problems for time-delay plants, including nominal stability, region poles placement, and stability margin constraint. This method can simultaneously tune two or three of four parameters: proportional, integral and differential gains as well as time-delay. Two key issues related to the determination of specified region in D-partition method can be solved using gradient analysis: 1. which direction of parameter variation on the boundary will reduce the number of unexpected closed-loop poles; 2. how many unexpected poles will change in the corresponding direction. By analyzing the geometric relationship between gradient vector and boundary, a unified method is developed to directly obtain the gradient vector at any boundary point without complicated calculation, and thus can find the parameter changing direction that can reduce the number of unexpected poles. Finally, the overall algorithm is proposed and two examples are provided to demonstrate the effectiveness of the proposed method. Our code ( Github ) is made publicly available for future researchers.}, archive = {J_AUTOM}, author = {Jiale An and Baitao Tang and Mingwei Sun and Jianhong Zhang and Zengqiang Chen}, doi = {10.1016/j.automatica.2025.112644}, journal = {Automatica}, month = {1}, pages = {112644}, shortjournal = {Automatica}, title = {Unified PID control analysis for time-delay plants}, volume = {183}, year = {2026}, }
• (2026). Distributed multi-time slot power balancing control of power systems with energy storage devices. AUTOM, 183, 112640. (www)

  @article{ , abstract = {This paper studies a crucial problem in power system balancing control, i.e., the multi-time slot economic dispatch (MTSED) problem, for power grids with substantial renewables, synchronous generators (SGs), and energy storage devices (ESDs). The target of MTSED is to optimally coordinate active/reactive power outputs of all controllable units to meet a forecast net demand profile over multiple time slots within a receding finite time horizon. Firstly, the MTSED is formulated as an optimization problem with operational constraints, including the limits on the output of each controllable unit, ramping rates of SGs, energy levels of ESDs, and bus voltages. Then, a novel projection-based algorithm is developed to solve the problem in a distributed way. In particular, the distributed algorithm is not limited to solving the MTSED problem but also applies to more general optimization problems with both generic convex objective functions and hard feasibility constraints. Finally, case studies verify the effectiveness of the proposed method.}, archive = {J_AUTOM}, author = {Luwei Yang and Xiemin Mo and Tao Liu and David J. Hill}, doi = {10.1016/j.automatica.2025.112640}, journal = {Automatica}, month = {1}, pages = {112640}, shortjournal = {Automatica}, title = {Distributed multi-time slot power balancing control of power systems with energy storage devices}, volume = {183}, year = {2026}, }
• (2026). A conditional invertible neural network-based particle filter. AUTOM, 183, 112639. (www)

  @article{ , abstract = {This study proposes a neural network-based approach to improve the efficiency of particle filters. A conditional invertible neural network (CINN) is employed to approximate the optimal proposal distribution in a data-driven manner. The CINN is trained offline to enhance the accuracy of conditional state inference, thereby enabling the generation of high-quality particles and improving the overall filtering performance. During online filtering, the CINN serves as the proposal mechanism for particle updates. The architecture is designed based on two key principles: (1) enabling efficient particle propagation and (2) allowing for closed-form computation of particle weights. The effectiveness of the proposed particle filter framework is validated through three numerical examples.}, archive = {J_AUTOM}, author = {Wenxin Sun and Weili Xiong and Biao Huang and Hongtian Chen}, doi = {10.1016/j.automatica.2025.112639}, journal = {Automatica}, month = {1}, pages = {112639}, shortjournal = {Automatica}, title = {A conditional invertible neural network-based particle filter}, volume = {183}, year = {2026}, }
• (2026). Angle-based formation stabilization and maneuvers in port-hamiltonian form with bearing and velocity measurements. AUTOM, 183, 112638. (www)

  @article{ , abstract = {This paper proposes a port-Hamiltonian approach for angle-based formation stabilization and maneuvers using bearing and velocity measurements with an underlying triangulated Laman graph. The corresponding port-Hamiltonian controller is designed using virtual couplings on the errors of angle constraints in angle space. Then, the angle constraints and agent actuators are mapped by the constraint Jacobian, which can be applied to other formation constraints. In addition, to avoid unavailable distance terms in the control law, an estimator is designed based on port-Hamiltonian theory and the property that energy is coordinate-free for different sensor modalities using bearing and velocity measurements, which permits our framework to inject damping for the formation maneuvers. Furthermore, the stability analysis for several maneuvers is provided. Simulations are performed to illustrate the effectiveness of the approach.}, archive = {J_AUTOM}, author = {Ningbo Li and Pablo Borja and Arjan van der Schaft and Jacquelien M.A. Scherpen}, doi = {10.1016/j.automatica.2025.112638}, journal = {Automatica}, month = {1}, pages = {112638}, shortjournal = {Automatica}, title = {Angle-based formation stabilization and maneuvers in port-hamiltonian form with bearing and velocity measurements}, volume = {183}, year = {2026}, }
• (2026). An alternative paradigm of fault diagnosis in dynamic systems: Orthogonal projection-based methods. AUTOM, 183, 112637. (www)

  @article{ , abstract = {In this paper, a paradigm of fault diagnosis in dynamic systems is proposed as an alternative to the well-established observer-based framework. The basic idea behind this work is to deal with fault detection and isolation by projecting data onto system subspaces in Hilbert space with the aid of orthogonal projection operators and using gap metric for threshold setting. According to the Hilbert Projection Theorem, an orthogonal projection leads to a unique decomposition of the data into nominal and uncertain ones and enables the use of gap metric as the similarity measure. As a result, the projection-based fault diagnosis systems are capable to handle uncertainties and multiplicative faults efficiently, facilitate uniformly addressing residual generation and threshold setting, and deliver optimal fault detectability. As a part of our work, relations to the existing observer-based fault detection systems are investigated. The experimental study on a three-tank system showcases the capability of the proposed projection-based fault diagnosis methods.}, archive = {J_AUTOM}, author = {Steven X. Ding and Linlin Li and Tianyu Liu}, doi = {10.1016/j.automatica.2025.112637}, journal = {Automatica}, month = {1}, pages = {112637}, shortjournal = {Automatica}, title = {An alternative paradigm of fault diagnosis in dynamic systems: Orthogonal projection-based methods}, volume = {183}, year = {2026}, }
• (2026). Congealed neural network design for uncertain nonlinear spatiotemporal control systems. AUTOM, 183, 112636. (www)

  @article{ , abstract = {This note is concerned with the approximation-based adaptive control problem for a class of uncertain nonlinear spatiotemporal systems. A congealed neural network (ConNN) is first proposed to approximate nonlinear spatiotemporal uncertainties arising from system states and time-varying parameters. Unlike conventional NN approximation structures, the ConNN explicitly decomposes the time-varying coupling weight into a congealed weight and a time-dependent perturbation. The congealed weight is estimated using a standard adaptive law for constant parameters, while the residual perturbation is handled within the network structure. To enhance robustness, smooth sliding-mode-like functions are then embedded into the control architecture, effectively attenuating bias terms, particularly in reference tracking scenarios. It is shown that the resulting ConNN-based adaptive controller guarantees adjustable, bounded-error tracking performance, thereby extending the applicability of robust adaptive control to complex spatiotemporal systems and outperforming existing NN-based approaches.}, archive = {J_AUTOM}, author = {Tianrun Liu and Yang-Yang Chen and Xiaohua Ge}, doi = {10.1016/j.automatica.2025.112636}, journal = {Automatica}, month = {1}, pages = {112636}, shortjournal = {Automatica}, title = {Congealed neural network design for uncertain nonlinear spatiotemporal control systems}, volume = {183}, year = {2026}, }
• (2026). Stabilization of feedforward nonlinear time-delay systems with vanishing actuator effectiveness by linear time-varying feedback. AUTOM, 183, 112635. (www)

  @article{ , abstract = {This paper considers the problem of global stabilization for a class of feedforward nonlinear systems in the presence of state delay, uncertain parameters, and vanishing actuator effectiveness. By assuming that the time-delay nonlinear function is unknown but satisfies a linear growth condition with unknown parameters, a state feedback controller incorporating two time-varying parameters is designed. One parameter focuses on compensating for the vanishing actuator effectiveness, while the other addresses uncertain nonlinear terms. The feature of the approach is that the designed controller is linear, and its implementation do not necessitate online computation, thereby significantly conserving computational resources. An example is included to verify the effectiveness of the proposed approaches.}, archive = {J_AUTOM}, author = {Kai Zhang and Bin Zhou}, doi = {10.1016/j.automatica.2025.112635}, journal = {Automatica}, month = {1}, pages = {112635}, shortjournal = {Automatica}, title = {Stabilization of feedforward nonlinear time-delay systems with vanishing actuator effectiveness by linear time-varying feedback}, volume = {183}, year = {2026}, }
• (2026). Distributed safety-critical control of nonlinear multi-agent systems. AUTOM, 183, 112634. (www)

  @article{ , abstract = {This paper considers the safety-critical control problem for nonlinear second-order multi-agent systems with constraints of each agent and inter-agent ones. We overcome the challenge of the time-varying and position-dependent communication network with limited sensing range by introducing a truncated function for the smooth addition and deletion of links in the edge set, and design a distributed and locally Lipschitz-continuous safety-critical control law, composed of a nominal controller for the objectives such as consensus, formation, and position swapping, etc., and a safety controller, which only takes effect when some neighboring agent enters the custom-designed boundary set. Meanwhile, to rigorously verify the safety of the whole multi-agent system, a continuously differentiable control barrier function is proposed under a relaxed feasibility condition in the sense that it is imposed on each subsystem and only needed in the boundary area.}, archive = {J_AUTOM}, author = {Xiaoyu Wang and Yi Dong and Yiguang Hong and Karl Henrik Johansson}, doi = {10.1016/j.automatica.2025.112634}, journal = {Automatica}, month = {1}, pages = {112634}, shortjournal = {Automatica}, title = {Distributed safety-critical control of nonlinear multi-agent systems}, volume = {183}, year = {2026}, }
• (2026). Integral version of Lyapunov–Razumikhin conditions. AUTOM, 183, 112633. (www)

  @article{ , abstract = {For a retarded nonlinear system, this paper proposes a modification of the Lyapunov–Razumikhin method introducing a distributed integral of Lyapunov function for comparison with its current value instead of the maximum over delayed interval. The developed conditions are illustrated on different analysis problems presenting integral Halanay-type inequalities.}, archive = {J_AUTOM}, author = {Jian Wang and Denis Efimov and Alexander Aleksandrov}, doi = {10.1016/j.automatica.2025.112633}, journal = {Automatica}, month = {1}, pages = {112633}, shortjournal = {Automatica}, title = {Integral version of Lyapunov–Razumikhin conditions}, volume = {183}, year = {2026}, }
• (2026). Distributed adaptive fixed-time formation tracking for heterogeneous multi-agent systems. AUTOM, 183, 112632. (www)

  @article{ , abstract = {This article investigates the problem of fixed-time time-varying formation tracking control (FTC) for heterogeneous linear multiagent systems (MASs) under the directed communication graph. It is assumed that the Laplacian matrix associated with the communication graph is unavailable and that the system matrices of the leader are only available to its neighboring followers. This differs from many existing works on fixed-time FTC problems where the communication graphs are typically undirected and protocol designs often rely on certain global information. A novel distributed observer is first put forward to estimate both the state and system matrices of the leader in fixed time. Then, an adaptive scheme is developed to solve the time-varying regulator equations resulting from the estimated leader system matrices in fixed time. Based on the proposed observer and the adaptive solutions to the regulator equations, a distributed adaptive fixed-time FTC protocol is further proposed via coordinate transformation techniques. It is shown that our proposed controllers do not require the input matrices of the followers to be of full row rank. It is also shown that the concerned fixed-time FTC problem can be solved with the proposed fixed-time FTC strategy in a distributed manner. Our results can be directly applied to solve both the adaptive fixed-time cooperative output regulation problem and the leader-following consensus problems of MASs under the directed graph. Finally, the effectiveness of the proposed fixed-time FTC strategy is demonstrated through a numerical example.}, archive = {J_AUTOM}, author = {Shiyu Zhou and Dong Sun and Gang Feng}, doi = {10.1016/j.automatica.2025.112632}, journal = {Automatica}, month = {1}, pages = {112632}, shortjournal = {Automatica}, title = {Distributed adaptive fixed-time formation tracking for heterogeneous multi-agent systems}, volume = {183}, year = {2026}, }
• (2026). Efficient iterative deadlock prevention for flexible manufacturing systems utilizing modified resource requirement graphs. AUTOM, 183, 112631. (www)

  @article{ , abstract = {This article deals with deadlock problems in flexible manufacturing systems (FMSs) modeled by Petri nets. An efficient iterative technique is proposed to synthesize a liveness-enforcing supervisor composed of control places. The main idea behind the proposed approach is to construct at each iteration a digraph representation of a Petri net called a modified resource requirement graph (MR 2 G), which serves as an enhanced version of a resource requirement graph (RRG). The number and type of resources required by a process can be directly obtained from the MR 2 G. Subsequently, an integer linear programming problem (ILPP) is formulated by exploiting the MR 2 G in order to identify a partial deadlock (if any) using an objective function that minimizes the sum of tokens in operation places at the obtained partial deadlock. A place invariant is then designed to compute a control place that prevents the identified partial deadlock from being reached. Due to the insertion of a new control place, it is necessary to augment the MR 2 G accordingly, and iterate (by adding new inequalities to the ILPP and adjusting the existing ones). This iterative process is carried out until no partial deadlock can be identified by the ILPP. The developed approach is computationally competitive and applicable to large-scale systems since both the number of constraints and the number of variables in the ILPP grow only polynomially with the size of the given Petri net model. Several FMS examples illustrate the applicability and effectiveness of the proposed method.}, archive = {J_AUTOM}, author = {Yao Lu and Yufeng Chen and Christoforos N. Hadjicostis and Zhiwu Li}, doi = {10.1016/j.automatica.2025.112631}, journal = {Automatica}, month = {1}, pages = {112631}, shortjournal = {Automatica}, title = {Efficient iterative deadlock prevention for flexible manufacturing systems utilizing modified resource requirement graphs}, volume = {183}, year = {2026}, }
• (2026). Estimation of the minimum and maximum states of charge of lithium-ion battery packs: A hybrid approach. AUTOM, 183, 112630. (www)

  @article{ , abstract = {Monitoring the minimum and maximum states of charge (SOC) in lithium-ion battery packs is key to ensuring safe and reliable long-term operation. The challenge is that these SOCs cannot be directly measured and their corresponding cells within the pack may change with time. This paper proposes a novel hybrid scheme that estimates the minimum and maximum SOCs within a battery pack given by the series interconnection of equivalent circuit models. The estimation scheme relies on a mechanism that determines online two cells, which are candidates for having the minimum and maximum SOCs. The dimension of the hybrid estimator is independent of the number of cells, which makes it particularly attractive for large battery packs. Moreover, the estimator is endowed with robust, global convergence guarantees despite disturbances and measurement noise. Furthermore, Zeno behavior is ruled out as any solution to the considered system is shown to exhibit an average dwell-time. Numerical simulations illustrate the efficiency in terms of accuracy and computational time of the proposed estimator.}, archive = {J_AUTOM}, author = {Mira Khalil and Romain Postoyan and Stéphane Raël and Dragan Nešić}, doi = {10.1016/j.automatica.2025.112630}, journal = {Automatica}, month = {1}, pages = {112630}, shortjournal = {Automatica}, title = {Estimation of the minimum and maximum states of charge of lithium-ion battery packs: A hybrid approach}, volume = {183}, year = {2026}, }
• (2026). Nature-inspired dynamic control for pursuit-evasion of robots. AUTOM, 183, 112629. (www)

  @article{ , abstract = {The pursuit-evasion problem is widespread in nature, engineering, and societal applications. It is commonly observed in nature that predators often exhibit faster speeds than their prey but have less agile maneuverability. Over millions of years of evolution, animals have developed effective and efficient strategies for pursuit and evasion. In this paper, we provide a dynamic framework for the pursuit-evasion problem of unicycle systems, drawing inspiration from nature. First, we address the scenario with one pursuer and one evader by proposing an Alert-Turn control strategy, which consists of two efficient ingredients: a sudden turning maneuver and an alert condition for starting and maintaining the maneuver. We present and analyze the escape and capture results at two levels: a lower level of a single run and a higher level with respect to parameters’ changes. In addition, we provide a theorem with sufficient conditions for capture. The Alert-Turn strategy is then extended to more complex scenarios involving multiple pursuers and evaders by integrating aggregation control laws and a target-changing mechanism. By adjusting a ‘selfish parameter’, the aggregation control commands produce various escape patterns of evaders: cooperative mode, selfish mode, and their combinations. The influence of the selfish parameter is quantified, and the target-changing mechanism is explored from a statistical perspective. Our findings align closely with observations in nature. Finally, the proposed strategies are validated through numerical simulations that replicate some chasing behaviors of animals in nature.}, archive = {J_AUTOM}, author = {Panpan Zhou and Sirui Li and Benyun Zhao and Bo Wahlberg and Xiaoming Hu}, doi = {10.1016/j.automatica.2025.112629}, journal = {Automatica}, month = {1}, pages = {112629}, shortjournal = {Automatica}, title = {Nature-inspired dynamic control for pursuit-evasion of robots}, volume = {183}, year = {2026}, }
• (2026). Event/self-triggered cooperative control via reinforcement learning for a quadrotor team under multiple faults and denial-of-service attacks. AUTOM, 183, 112628. (www)

  @article{ , abstract = {The cooperative fault-tolerant control problem of a quadrotor team, subject to multiple faults and denial-of-service (DoS) attacks, is addressed via event/self-triggered strategies and reinforcement learning. Multiple under-actuated quadrotors with nonlinearities, couplings, and unknown dynamical parameters are introduced to achieve distributed cooperation. Event-triggered observers are developed to estimate position references under uncertain cyber faults and DoS attacks. Observer-based optimal controllers for the nominal position and attitude subsystems are learned by off-policy reinforcement learning without dynamical information. Fault-tolerant controllers are constructed by integrating the learned controllers and adaptive actuator fault compensators. A self-triggered strategy is further proposed to avoid continuous communication. The relationship among the time-varying topology coupled with cyber faults, the features of DoS attacks, and the closed-loop control system stability is analyzed, and the exclusion of Zeno behavior is proved. Simulation results illustrate the effectiveness of the proposed methods.}, archive = {J_AUTOM}, author = {Ziming Ren and Hao Liu and Hongwei Zhang and Ci Chen and Frank L. Lewis}, doi = {10.1016/j.automatica.2025.112628}, journal = {Automatica}, month = {1}, pages = {112628}, shortjournal = {Automatica}, title = {Event/self-triggered cooperative control via reinforcement learning for a quadrotor team under multiple faults and denial-of-service attacks}, volume = {183}, year = {2026}, }
• (2026). Convergence behaviors of nonlinear polar opinion dynamics in cooperative-antagonistic social networks. AUTOM, 183, 112627. (www)

  @article{ , abstract = {This paper investigates two kinds of convergence behaviors of nonlinear polar opinion dynamics over cooperative-antagonistic social networks determined by signed graphs. The first problem studies the neutralization of opinions over strongly connected and structurally unbalanced signed graphs, while the second problem focuses on the containment convergence to external stubborn agents over signed graphs under a variety of connectivity constraints. It is observed that various connectivity conditions induce the common intrinsic property that the involved generalized opposing Laplacian matrix is nonsingular. A stability framework is proposed that addresses both the existence of potential limiting behaviors as well as their convergence properties. This involves an analysis of the positiveness of the (opinion) susceptibility functions. The domains of attraction associated with the convergent behaviors are characterized. The solvability of both problems is provided, and the attracting domains are characterized precisely. The results are applied to blended social networks composed of three specialized opinion models. Simulations and comparisons are provided to illustrate the effectiveness of the paper’s results.}, archive = {J_AUTOM}, author = {Ti-Chung Lee and Ying Zhang and Youfeng Su and Iven Mareels}, doi = {10.1016/j.automatica.2025.112627}, journal = {Automatica}, month = {1}, pages = {112627}, shortjournal = {Automatica}, title = {Convergence behaviors of nonlinear polar opinion dynamics in cooperative-antagonistic social networks}, volume = {183}, year = {2026}, }
• (2026). Linear system analysis and optimal control of natural gas dynamics in pipeline networks. AUTOM, 183, 112626. (www)

  @article{ , abstract = {We design nonlinear and adaptive linear model-predictive control (MPC) techniques to minimize operational costs of compressor-actuated dynamics in natural gas pipeline networks. We establish stability of the local linear system and derive rigorous bounds on error between the nonlinear and linear system solutions. These bounds are used to quantify conditions under which the linear MPC can substitute the nonlinear MPC without significant loss of predictive accuracy. Furthermore, we prove and numerically verify that the computational cost of the linear MPC is orders of magnitude lower than that of solving the baseline optimal control problem. Numerical simulations are performed on nontrivial networks to demonstrate that the proposed MPC can effectively adapt to varying load conditions while maintaining nearly 95% optimality.}, archive = {J_AUTOM}, author = {Luke S. Baker and Sachin Shivakumar and Dieter Armbruster and Rodrigo B. Platte and Anatoly Zlotnik}, doi = {10.1016/j.automatica.2025.112626}, journal = {Automatica}, month = {1}, pages = {112626}, shortjournal = {Automatica}, title = {Linear system analysis and optimal control of natural gas dynamics in pipeline networks}, volume = {183}, year = {2026}, }
• (2026). Adaptive distributed observer design for nonlinear multiagent systems. AUTOM, 183, 112625. (www)

  @article{ , abstract = {Distributed state estimation is crucial for the leader-following control problem of multiagent systems (MASs). In this paper, adaptive distributed observers (DOs) are designed for a nonlinear autonomous leader system using only its output. Via system transformation, the DO design problem of the origin system is converted to that of a canonical system with lumped dynamics. When the lumped dynamics is parametric, an adaptive DO is developed to reconstruct the state and the unknown parameters under an undirected topology, which also addresses the distributed state/parameter estimation problem of an uncertain autonomous system with its dynamics in a parametric form. Then, the DO framework is extended to the case of non-parametric uncertainties, and a neural network (NN) DO is designed for reconstructing the state/lumped dynamics over a strongly connected digraph Finally, the effectiveness of the proposed DOs is demonstrated via numerical simulations.}, archive = {J_AUTOM}, author = {Jixing Lv and Changhong Wang and Lihua Xie}, doi = {10.1016/j.automatica.2025.112625}, journal = {Automatica}, month = {1}, pages = {112625}, shortjournal = {Automatica}, title = {Adaptive distributed observer design for nonlinear multiagent systems}, volume = {183}, year = {2026}, }
• (2026). Simple sufficient conditions for integer stabilizability of discrete-time systems with relative degree one. AUTOM, 183, 112624. (www)

  @article{ , abstract = {In this paper, firstly the concept of integer stabilizability is defined. It is discussed that the main motivation for introducing this concept is its helpfulness in achieving homomorphic encrypted control systems involving no computational overflow. Then, some simple sufficient conditions to ensure integer stabilizability of discrete-time systems described by transfer functions with relative degree one are derived. The usefulness of achievements of the paper is verified by a numerical example.}, archive = {J_AUTOM}, author = {Mohammad Saleh Tavazoei}, doi = {10.1016/j.automatica.2025.112624}, journal = {Automatica}, month = {1}, pages = {112624}, shortjournal = {Automatica}, title = {Simple sufficient conditions for integer stabilizability of discrete-time systems with relative degree one}, volume = {183}, year = {2026}, }
• (2026). A novel switching rule to observer-based control for switched systems. AUTOM, 183, 112622. (www)

  @article{ , abstract = {This study explores observer-based control for switched systems subject to partially unknown sojourn probability information. To more accurately capture the dynamic nature of switched systems, a novel switching rule related to duration time is devised, in which the system switching is governed by a joint distribution function. This function uniquely integrates both the current system mode and its duration, effectively addressing the challenges of incompleteness in probability information. Distinct from the conventional semi-Markov kernel technique, the sojourn probabilities involve fewer parameters and can be more readily measured using statistical techniques, thereby lessening computational burden. Additionally, a non-monotonic Lyapunov function is constructed, leading to less conservative conditions that ensure the mean-square stability of the switched systems. Eventually, the effectiveness and superiority of the devised methodology are verified through a practical example.}, archive = {J_AUTOM}, author = {Jun Cheng and Tianfeng Tang and Huaicheng Yan and Zheng-Guang Wu and Dan Zhang}, doi = {10.1016/j.automatica.2025.112622}, journal = {Automatica}, month = {1}, pages = {112622}, shortjournal = {Automatica}, title = {A novel switching rule to observer-based control for switched systems}, volume = {183}, year = {2026}, }
• (2026). Sampled-data primal–dual gradient dynamics in model predictive control. AUTOM, 183, 112621. (www)

  @article{ , abstract = {Model predictive control (MPC) can incur computational burden that exceeds what the application warrants, sometimes even for linear systems. Recently, a rapid computation method that guides the input toward convergence with the optimal control problem solution by employing primal–dual gradient (PDG) dynamics has been proposed for linear MPCs. However, stability has been ensured under the assumption that the controller is a continuous-time system, leading to potential instability when the controller undergoes discretization and is implemented as a sampled-data system. In this paper, we propose a discrete-time dynamical controller incorporating specific modifications to the PDG approach and present stability conditions. Additionally, we introduce an extension to enhance control performance that was traded off in the original. Numerical examples substantiate that our proposed method, which can be executed in only 1 μ s on a commodity laptop, not only ensures stability considering sampled-data implementation but also substantially enhances the control performance.}, archive = {J_AUTOM}, author = {Ryuta Moriyasu and Sho Kawaguchi and Kenji Kashima}, doi = {10.1016/j.automatica.2025.112621}, journal = {Automatica}, month = {1}, pages = {112621}, shortjournal = {Automatica}, title = {Sampled-data primal–dual gradient dynamics in model predictive control}, volume = {183}, year = {2026}, }
• (2026). Cooperative dynamic surrounding coverage control for multi-autonomous surface vehicle fleets with limited sensing ranges. AUTOM, 183, 112620. (www)

  @article{ , abstract = {Cooperative surrounding coverage by a multi-autonomous surface vehicle (ASV) fleet involves dynamic coverage with concentric moving trajectories. This low-cost form of coverage, which operates with limited perceptual ranges, has long presented a significant challenge in real-world collective marine detection applications. To this end, the paper establishes a surrounding coverage control framework that minimizes the required number of ASVs by covering a designated region across multiple consecutive periods. A distributed randomized gradient-free (DRGF) protocol is thereby proposed to identify the optimal central point of the coverage region. Accordingly, a distributed control law is designed to regulate the ASV dynamic surrounding coverage operation around the optimal concentric point. Significantly, sufficient conditions are derived to guarantee the asymptotical convergence of the closed-loop multi-ASV fleet governed by the present DGRF. Finally, experiments are conducted on a self-established lake-based multi-ASV fleet platform to verify the effectiveness of the present surrounding coverage scheme.}, archive = {J_AUTOM}, author = {Jiayu Zou and Hai-Tao Zhang and Bin Liu and Xiaohua Liu and Jianing Ding and Ning Xing and Shiqi Fu and Lijun Zhu}, doi = {10.1016/j.automatica.2025.112620}, journal = {Automatica}, month = {1}, pages = {112620}, shortjournal = {Automatica}, title = {Cooperative dynamic surrounding coverage control for multi-autonomous surface vehicle fleets with limited sensing ranges}, volume = {183}, year = {2026}, }
• (2026). Asynchronous resilient collision-free formation control for nonlinear MASs under DoS attacks. AUTOM, 183, 112619. (www)

  @article{ , abstract = {The multi-agent systems (MASs) exchange the communication information by the communication network, which is vulnerable to denial-of-service (DoS) attacks. DoS attacks can disrupt the communication channels and result in the collisions between agents, thus it is an important and challenging topic to study the collision avoidance formation control issue under DoS attacks. This paper investigates the asynchronous resilient collision-free formation control issue for nonlinear MASs with DoS attacks. An asynchronous resilient distributed observer is proposed to estimate the output information of leader under DoS attacks. Based on the designed distributed observer and by constructing two high-order filters, an asynchronous resilient collision-free formation control method is presented by backstepping control design theory. The presented formation control method can ensure that the formation tracking errors asymptotically converge to zero, and the collision avoidance objective is realized. Moreover, the non-differentiable problem of virtual controllers is solved. Finally, we apply the developed formation control method to multiple Euler-Lagrangian (EL) systems, the simulation and comparison results verify its effectiveness.}, archive = {J_AUTOM}, author = {Jun Zhang and Jun Ning and Shaocheng Tong}, doi = {10.1016/j.automatica.2025.112619}, journal = {Automatica}, month = {1}, pages = {112619}, shortjournal = {Automatica}, title = {Asynchronous resilient collision-free formation control for nonlinear MASs under DoS attacks}, volume = {183}, year = {2026}, }
• (2026). Sector stabilization criterion of a novel nonlinear flexible marine riser coupled system. AUTOM, 183, 112618. (www)

  @article{ , abstract = {This paper establishes a sector stabilization criterion for a nonlinear flexible marine riser system that incorporates lateral and transverse coupling vibrations, derived from Hamilton’s principle. This criterion, grounded in the sector-bounded condition, encompasses a wide range of linear and nonlinear feedback control laws applied to the transverse and lateral directions at the top boundary of the flexible marine riser, respectively. In the analysis, the nonlinear semigroup theory is utilized to establish the well-posedness of the resulting closed-loop coupled system. Notably, the solution demonstrates continuous dependence on the initial conditions. Furthermore, the exponential stability of the closed-loop coupled system is achieved by employing a generalized Gronwall-type integral inequality and the integral multiplier method, which involves the innovative development of an energy-like functional. To demonstrate the effectiveness of the proposed controls, numerical simulations utilizing the finite element method are presented.}, archive = {J_AUTOM}, author = {Yi Cheng and Xin Wang and Yuhu Wu and Bao-Zhu Guo}, doi = {10.1016/j.automatica.2025.112618}, journal = {Automatica}, month = {1}, pages = {112618}, shortjournal = {Automatica}, title = {Sector stabilization criterion of a novel nonlinear flexible marine riser coupled system}, volume = {183}, year = {2026}, }
• (2026). Global exponential stabilization of 2 × 2 linear hyperbolic PDEs via dynamic event-triggered backstepping control. AUTOM, 183, 112617. (www)

  @article{ , abstract = {This paper introduces novel dynamic event-triggered control (ETC) mechanisms for 2 × 2 linear hyperbolic PDEs in three configurations: continuous-time event-triggered control (CETC), periodic event-triggered control (PETC), and self-triggered control (STC). These mechanisms ensure global exponential stability (GES) under ETC using PDE backstepping, with stability estimates provided in the spatial L 2 norm of the states. The proposed CETC and PETC designs are observer-based and require continuous boundary measurements collocated with the actuation. In contrast, the STC design requires full-state measurements; however, unlike CETC and PETC, it does not require continuous measurements for the triggering mechanism—only measurements taken at event times. In the CETC design, a lower bound on the time between two consecutive events is enforced, and a dynamic variable with appropriately designed switching dynamics is introduced. By employing a novel Lyapunov functional, GES of the closed-loop system is established under zero-order hold implementation of the backstepping control between events. Events are triggered when the dynamic variable crosses zero from the positive side, after which it is immediately reset to an appropriate nonnegative value. Detecting events, therefore, necessitates continuous monitoring of this dynamic variable. To address this limitation, PETC and STC strategies are proposed. The PETC design identifies a suitable triggering condition that requires only periodic checks and derives an upper bound on the allowable sampling period. This PETC approach preserves the GES guaranteed by CETC without requiring continuous monitoring of a triggering condition, although it still relies on continuous measurements. Unlike CETC and PETC, STC requires neither continuous measurements nor monitoring of a triggering condition. Instead, at each event, STC computes the time to the next event — beyond a suitably enforced minimal dwell-time — using only measurements taken at events. Despite relying solely on event-triggered measurements, STC is capable of guaranteeing GES of the closed-loop system. The well-posedness of the closed-loop systems under all three strategies is established. A simulation study is provided to illustrate the theoretical results.}, archive = {J_AUTOM}, author = {Bhathiya Rathnayake and Mamadou Diagne}, doi = {10.1016/j.automatica.2025.112617}, journal = {Automatica}, month = {1}, pages = {112617}, shortjournal = {Automatica}, title = {Global exponential stabilization of 2 × 2 linear hyperbolic PDEs via dynamic event-triggered backstepping control}, volume = {183}, year = {2026}, }
• (2026). Signal temporal logic control synthesis among uncontrollable dynamic agents with conformal prediction. AUTOM, 183, 112616. (www)

  @article{ , abstract = {The control of dynamical systems under temporal logic specifications among uncontrollable dynamic agents is challenging due to the agents’ a-priori unknown behavior. Existing works have considered the problem where either all agents are controllable, the agent models are deterministic and known, or no safety guarantees are provided. We propose a predictive control synthesis framework that guarantees, with high probability, the satisfaction of signal temporal logic (STL) tasks that are defined over a controllable system in the presence of uncontrollable stochastic agents. We use trajectory predictors and conformal prediction to construct probabilistic prediction regions for each uncontrollable agent that are valid over multiple future time steps. Specifically, we construct a normalized prediction region over all agents and time steps to reduce conservatism and increase data efficiency. We then formulate a worst-case bilevel mixed integer program (MIP) that accounts for all agent realizations within the prediction region to obtain an open-loop controller that provably guarantee task satisfaction with high probability. To efficiently solve this bilevel MIP, we propose an equivalent MIP program based on KKT conditions of the original bilevel formulation. Building upon this, we design a closed-loop controller, where both recursive feasibility and task satisfaction can be guaranteed with high probability. We illustrate our control synthesis framework on two case studies.}, archive = {J_AUTOM}, author = {Xinyi Yu and Yiqi Zhao and Xiang Yin and Lars Lindemann}, doi = {10.1016/j.automatica.2025.112616}, journal = {Automatica}, month = {1}, pages = {112616}, shortjournal = {Automatica}, title = {Signal temporal logic control synthesis among uncontrollable dynamic agents with conformal prediction}, volume = {183}, year = {2026}, }
• (2026). Event-triggered boundary estimation for 2 × 2 hyperbolic PDEs with disturbance. AUTOM, 183, 112615. (www)

  @article{ , abstract = {This paper addresses the event-triggered boundary estimation problem for 2 × 2 linear hyperbolic partial differential equations (PDEs) subject to disturbances. These disturbances enter the PDEs through the boundary and are represented as an ordinary differential equation (ODE). The scenario considered involves transmitting boundary measurements to the observer only when necessary, as determined by a dynamic event-triggering condition. This approach aims to conserve communication and computational resources. The event-triggered observer is designed using the backstepping method, and an event-triggering condition is proposed to determine the time instants when sampled measurements should be transmitted. Under this event-triggered estimation mechanism, a minimal dwell-time between consecutive triggering time instants is guaranteed. Furthermore, the well-posedness of the solutions and the exponential convergence of the estimation error are ensured. Finally, the obtained results are applied to the Saint-Venant equations to demonstrate the effectiveness of the event-triggered estimation method.}, archive = {J_AUTOM}, author = {Yan Zhao and Rafael Vazquez}, doi = {10.1016/j.automatica.2025.112615}, journal = {Automatica}, month = {1}, pages = {112615}, shortjournal = {Automatica}, title = {Event-triggered boundary estimation for 2 × 2 hyperbolic PDEs with disturbance}, volume = {183}, year = {2026}, }
• (2026). Distributed data-driven unknown-input observers. AUTOM, 183, 112614. (www)

  @article{ , abstract = {Unknown inputs related to, e.g., sensor aging, modeling errors, or device bias, represent a major concern in wireless sensor networks, as they degrade the state estimation performance. To improve the performance, unknown-input observers (UIOs) have been proposed. Most of the results available to design UIOs are based on explicit system models, which can be difficult or impossible to obtain in real-world applications. Data-driven techniques, on the other hand, have become a viable alternative for the design and analysis of unknown systems using only data. In this context, a novel data-driven distributed unknown-input observer (D-DUIO) for unknown continuous-time linear time-invariant (LTI) systems is developed, which requires solely some data collected offline, without any prior knowledge of the system matrices. In the paper, first, a model-based approach to the design of a DUIO is presented. A sufficient condition for the existence of such a DUIO is recalled, and a new one is proposed, that is prone to a data-driven adaptation. Moving to a data-driven approach, it is shown that under suitable assumptions on the input/output/state data collected from the continuous-time system, it is possible to both claim the existence of a D-DUIO and to derive its matrices in terms of the matrices of pre-collected data. Finally, the efficacy of the D-DUIO is illustrated by means of numerical examples.}, archive = {J_AUTOM}, author = {Yuzhou Wei and Giorgia Disarò and Wenjie Liu and Jian Sun and Maria Elena Valcher and Gang Wang}, doi = {10.1016/j.automatica.2025.112614}, journal = {Automatica}, month = {1}, pages = {112614}, shortjournal = {Automatica}, title = {Distributed data-driven unknown-input observers}, volume = {183}, year = {2026}, }
• (2026). Robustness of supervisory controllers subject to measurement disturbances. AUTOM, 183, 112613. (www)

  @article{ , abstract = {This paper studies the supervisory control problem for a class of uncertain nonlinearly parameterized systems in the presence of measurement disturbance. Based on the well-established estimator-based supervisory control structure, a robustification of supervisory controller dealing with measurement disturbance is developed taking advantage of the monitoring signals redesign, such that the plant state asymptotically converges to a given set-point or its neighborhood, subject to the vanishing or the persistent measurement disturbance, respectively. Moreover, a constructive design of the multi-estimator using measurement feedback is proposed for the supervisory control of a class of uncertain nonlinearly parameterized systems in the strict-feedback form. A numerical simulation based on an uncertain mass–spring system is given to show the efficacy of our proposed algorithm, in which we use an event-trigger to be a measurement disturbance generator.}, archive = {J_AUTOM}, author = {Yutian Wang and Qingkai Meng and Yi Jiang}, doi = {10.1016/j.automatica.2025.112613}, journal = {Automatica}, month = {1}, pages = {112613}, shortjournal = {Automatica}, title = {Robustness of supervisory controllers subject to measurement disturbances}, volume = {183}, year = {2026}, }
• (2026). Data-driven min–max MPC for linear systems: Robustness and adaptation. AUTOM, 183, 112612. (www)

  @article{ , abstract = {Data-driven controllers design is an important research problem, in particular when data is corrupted by the noise. In this paper, we propose a data-driven min–max model predictive control (MPC) scheme using noisy input-state data for unknown linear time-invariant (LTI) system. The unknown system matrices are characterized by a set-membership representation using the noisy input-state data. Leveraging this representation, we derive an upper bound on the worst-case cost and determine the corresponding optimal state-feedback control law through a semidefinite program (SDP). We prove that the resulting closed-loop system is robustly stabilized and satisfies the input and state constraints. Further, we propose an adaptive data-driven min–max MPC scheme which exploits additional online input-state data to improve closed-loop performance. Numerical examples show the effectiveness of the proposed methods.}, archive = {J_AUTOM}, author = {Yifan Xie and Julian Berberich and Frank Allgöwer}, doi = {10.1016/j.automatica.2025.112612}, journal = {Automatica}, month = {1}, pages = {112612}, shortjournal = {Automatica}, title = {Data-driven min–max MPC for linear systems: Robustness and adaptation}, volume = {183}, year = {2026}, }
• (2026). Local practically safe extremum seeking with assignable rate of attractivity to the safe set. AUTOM, 183, 112611. (www)

  @article{ , abstract = {We present Assignably Safe Extremum Seeking (ASfES), an algorithm designed to minimize a measured, static objective function while maintaining a measured, static metric of safety (a control barrier function or CBF) to be positive in a practical sense. We ensure that for trajectories with safe initial conditions, the violation of safety can be made arbitrarily small through appropriately chosen design constants. We also guarantee an assignable “attractivity” rate: from unsafe initial conditions, the trajectories approach the safe set, in the sense of the measured CBF, at a rate no slower than a user-assigned rate. Similarly, from safe initial conditions, the trajectories approach the unsafe set, in the sense of the CBF, no faster than the assigned attractivity rate. The feature of assignable attractivity is not present in the semiglobal version of safe extremum seeking, where the semiglobality of convergence is achieved by slowing the adaptation. We also demonstrate local convergence of the parameter to a neighborhood of the minimum of a quadratic objective function constrained to the safe set with a linear CBF. The ASfES algorithm and analysis are multivariable, but we also extend the algorithm to a Newton-Based ASfES scheme which we show is only useful in the scalar case. The proven properties of the designs are illustrated through simulation examples.}, archive = {J_AUTOM}, author = {Alan Williams and Miroslav Krstic and Alexander Scheinker}, doi = {10.1016/j.automatica.2025.112611}, journal = {Automatica}, month = {1}, pages = {112611}, shortjournal = {Automatica}, title = {Local practically safe extremum seeking with assignable rate of attractivity to the safe set}, volume = {183}, year = {2026}, }
• (2026). Secondary safety control for systems with sector bounded nonlinearities. AUTOM, 183, 112610. (www)

  @article{ , abstract = {We consider the problem of safety verification and safety-aware controller synthesis for systems with sector bounded nonlinearities. We aim to keep the states of the system within a given safe set under potential actuator and sensor attacks. Specifically, we adopt the setup that a controller has already been designed to stabilize the plant. Using invariant sets and barrier certificate theory, we first give sufficient conditions to verify the safety of the closed-loop system under attacks. Furthermore, by using a subset of sensors that are assumed to be free of attacks, we provide a synthesis method for a secondary controller that enhances the safety of the system. The sufficient conditions to verify safety are derived using Lyapunov-based tools and the S -procedure. Using the projection lemma, the conditions are then formulated as linear matrix inequality (LMI) problems which can be solved efficiently. Lastly, our theoretical results are illustrated through numerical simulations.}, archive = {J_AUTOM}, author = {Yankai Lin and Michelle S. Chong and Carlos Murguia}, doi = {10.1016/j.automatica.2025.112610}, journal = {Automatica}, month = {1}, pages = {112610}, shortjournal = {Automatica}, title = {Secondary safety control for systems with sector bounded nonlinearities}, volume = {183}, year = {2026}, }
• (2026). Optimal control of continuous-time symmetric systems with unknown dynamics and noisy measurements. AUTOM, 183, 112609. (www)

  @article{ , abstract = {An iterative learning algorithm is presented for continuous-time linear–quadratic optimal control problems where the system is externally symmetric with unknown dynamics. Both finite-horizon and infinite-horizon problems are considered. It is shown that the proposed algorithm is globally convergent to the optimal solution and has some advantages over adaptive dynamic programming, including unbiased performance under noisy measurements, relatively low computational burden, and no requirement for exploration noise. Numerical experiments show the effectiveness of the results.}, archive = {J_AUTOM}, author = {Hamed Taghavian and Florian Dörfler and Mikael Johansson}, doi = {10.1016/j.automatica.2025.112609}, journal = {Automatica}, month = {1}, pages = {112609}, shortjournal = {Automatica}, title = {Optimal control of continuous-time symmetric systems with unknown dynamics and noisy measurements}, volume = {183}, year = {2026}, }
• (2026). Non-parametric IQC multipliers in data-driven robust controller synthesis. AUTOM, 183, 112608. (www)

  @article{ , abstract = {The paper presents a robust data-driven controller synthesis method for generalised multi-input multi-output (MIMO) systems. Using the frequency response of a linear time-invariant (LTI) MIMO system and characterising perturbations through Integral Quadratic Constraint (IQC), the method provides a convex set of controllers robust to perturbations. This facilitates the design of controllers with either robust stability or robust performance criteria. Notably, the proposed method is versatile, as it is also applicable for non-parametric IQC multipliers. An example of a non-parametric IQC multiplier for elliptical uncertainty quantification is demonstrated and subsequently employed in designing a robust controller for a hybrid active-passive micro-vibration platform. Experimental results show that the synthesised controller effectively achieves the desired levels of both robustness and performance.}, archive = {J_AUTOM}, author = {Vaibhav Gupta and Elias Klauser and Alireza Karimi}, doi = {10.1016/j.automatica.2025.112608}, journal = {Automatica}, month = {1}, pages = {112608}, shortjournal = {Automatica}, title = {Non-parametric IQC multipliers in data-driven robust controller synthesis}, volume = {183}, year = {2026}, }
• (2026). Iterative learning control for performance-driven switched systems under all unknown channel gains. AUTOM, 183, 112607. (www)

  @article{ , abstract = {Fading channels introduce random and unknown gains into signal transmission, which has a great impact on the accuracy of the transmitted data, thus affecting system stability. However, there are few studies on this regard in the control field. In this paper, the transmission of both feedback and switching signals is affected by the unknown channel gains, which induces severe mode asynchronization in the switched systems under iterative learning control (ILC). For the faded switching signals, by designing a calibration-rounding mechanism (CRM) to recover it, the asynchronous time can gradually decrease with the iteration, and finally the system achieves synchronization, that is calibration-rounding-based iterative synchronization (CRIS). For the faded feedback signals, an improved gain estimation mechanism (IGEM) is given to correct the signal faster with fewer iterations. Moreover, a novel tracking performance-driven switching law (TPD-SL) is proposed to reasonably schedule subsystems for obtaining optimal performance. A set of new average dwell time (ADT) conditions with the minimum synchronization time is obtained. Finally, the effectiveness of the method is verified by numerical simulations.}, archive = {J_AUTOM}, author = {Yiwen Qi and Ziyu Qu and Dong Shen}, doi = {10.1016/j.automatica.2025.112607}, journal = {Automatica}, month = {1}, pages = {112607}, shortjournal = {Automatica}, title = {Iterative learning control for performance-driven switched systems under all unknown channel gains}, volume = {183}, year = {2026}, }
• (2026). Induced norm analysis of linear systems for nonnegative input signals. AUTOM, 183, 112606. (www)

  @article{ , abstract = {This paper is concerned with the analysis of the L p ( p ∈ [ 1 , ∞ ) , p = ∞ ) induced norms of continuous-time linear systems where input signals are restricted to be nonnegative. This norm is referred to as the L p + induced norm in this paper. It has been shown recently that the L 2 + induced norm is effective for the stability analysis of nonlinear feedback systems where the nonlinearity returns only nonnegative signals. However, the exact computation of the L 2 + induced norm is essentially difficult. To get around this difficulty, in the first part of this paper, we provide a copositive-programming-based method for the upper bound computation by capturing the nonnegativity of the input signals by copositive multipliers. In the second part, we consider how far the L 2 + induced norm can be smaller than the standard L 2 induced norm, and derive the uniform infimum on the ratio of the L 2 + induced norm to the L 2 induced norm over all linear systems including infinite-dimensional ones. Then, for each linear system, we finally derive a computation method of the lower bounds of the L 2 + induced norm that are larger than (or equal to) the value determined by the uniform infimum. The effectiveness of the upper/lower bound computation methods is illustrated by numerical examples.}, archive = {J_AUTOM}, author = {Yoshio Ebihara and Noboru Sebe and Hayato Waki and Dimitri Peaucelle and Sophie Tarbouriech and Victor Magron and Tomomichi Hagiwara}, doi = {10.1016/j.automatica.2025.112606}, journal = {Automatica}, month = {1}, pages = {112606}, shortjournal = {Automatica}, title = {Induced norm analysis of linear systems for nonnegative input signals}, volume = {183}, year = {2026}, }
• (2026). Distributed fault-tolerant control for a class of uncertain cascaded ODE-PDE multi-agent systems. AUTOM, 183, 112605. (www)

  @article{ , abstract = {In this paper, a distributed fault-tolerant control is proposed for a class of uncertain cascaded ordinary differential equation (ODE)-partial differential equation (PDE) multi-agents. For the cascaded system under consideration, the output of ODEs serves as the input signal of PDEs such that a distributed control involving states of the ODE as well as the PDE system is expected to be designed for consensus tracking. Based on the designed distributed control, where the actuator is assumed to be healthy, a distributed fault-tolerant control is designed to guarantee the performance of the system, and it is further improved to deal with actuator failures. To enhance the robustness of the cascaded system, the system uncertainties and the external disturbances of both followers and leader are compensated using adaptive laws and an adaptive distributed observer, based on which the stabilization of the cascaded ODE-PDE multi-agent system can be achieved with partially known agents’ information. Simulation results are carried out to prove the effectiveness of the proposed method.}, archive = {J_AUTOM}, author = {Xueyan Xing and Guoqiang Hu}, doi = {10.1016/j.automatica.2025.112605}, journal = {Automatica}, month = {1}, pages = {112605}, shortjournal = {Automatica}, title = {Distributed fault-tolerant control for a class of uncertain cascaded ODE-PDE multi-agent systems}, volume = {183}, year = {2026}, }
• (2026). A compensation-oriented algorithm for difference-driven identification under binary-valued observations and data packet dropout. AUTOM, 183, 112604. (www)

  @article{ , abstract = {This paper investigates the identification problem for finite impulse response (FIR) systems with binary-valued observations under event-triggered communication mechanism and data packet dropout. The challenge lies in the inability to distinguish between untriggered events and packet loss when no information is received, which prevents us from obtaining the statistical properties of the binary-valued sequence. A compensation-oriented difference-driven identification (CODD) algorithm is proposed to estimate the parameter by recovering the mean of the original binary-valued sequence, where different values for the observation estimates are assigned when receiving 0, 1 or nothing. Even though, the convergence analysis of the parameter estimate is still challenging since the assigned values are dependent. To tackle this difficulty, the estimate error is divided into two parts: an initial assigned value related part, which is demonstrated to be convergent through the construction of an auxiliary set, and the remaining component, which happens to be a convergent martingale-difference sequence. As a result, the almost sure convergence and the asymptotic normality of the CODD algorithm are established when data packet loss probability is less than 1 2 . By calculating the communication rate, it is proven that the difference-driven mechanism can save 50% of the communication cost compared to original binary-valued systems. Furthermore, when data packet loss probability is high, an m -channel compensation-oriented identification ( m -CODD) algorithm is constructed by utilizing retransmission of the each observation for m times, which is designed based on the packet loss probability. The properties of m -CODD algorithm including convergence, asymptotic normality and communication rate are established. Numerical simulations are illustrated to show the theoretical results.}, archive = {J_AUTOM}, author = {Tianning Han and Ying Wang and Jin Guo and Yanlong Zhao}, doi = {10.1016/j.automatica.2025.112604}, journal = {Automatica}, month = {1}, pages = {112604}, shortjournal = {Automatica}, title = {A compensation-oriented algorithm for difference-driven identification under binary-valued observations and data packet dropout}, volume = {183}, year = {2026}, }
• (2026). Distributed nash equilibrium seeking for aggregative games of linear systems subject to unknown disturbances. AUTOM, 183, 112603. (www)

  @article{ , abstract = {In this paper, we address the distributed Nash equilibrium seeking problem for aggregative games of N players subject to unknown disturbances over strongly connected networks. Compared with existing works, the general linear dynamics, general directed and strongly connected networks, as well as unknown disturbances are tackled simultaneously in the aggregative games. First, by introducing certain coordinate transformation and feedback linearization method, we develop a distributed gradient-based Nash equilibrium seeking law. A dynamic average consensus dynamics is designed to deal with the challenge by unbalance of general strongly connected networks. By the graph-related property and converse Lyapunov theorem, we establish the global exponential stability of a linear system and a class of nonlinear systems, respectively. Then, we propose a gain design method to obtain the stability of the nonlinear closed-loop system, which is not in the lower triangular form. Inspired by the output regulation theory, we design an internal model and an adaptive dynamics to tackle the unknown disturbances. Resorting to the perturbation theory and the internal model principle, we demonstrate that distributed Nash equilibrium seeking for aggregative games of N players with general linear systems subject to unknown disturbances over strongly connected networks can be achieved. Finally, the effectiveness of the proposed distributed Nash equilibrium seeking approaches are verified by their applications to some simulation examples.}, archive = {J_AUTOM}, author = {Lupeng Liu and Fang Deng and Jie Chen and Maobin Lu}, doi = {10.1016/j.automatica.2025.112603}, journal = {Automatica}, month = {1}, pages = {112603}, shortjournal = {Automatica}, title = {Distributed nash equilibrium seeking for aggregative games of linear systems subject to unknown disturbances}, volume = {183}, year = {2026}, }
• (2026). Adaptive fault-tolerant control of nonlinear systems: A self-regulating spatiotemporal performance approach. AUTOM, 183, 112602. (www)

  @article{ , abstract = {This paper investigates the problem of performance constraints of uncertain nonlinear systems with actuator faults. Particularly, by developing the boundary threshold triggering strategy, the performance boundaries would be updated adaptively once the distance between the tracking error and the performance boundaries is smaller than the given threshold. Moreover, compared with the existing works, the transient behaviors are improved, and the limitation imposed on the initial conditions is removed attributed to the construction of novel performance functions and error transformation. Then, an adaptive fault-tolerant control scheme with self-regulating spatiotemporal performance is designed for a class of nonlinear systems with non-parametric uncertainties. It is shown that both the boundedness of the closed-loop signals and the satisfactory performance constraints are guaranteed in the presence of unpredictable actuator failure. The effectiveness of the proposed method is verified by theoretical analysis and numerical simulation.}, archive = {J_AUTOM}, author = {Zeqiang Li and Jason J.R. Liu and Yongduan Song}, doi = {10.1016/j.automatica.2025.112602}, journal = {Automatica}, month = {1}, pages = {112602}, shortjournal = {Automatica}, title = {Adaptive fault-tolerant control of nonlinear systems: A self-regulating spatiotemporal performance approach}, volume = {183}, year = {2026}, }
• (2026). Fully coupled nonlinear FBS△Es: Solvability and LQ control insights. AUTOM, 183, 112601. (www)

  @article{ , abstract = {In this paper, a class of fully coupled nonlinear forward–backward stochastic difference equations (FBS △ Es) is proposed and the existence of solutions is proved based on a linear-quadratic (LQ) optimal control problem. Inspired from the solvability studies of various forward–backward stochastic differential equations (FBSDEs), the dominant-monotone framework is discretized and a continuum approach is used to prove the unique solvability of the fully coupled FBS △ Es and to obtain a pair of estimates on the solutions, and finally, the conclusions are applied to the related LQ problem.}, archive = {J_AUTOM}, author = {Zhipeng Niu and Qingxin Meng and Xun Li and Maoning Tang}, doi = {10.1016/j.automatica.2025.112601}, journal = {Automatica}, month = {1}, pages = {112601}, shortjournal = {Automatica}, title = {Fully coupled nonlinear FBS△Es: Solvability and LQ control insights}, volume = {183}, year = {2026}, }
• (2026). Aerial target encirclement and interception with noisy range observations. AUTOM, 183, 112600. (www)

  @article{ , abstract = {This paper proposes a strategy to encircle and intercept a non-cooperative aerial point-mass moving target by leveraging noisy range measurements for state estimation. In this approach, the guardians actively ensure the observability of the target by using an anti-synchronization (AS), 3D “vibrating string” trajectory, which enables rapid position and velocity estimation based on the Kalman filter. Additionally, a novel anti-target controller is designed for the guardians to enable adaptive transitions from encircling a protected target to encircling, intercepting, and neutralizing a hostile target, taking into consideration the input constraints of the guardians. Based on the guaranteed uniform observability, the exponentially bounded stability of the state estimation error and the convergence of the encirclement error are rigorously analyzed. Simulation results and real-world UAV experiments are presented to further validate the effectiveness of the system design.}, archive = {J_AUTOM}, author = {Fen Liu and Shenghai Yuan and Thien-Minh Nguyen and Wei Meng and Lihua Xie}, doi = {10.1016/j.automatica.2025.112600}, journal = {Automatica}, month = {1}, pages = {112600}, shortjournal = {Automatica}, title = {Aerial target encirclement and interception with noisy range observations}, volume = {183}, year = {2026}, }
• (2026). Stochastic gradient hamiltonian sequential monte carlo filter with earth mover’s distance sampling for target tracking. AUTOM, 183, 112599. (www)

  @article{ , abstract = {High-speed missile tracking requires advanced filtering algorithms to overcome the limitations of traditional nonlinear methods. This study presents the stochastic gradient Hamiltonian sequential Monte Carlo filter, combining stochastic gradient Hamilton Monte Carlo with sequential Monte Carlo (SMC) for enhanced sampling performance and reduced computational burden. The method incorporates Earth Mover’s Distance based adaptive resampling with theoretical bounds for optimal particle count. Validation through univariate nonstationary growth model simulation and bearing-only tracking experiments demonstrates superior performance over conventional methods, achieving 15 % root mean square error improvement compared to conventional SMC and 30 % over extended Kalman filter/unscented Kalman filter approaches.}, archive = {J_AUTOM}, author = {Chang Ho Kang and Sun Young Kim}, doi = {10.1016/j.automatica.2025.112599}, journal = {Automatica}, month = {1}, pages = {112599}, shortjournal = {Automatica}, title = {Stochastic gradient hamiltonian sequential monte carlo filter with earth mover’s distance sampling for target tracking}, volume = {183}, year = {2026}, }
• (2026). Distributed nash equilibrium seeking with a dynamic set of players. AUTOM, 183, 112598. (www)

  @article{ , abstract = {This paper formulates a new distributed Nash equilibrium seeking problem with a dynamic set of players in which players are allowed to join and leave the network in a free manner during the decision-making process. To accommodate the dynamic joining and leaving behaviors of the players, a status estimation mechanism, which is capable of estimating in a finite time whether the players are active or inactive, is introduced. Based on the status estimation mechanism, a gradient play based algorithm is developed for distributed Nash equilibrium seeking in the dynamic environment. It is shown that under strongly connected communication graphs, players’ actions are convergent to a small neighborhood of the new Nash equilibrium linearly every time the player set changes. Moreover, the convergence accuracy and convergence rate can be adjusted by suitably tuning the step-size. To cover more general communication scenarios, strongly connected graphs are further relaxed to be B-jointly connected graphs, under which the convergence properties of the proposed algorithm are analytically studied. Furthermore, the upper bound of the average tracking error is quantified to evaluate the dynamic performance of the proposed algorithm. In the last, a simulation study on energy consumption games is given to verify the effectiveness of the proposed algorithm.}, archive = {J_AUTOM}, author = {Yuxuan Liu and Maojiao Ye and Lei Ding and Lihua Xie and Qing-Long Han}, doi = {10.1016/j.automatica.2025.112598}, journal = {Automatica}, month = {1}, pages = {112598}, shortjournal = {Automatica}, title = {Distributed nash equilibrium seeking with a dynamic set of players}, volume = {183}, year = {2026}, }
• (2026). Constrained finite-time and fixed-time stabilization for linear systems: Adaptive implicit lyapunov function-based control. AUTOM, 183, 112597. (www)

  @article{ , abstract = {In this paper, finite-time and fixed-time stabilization problems are investigated for single-input single-output (SISO) linear system under the control input constraint. The achievement of finite-time or fixed-time convergence rates is facilitated through the utilization of adaptive implicit Lyapunov function (ILF)-based control. For ease of practical implementation, the dynamics of Approximated-ILF (AILF) guarantees the precise estimation of ILF, while the stability of AILF-based control holds established. Furthermore, from both performance and input-constrained safety considerations, the anti-windup (AW) AILF endows the system with tolerance to saturation and maintains the non-asymptotic convergence properties. Numerical simulations support the obtained theoretical results and verify their effectiveness.}, archive = {J_AUTOM}, author = {Peng Wang and Mou Chen and Shuzhi Sam Ge and Xiaobing Zhang}, doi = {10.1016/j.automatica.2025.112597}, journal = {Automatica}, month = {1}, pages = {112597}, shortjournal = {Automatica}, title = {Constrained finite-time and fixed-time stabilization for linear systems: Adaptive implicit lyapunov function-based control}, volume = {183}, year = {2026}, }
• (2026). Input-to-state stability of self-triggered impulsive control systems. AUTOM, 183, 112596. (www)

  @article{ , abstract = {This paper studies the local input-to-state stability ( LISS ) of nonlinear systems under the self-triggered impulsive control ( STIC ) method. A novel LISS -type comparison principle is proposed, by which the LISS property of addressed system can be derived by the LISS property of its comparison system. On the basis of it, some Lyapunov-based sufficient conditions for non-Zeno behavior and LISS of nonlinear systems are provided in the framework of STIC . Moreover, the designed self-triggering mechanism ( STM ) is in the form of an explicit relationship with simple structure and east implementation. Finally, two numerical examples are given to illustrate the effectiveness of the proposed results.}, archive = {J_AUTOM}, author = {Xiaodi Li and Mingzhu Wang}, doi = {10.1016/j.automatica.2025.112596}, journal = {Automatica}, month = {1}, pages = {112596}, shortjournal = {Automatica}, title = {Input-to-state stability of self-triggered impulsive control systems}, volume = {183}, year = {2026}, }
• (2026). Event-triggered global and group consensus for linear multiagent systems with multiplicative noises. AUTOM, 183, 112595. (www)

  @article{ , abstract = {This article is concerned with the event-triggered global and group consensus problems for linear multiagent systems (MASs) with multiplicative noises and directed topology. First, for the global consensus of MASs under a balanced directed graph, a stochastic input-to-state stability property is proved to show that the piecewise constant control input has sufficient feedback capability; based on the relative state measurement, two novel static and dynamic event-triggered mechanisms (ETMs) are established to reduce the number of controller updates, where the Zeno phenomenon is effectively eliminated by imposing a uniformly strictly fixed positive time for all the inter-event times. Especially, new stochastic stability analysis techniques are developed to give sufficient conditions of mean square and almost sure consensus in both static and dynamic ETMs. Moreover, the obtained results on global consensus are extended to the setting of group consensus in order to cope with some grouping tasks in practical applications. Finally, some examples are presented to show the validity of theoretical results.}, archive = {J_AUTOM}, author = {Ruru Jia and Yuan-Hua Ni and Guangchen Wang}, doi = {10.1016/j.automatica.2025.112595}, journal = {Automatica}, month = {1}, pages = {112595}, shortjournal = {Automatica}, title = {Event-triggered global and group consensus for linear multiagent systems with multiplicative noises}, volume = {183}, year = {2026}, }
• (2026). Data-model-hybrid-driven near-optimal operational control of two-time-scale industrial systems with unknown operational model. AUTOM, 183, 112594. (www)

  @article{ , abstract = {This article discusses the optimal operational control (OOC) problem of two-time-scale (TTS) industrial systems with unknown operation model. Based on the singular perturbation theory (SPT), the OOC problem of TTS industrial systems is decomposed into an optimal regulation problem in fast time-scale and an optimal set-point tracking problem in slow time-scale. Then, by convex duality, the obtained optimization problems are equivalently transformed into convex optimization (CO) problems, and a data-model-hybrid-driven composite controller is designed. The design method of this composite controller avoids the potential numerical stiffness problems, and does not need complete system dynamics information while ensuring the steady-state output tracking error converges to zero. Finally, an example of mixed separation thickening process (MSTP) of hematite beneficiation is given to show the effectiveness of the proposed scheme.}, archive = {J_AUTOM}, author = {Yao Xu and Linna Zhou and Jianguo Zhao and Lei Ma and Chunyu Yang}, doi = {10.1016/j.automatica.2025.112594}, journal = {Automatica}, month = {1}, pages = {112594}, shortjournal = {Automatica}, title = {Data-model-hybrid-driven near-optimal operational control of two-time-scale industrial systems with unknown operational model}, volume = {183}, year = {2026}, }
• (2026). Event-triggered distributed optimal coordination of heterogeneous linear MASs over weight-unbalanced digraphs. AUTOM, 183, 112593. (www)

  @article{ , abstract = {In this paper, the distributed optimal coordination problem of heterogeneous linear multi-agent systems is studied, in which the actual information of the left eigenvector and out-degree cannot be obtained in advance. The underlying communication network among agents is assumed to be a weight-unbalanced and strongly connected digraph. The global objective function of the whole system is the sum of privately-known local objective functions, which are assumed to be strongly convex with Lipschitz continuous gradients. To achieve the distributed optimal coordination with low communication and computational resource consumption, and to efficiently reduce the frequency of control signal updates, a new distributed event-triggered control scheme is proposed. In this scheme, an auxiliary system with adaptive edge weights is established to generate the optimal trajectories and the tracking control inputs are designed for agents to track the given optimal trajectories. It is privacy-preserving to some extent as no actual state or output information of agents is communicated with neighbors. Sufficient conditions are derived, under which the distributed optimal coordination under consideration can be exponentially achieved. Moreover, the Zeno-behavior is shown to be excluded. Additionally, for cases where agent states are unmeasurable, a new distributed event-triggered observer-based control input is designed for each agent to achieve optimal coordination. Finally, numerical simulations are carried out to show the good performance of the proposed control scheme.}, archive = {J_AUTOM}, author = {Dandan Wang and Jialing Zhou and Guanghui Wen}, doi = {10.1016/j.automatica.2025.112593}, journal = {Automatica}, month = {1}, pages = {112593}, shortjournal = {Automatica}, title = {Event-triggered distributed optimal coordination of heterogeneous linear MASs over weight-unbalanced digraphs}, volume = {183}, year = {2026}, }
• (2026). Reducing real-time complexity via sub-control lyapunov functions: From theory to experiments. AUTOM, 183, 112592. (www)

  @article{ , abstract = {The techniques to design control Lyapunov functions (CLF), along with a proper stabilizing feedback, possibly in the presence of constraints, often provide control laws that are too complex for proper implementation online, especially when an optimization problem is involved. In this work, we show how to acquire an alternative, computationally attractive feedback. Given a nominal CLF and a nominal state feedback, we say that a different positive definite function is a Sub-control Lyapunov function (SCLF) if its Lyapunov derivative is negative-definite and bounded above by the Lyapunov derivative of the nominal function with the nominal control. It turns out that if we consider a family of basis functions, then an SCLF can be computed by linear programming, with an infinite number of constraints. The idea is that although the offline computational burden to achieve the new controller and solve the linear program is considerable, the online computational burden is drastically reduced. Comprehensive simulations and experiments on drone control are conducted to demonstrate the effectiveness of the study.}, archive = {J_AUTOM}, author = {Huu-Thinh Do and Franco Blanchini and Stefano Miani and Ionela Prodan}, doi = {10.1016/j.automatica.2025.112592}, journal = {Automatica}, month = {1}, pages = {112592}, shortjournal = {Automatica}, title = {Reducing real-time complexity via sub-control lyapunov functions: From theory to experiments}, volume = {183}, year = {2026}, }
• (2026). Adversarial dynamic games for markov jump systems: A policy iteration Q-learning method. AUTOM, 183, 112591. (www)

  @article{ , abstract = {This paper presents a reinforcement Q-learning approach for solving adversarial dynamic games in Markov jump systems. The H ∞ control problem is first formulated as a two-player zero-sum dynamic game, where the control policy and the disturbance policy act as adversarial players. To derive the Nash equilibrium control strategies for such games, a set of coupled algebraic Riccati equations is established, with the disturbance attenuation level properly prescribed. On this basis, two novel data-driven parallel Q-learning algorithms are proposed. The advantages of the proposed method are threefold: (i) it does not require precise knowledge of the system dynamics; (ii) it learns the optimal disturbance attenuation level; (iii) it yields Nash equilibrium control strategies. Finally, two simulation examples validate the effectiveness of the proposed method.}, archive = {J_AUTOM}, author = {Hao Shen and Jiacheng Wu and Jing Wang and Zhengguang Wu}, doi = {10.1016/j.automatica.2025.112591}, journal = {Automatica}, month = {1}, pages = {112591}, shortjournal = {Automatica}, title = {Adversarial dynamic games for markov jump systems: A policy iteration Q-learning method}, volume = {183}, year = {2026}, }
• (2026). H2/H∞ state and output feedback control with sparse actuation. AUTOM, 183, 112581. (www)

  @article{ , abstract = {In this paper, we present novel convex optimization formulations for designing full-state and output-feedback controllers with sparse actuation that achieve user-specified H 2 and H ∞ performance criteria. The sparsity is induced through the ℓ 1 -minimization over channel-wise H 2 norms from disturbances to the individual actuator signals, while simultaneously constraining H 2 or H ∞ norm from disturbances to the output variables The proposed approach is applied to a structural dynamics problem, demonstrating the advantages of simultaneous optimization of the control law and the actuation architecture in realizing an efficient closed-loop system, as well as highlighting the trade-offs between maximum allowable actuator magnitudes and the controller sparsity.}, archive = {J_AUTOM}, author = {Vedang M. Deshpande and Raktim Bhattacharya}, doi = {10.1016/j.automatica.2025.112581}, journal = {Automatica}, month = {1}, pages = {112581}, shortjournal = {Automatica}, title = {H2/H∞ state and output feedback control with sparse actuation}, volume = {183}, year = {2026}, }
• (2026). Adaptive dynamic event–triggered distributed optimal coordination of heterogeneous uncertain nonlinear multiagent systems. AUTOM, 183, 112580. (www)

  @article{ , abstract = {This paper addresses the distributed optimal coordination problem for a class of heterogeneous uncertain nonlinear multiagent systems. Instead of relying on the analytical forms of gradient functions, we use the measured gradient values depending on agents’ real-time outputs and propose a novel adaptive distributed control scheme. This scheme integrates event-triggered optimal coordinators, high-order filters, and tracking controllers. To handle the interaction between optimal coordinators and filters, we incorporate a new compensation term into the updating law for the coupling weight of each edge. Moreover, we design a novel adaptive distributed dynamic event-triggering mechanism that ensures that the inter-event times of each agent are lower bounded by a positive constant. Asymptotic convergence of agents’ outputs to the optimal point is proved by constructing a composite Lyapunov function. The proposed control scheme does not depend on global topology information. A numerical example is given to demonstrate the effectiveness of the proposed control scheme.}, archive = {J_AUTOM}, author = {Tianyu Liu and Lu Liu}, doi = {10.1016/j.automatica.2025.112580}, journal = {Automatica}, month = {1}, pages = {112580}, shortjournal = {Automatica}, title = {Adaptive dynamic event–triggered distributed optimal coordination of heterogeneous uncertain nonlinear multiagent systems}, volume = {183}, year = {2026}, }
• (2026). Accelerated primal–dual methods for strongly convex objective functions in continuous and discrete time. AUTOM, 183, 112579. (www)

  @article{ , abstract = {In this paper, we introduce a “second-order primal” + “first-order dual” continuous-time dynamic for linearly constrained optimization problems, where the objective function is μ -strongly convex. We consider a constant damping 2 μ for the second-order ordinary differential equation in the primal variable, following Nesterov’s acceleration for strongly convex optimization. A positive constant scaling is applied to the primal variable, while a positive increasing scaling function is applied to the dual variable. We prove that the proposed dynamic achieves a fast convergence rate for both the objective residual and the feasibility violation, with the decay rate potentially reaching O ( e − μ t ) . Additionally, we show that the dynamic is robust under small perturbations. By discretizing the proposed continuous-time dynamic, we develop an accelerated linearized augmented Lagrangian method for strongly convex composite optimization with linear constraints, where the objective function has a nonsmooth + smooth composite structure. The proposed algorithm achieves a fast convergence rate that matches the one of the continuous-time dynamic. We also consider an inexact version of the proposed algorithm, which can be viewed as a discrete version of the perturbed continuous-time dynamic. Numerical results are provided to verify the practical performances.}, archive = {J_AUTOM}, author = {Xin He and Dong He and Ya-Ping Fang}, doi = {10.1016/j.automatica.2025.112579}, journal = {Automatica}, month = {1}, pages = {112579}, shortjournal = {Automatica}, title = {Accelerated primal–dual methods for strongly convex objective functions in continuous and discrete time}, volume = {183}, year = {2026}, }
• (2026). Hierarchical supervisory control of networked and cyber-attacked discrete-event systems. AUTOM, 183, 112578. (www)

  @article{ , abstract = {In standard supervisory control of discrete-event systems, partial (incomplete) observations are given by deterministic functions such as natural projections, which erase unobservable events, or masks, which can represent indistinguishable events, where two or more different events yield the same observation. However, communication channels in modern technological systems are not always reliable and can be attacked by malicious external agents. In that case, the plant observations obtained by the supervisor may not be deterministic, e.g., due to delays and losses, or external attacks. This paper considers a unified supervisory control framework with set-valued (nondeterministic) observations and proposes a simplified version of nondeterministic observability, together with a generalized normality. It shows how the results of hierarchical control can be extended to the networked and cyber-attacked discrete-event systems at the same time.}, archive = {J_AUTOM}, author = {Shaowen Miao and Jan Komenda and Feng Lin}, doi = {10.1016/j.automatica.2025.112578}, journal = {Automatica}, month = {1}, pages = {112578}, shortjournal = {Automatica}, title = {Hierarchical supervisory control of networked and cyber-attacked discrete-event systems}, volume = {183}, year = {2026}, }
• (2026). On the design of linear time varying model predictive control for trajectory stabilization. AUTOM, 183, 112577. (www)

  @article{ , abstract = {Stabilizing a reference trajectory of a nonlinear system is a recurrent, non-trivial task in control engineering. A common approach is to linearize the dynamics along the trajectory, thus deriving a linear-time-varying (LTV) model, and to design a model predictive controller (MPC), which results to be computationally efficient, since only convex programs need to be solved in real time, while retaining constraint handling capabilities. Building on recent developments in gain-scheduling control design, where linearization errors and tracking error bounds are considered, a new approach to derive such LTV-MPC controllers is presented. The method addresses the systematic derivation of a suitable terminal cost. The resulting MPC law is tube-based, exploiting the co-designed auxiliary gain-scheduled controller. Computational and implementation aspects are discussed as well, and the resulting hierarchical method is demonstrated both in simulation and in experiments with a small drone with fast dynamics and limited embedded computational capacity.}, archive = {J_AUTOM}, author = {Nicolas Kessler and Lorenzo Fagiano}, doi = {10.1016/j.automatica.2025.112577}, journal = {Automatica}, month = {1}, pages = {112577}, shortjournal = {Automatica}, title = {On the design of linear time varying model predictive control for trajectory stabilization}, volume = {183}, year = {2026}, }
• (2026). Intersection-based architectures for decentralized diagnosis of discrete event systems. AUTOM, 183, 112576. (www)

  @article{ , abstract = {In this paper, two intersection-based architectures, named the normal-state-estimator-intersection-based architecture (N-SEI architecture) and the failure-state-estimator-intersection-based architecture (F-SEI architecture), are examined for decentralized diagnosis of discrete event systems. For each of these architectures, the corresponding notion of codiagnosability is defined. These defined notions of codiagnosability are incomparable with inference diagnosability for the inference-based architecture. In addition, codiagnosability for the N-SEI architecture is weaker than the existing notion of intersection-based codiagnosability, while codiagnosability for the F-SEI architecture is incomparable with it. For each of the N-SEI and F-SEI architectures, a method for verifying the corresponding notion of codiagnosability is developed.}, archive = {J_AUTOM}, author = {Shigemasa Takai and Takashi Yamamoto}, doi = {10.1016/j.automatica.2025.112576}, journal = {Automatica}, month = {1}, pages = {112576}, shortjournal = {Automatica}, title = {Intersection-based architectures for decentralized diagnosis of discrete event systems}, volume = {183}, year = {2026}, }
• (2026). Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics. AUTOM, 183, 112575. (www)

  @article{ , abstract = {This paper considers distributed stochastic optimization problems over a multi-agent network, where each agent collaboratively minimizes the sum of individual expectation-valued cost functions subject to nonidentical set constraints. We first recast the distributed constrained optimization as a constrained saddle-point problem. Subsequently, two distributed stochastic algorithms via optimistic gradient descent ascent (SOGDA) and extragradient (SEG) methods are developed with constant step sizes, in which the variable sample-size technique is incorporated to reduce the variance of the sampled gradients. We present the explicit selection criteria of the constant step size, under which the developed algorithms achieve almost sure convergence to an optimal solution. Moreover, the convergence rate is O ( 1 / k ) for merely convex cost functions, which matches the optimal rate of its deterministic counterpart. Finally, a numerical example is provided to reflect the theoretical findings.}, archive = {J_AUTOM}, author = {Yi Huang and Shisheng Cui and Xianlin Zeng and Ziyang Meng}, doi = {10.1016/j.automatica.2025.112575}, journal = {Automatica}, month = {1}, pages = {112575}, shortjournal = {Automatica}, title = {Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics}, volume = {183}, year = {2026}, }
• (2026). A characterization method of terminal ingredients for nonlinear MPC using value-based reinforcement learning. AUTOM, 183, 112574. (www)

  @article{ , abstract = {The stability of nonlinear model predictive control (MPC) relies significantly on stabilizing factors such as the terminal region and cost. A larger terminal region not only expands the region of attraction for the closed-loop system but also contributes to reducing online computation costs. However, existing methods in the literature often impose limitations on the degrees of freedom available for characterizing terminal ingredients. This limitation arises from the reliance on either a predetermined linear local controller or a preset control Lyapunov function. This paper introduces an innovative approach to terminal ingredient characterization leveraging value-based reinforcement learning (RL). This method provides ample degrees of freedom for expanding the terminal region. To achieve this, a deep neural network is employed to learn the parametric state value function, serving as the terminal cost for MPC. The local controller adopts a one-step MPC instead of a predetermined linear or nonlinear feedback controller. Subsequently, a terminal set sequence is constructed iteratively through the one-step set expansion. The proposed approach’s effectiveness is validated through simulations.}, archive = {J_AUTOM}, author = {Jinghan Cui and Jinwu Gao and Xiangjie Liu and Yuqi Liu and Shuyou Yu}, doi = {10.1016/j.automatica.2025.112574}, journal = {Automatica}, month = {1}, pages = {112574}, shortjournal = {Automatica}, title = {A characterization method of terminal ingredients for nonlinear MPC using value-based reinforcement learning}, volume = {183}, year = {2026}, }
• (2026). Aperiodic-sampled neural network controllers with closed-loop stability verifications. AUTOM, 183, 112573. (www)

  @article{ , abstract = {In this paper, we synthesize two aperiodic-sampled deep neural network (DNN) control schemes, based on the closed-loop tracking stability guarantees. By means of the integral quadratic constraint coping with the input–output behavior of system uncertainties/nonlinearities and the convex relaxations of nonlinear DNN activations leveraging their local sector-bounded attributes, we establish conditions to design the event- and self-triggered logics and to compute the ellipsoidal inner approximations of region of attraction, respectively. Finally, we perform a numerical example of an inverted pendulum to illustrate the effectiveness of the proposed aperiodic-sampled DNN control schemes.}, archive = {J_AUTOM}, author = {Renjie Ma and Zhijian Hu and Rongni Yang and Ligang Wu}, doi = {10.1016/j.automatica.2025.112573}, journal = {Automatica}, month = {1}, pages = {112573}, shortjournal = {Automatica}, title = {Aperiodic-sampled neural network controllers with closed-loop stability verifications}, volume = {183}, year = {2026}, }
• (2026). Backstepping for partial differential equations: A survey. AUTOM, 183, 112572. (www)

  @article{ , abstract = {Systems modeled by partial differential equations (PDEs) are at least as ubiquitous as those by nature finite-dimensional and modeled by ordinary differential equations (ODEs). And yet, systematic and readily usable methodologies, for such a significant portion of real systems, have been historically scarce. Around the year 2000, the backstepping approach to PDE control began to offer not only a less abstract alternative to PDE control techniques replicating optimal and spectrum assignment techniques of the 1960s, but also enabled the methodologies of adaptive and nonlinear control, matured in the 1980s and 1990s, to be extended from ODEs to PDEs, allowing feedback synthesis for systems that are uncertain, nonlinear, and infinite-dimensional. The PDE backstepping literature has since grown to hundreds of papers and nearly a dozen books. This survey aims to facilitate the entry into this thriving area of overwhelming size and topical diversity. Designs of controllers and observers, for parabolic, hyperbolic, and other classes of PDEs, in one or more dimensions, with nonlinear, adaptive, sampled-data, and event-triggered extensions, are covered in the survey. The lifeblood of control are technology and physics. The survey places a particular emphasis on applications that have motivated the development of the theory and which have benefited from the theory and designs: flows, flexible structures, materials, thermal and chemically reacting dynamics, energy (from oil drilling to batteries and magnetic confinement fusion), and vehicles.}, archive = {J_AUTOM}, author = {Rafael Vazquez and Jean Auriol and Federico Bribiesca-Argomedo and Miroslav Krstic}, doi = {10.1016/j.automatica.2025.112572}, journal = {Automatica}, month = {1}, pages = {112572}, shortjournal = {Automatica}, title = {Backstepping for partial differential equations: A survey}, volume = {183}, year = {2026}, }
• (2026). Maximum principle for partial information non-zero sum stochastic differential games with mixed delays. AUTOM, 183, 112570. (www)

  @article{ , abstract = {This paper is concerned with one kind of partial information non-zero sum stochastic differential game with mixed delays. Both the state and control processes contain delays, where the former contains moving-average delay, discrete delay and noisy memory. We establish a necessary as well as two sufficient stochastic maximum principles for the game. As one of the main features of this research, a new kind of sufficient maximum principle is given, where the diffusion term can be controlled with non-convex control domains, and no second-order adjoint equation is needed. The theoretical results are applied to study two examples where the adjoint processes can be derived by two approaches and then the equilibrium points are obtained. This research generalizes those of stochastic optimal control problems.}, archive = {J_AUTOM}, author = {Pan Chen and Feng Zhang}, doi = {10.1016/j.automatica.2025.112570}, journal = {Automatica}, month = {1}, pages = {112570}, shortjournal = {Automatica}, title = {Maximum principle for partial information non-zero sum stochastic differential games with mixed delays}, volume = {183}, year = {2026}, }
• (2026). Finite and fixed-time feedback-based continuous-time optimization. AUTOM, 183, 112569. (www)

  @article{ , abstract = {This article presents a framework for finite and fixed-time control, using feedback-based optimization to drive a system toward its optimal operating point. Unlike traditional methods that rely on predefined set points, this approach employs endogenous control inputs derived through numerical optimization while adhering to system constraints. The controller’s dynamics are modeled as a convergent gradient flow, allowing the system to autonomously achieve its optimum without external references. The proposed control architecture guarantees finite- and fixed-time stability, with a Lyapunov-based analysis determining permissible perturbation bounds to ensure robust performance. The effectiveness of the proposed control strategy is demonstrated through simulations on a coupled-tank and a buck converter systems, successfully achieving the desired steady-state operation with the designed control approach.}, archive = {J_AUTOM}, author = {Baby Diana and Sunidhi Pandey and Shyam Kamal and Thach Ngoc Dinh}, doi = {10.1016/j.automatica.2025.112569}, journal = {Automatica}, month = {1}, pages = {112569}, shortjournal = {Automatica}, title = {Finite and fixed-time feedback-based continuous-time optimization}, volume = {183}, year = {2026}, }
• (2026). State estimation for lithium-ion batteries based on electrolyte–electrode PDE observers. AUTOM, 183, 112568. (www)

  @article{ , abstract = {Accurate information about the states of an electrochemical battery model facilitates a deeper understanding of battery behavior and enables performance enhancement. This paper first proposes backstepping Partial Differential Equation (PDE) observers for lithium concentration in the electrolyte phase within the negative electrode, positive electrode, and separator. Reverse sensitivity analysis is conducted to identify the most suitable measurable parameter for obtaining the electrolyte lithium concentration at the boundaries, which is used in the design of the electrolyte-phase observer. Subsequently, enhanced observers for the solid-phase lithium concentration in the negative and positive electrodes are developed. The proposed solid-phase observer enables more accurate State-of-Charge (SoC) estimation by leveraging the closed-loop electrolyte-phase observer. Simulations of the reverse sensitivity analysis and state observers are performed on a commercial cylindrical lithium iron phosphate ( LiFePO 4 ) cell to validate the effectiveness of the proposed approach.}, archive = {J_AUTOM}, author = {Sara Sepasiahooyi and Shu-Xia Tang}, doi = {10.1016/j.automatica.2025.112568}, journal = {Automatica}, month = {1}, pages = {112568}, shortjournal = {Automatica}, title = {State estimation for lithium-ion batteries based on electrolyte–electrode PDE observers}, volume = {183}, year = {2026}, }
• (2026). Interval-constraint multiagent systems: Global attractivity and structural stability of equilibria. AUTOM, 183, 112566. (www)

  @article{ , abstract = {This paper focuses on the dynamic behavior of an interval-constraint multiagent system. Each agent has a constraint interval that limits its potential consensus values, achieved by encoding a nonsmooth piecewise function into the agent. In addition, the underlying graphs considered are strongly connected. First, a dichotomy of equilibria is identified: either a unique non-consensus equilibrium point or multiple consensus points, depending on whether the intersection of the constraint intervals is empty or not. Then, the set of equilibria is proven to be a global attractor. Structural stability of such a system is also proven based on real-analysis methods, showing that the equilibria have continuous dependence on changes of the constraint intervals. Three running examples are used to illustrate the proposed results.}, archive = {J_AUTOM}, author = {Fengqiu Liu and Kuize Zhang and Yuhu Wu and Xiaoping Xue}, doi = {10.1016/j.automatica.2025.112566}, journal = {Automatica}, month = {1}, pages = {112566}, shortjournal = {Automatica}, title = {Interval-constraint multiagent systems: Global attractivity and structural stability of equilibria}, volume = {183}, year = {2026}, }
• (2026). Closed-loop data-enabled predictive control and its equivalence with closed-loop subspace predictive control. AUTOM, 183, 112556. (www)

  @article{ , abstract = {Factors like growing data availability and increasing system complexity have sparked interest in data-driven predictive control (DDPC) methods like Data-enabled Predictive Control (DeePC). However, closed-loop identification bias arises in the presence of noise, which reduces the effectiveness of obtained control policies. In this paper we propose Closed-loop Data-enabled Predictive Control (CL-DeePC), a framework that unifies different approaches to address this challenge. To this end, CL-DeePC incorporates instrumental variables (IVs) to synthesize and sequentially apply consistent single or multi-step-ahead predictors. Furthermore, a computationally efficient CL-DeePC implementation is developed that reveals an equivalence with Closed-loop Subspace Predictive Control (CL-SPC). Time marching simulations of DeePC and CL-DeePC are conducted using Hankel matrices of past data that are updated at every time step to induce potentially troublesome closed-loop correlations between inputs and noise. Compared to DeePC, CL-DeePC simulations demonstrate superior reference tracking, with a sensitivity study finding a 48% lower susceptibility to noise-induced reference tracking performance degradation.}, archive = {J_AUTOM}, author = {Rogier Dinkla and Tom Oomen and Sebastiaan Paul Mulders and Jan-Willem van Wingerden}, doi = {10.1016/j.automatica.2025.112556}, journal = {Automatica}, month = {1}, pages = {112556}, shortjournal = {Automatica}, title = {Closed-loop data-enabled predictive control and its equivalence with closed-loop subspace predictive control}, volume = {183}, year = {2026}, }
• (2026). Byzantine-resilient federated online learning for gaussian process regression. AUTOM, 183, 112554. (www)

  @article{ , abstract = {In this paper, we study Byzantine-resilient federated online learning for Gaussian process regression (GPR). We develop a Byzantine-resilient federated GPR algorithm that allows a cloud and a group of agents to collaboratively learn a latent function and improve the learning performances where some agents exhibit Byzantine failures, i.e., arbitrary and potentially adversarial behavior. Each agent-based local GPR sends potentially compromised local predictions to the cloud, and the cloud-based aggregated GPR computes a global model by a Byzantine-resilient product of experts aggregation rule. Then the cloud broadcasts the current global model to all the agents. Agent-based fused GPR refines local predictions by fusing the received global model with that of the agent-based local GPR. Moreover, we quantify the learning accuracy improvements of the agent-based fused GPR over the agent-based local GPR. Experiments on a toy example and two medium-scale real-world datasets are conducted to demonstrate the performances of the proposed algorithm.}, archive = {J_AUTOM}, author = {Xu Zhang and Zhenyuan Yuan and Minghui Zhu}, doi = {10.1016/j.automatica.2025.112554}, journal = {Automatica}, month = {1}, pages = {112554}, shortjournal = {Automatica}, title = {Byzantine-resilient federated online learning for gaussian process regression}, volume = {183}, year = {2026}, }
• (2026). Observer-based asymptotic active fault diagnosis: Separate and joint design of observer gain and input. AUTOM, 183, 112548. (www)

  @article{ , abstract = {This paper proposes observer gain and input design methods for observer-based asymptotic active fault diagnosis, which are based on a newly-defined notion named the excluding degree of the origin from a zonotope. Using the excluding degree, a quantitative specification is obtained to characterize the performance of set-based robust fault diagnosis. Furthermore, a separate gain design method and a joint gain and input design method are proposed, respectively. This is the first work to achieve a joint observer gain and input design for set-based active fault diagnosis. Compared with the existing methods that design gains and input separately, the proposed joint gain and input design method has advantages to exploit the fault diagnosis potential of observer-based schemes. Finally, several examples are used to illustrate the effectiveness of the proposed methods.}, archive = {J_AUTOM}, author = {Feng Xu and Yiming Wan and Ye Wang and Vicenç Puig}, doi = {10.1016/j.automatica.2025.112548}, journal = {Automatica}, month = {1}, pages = {112548}, shortjournal = {Automatica}, title = {Observer-based asymptotic active fault diagnosis: Separate and joint design of observer gain and input}, volume = {183}, year = {2026}, }
• (2026). Controller synthesis from noisy-input noisy-output data. AUTOM, 183, 112545. (www)

  @article{ , abstract = {We consider the problem of synthesizing a dynamic output-feedback controller for a linear system, using solely input–output data corrupted by measurement noise. To handle input–output data, an auxiliary representation of the original system is utilized. By exploiting the structure of the auxiliary system, we design a controller that robustly stabilizes all possible systems consistent with data. Notably, we also provide a novel solution to extend the results to generic multi-input multi-output systems. The findings are illustrated by numerical examples.}, archive = {J_AUTOM}, author = {Lidong Li and Andrea Bisoffi and Claudio De Persis and Nima Monshizadeh}, doi = {10.1016/j.automatica.2025.112545}, journal = {Automatica}, month = {1}, pages = {112545}, shortjournal = {Automatica}, title = {Controller synthesis from noisy-input noisy-output data}, volume = {183}, year = {2026}, }
• (2026). Accuracy bounds for the simulation of a class of continuous-time nonlinear models. AUTOM, 183, 112543. (www)

  @article{ , abstract = {Real-world dynamic systems evolve in the continuous-time world, while their models are simulated in the digital world using discrete-time numerical simulation algorithms. Such simulation is essential for a variety of system and control problems such as system identification and performance analysis of (control) systems. Ideally, the simulated model response should be identical to the system response. However, this is typically not the case in practice, even when the effects of unmodelled dynamics and parametric uncertainty are excluded. Even in that scenario, a mismatch exists between the response of the system and the model due to the interface between the physical world and the digital computer, unknown disturbances, and simulation inaccuracies. For the class of continuous-time, nonlinear Lur’e-type systems, this paper analyses the mismatch between the steady-state system response and the steady-state model response computed using the so-called mixed time–frequency algorithm. Firstly, a bound on the mismatch between the steady-state system response and the computed steady-state model response based on continuous-time signals is derived. Secondly, a bound for the same mismatch is derived for a sampled version of the signals. The bounds are further decomposed into several components, each given an interpretation that can be used to reduce the bounds on the mismatch. In a numerical case study, we show that reducing the bounds also reduces the actual mismatch.}, archive = {J_AUTOM}, author = {Fahim Shakib and Johan Schoukens and Alexander Yu. Pogromsky and Alexey Pavlov and Nathan van de Wouw}, doi = {10.1016/j.automatica.2025.112543}, journal = {Automatica}, month = {1}, pages = {112543}, shortjournal = {Automatica}, title = {Accuracy bounds for the simulation of a class of continuous-time nonlinear models}, volume = {183}, year = {2026}, }
• (2026). Revisiting lossless convexification: Theoretical guarantees for discrete-time optimal control problems. AUTOM, 183, 112537. (www)

  @article{ , abstract = {Lossless Convexification (LCvx) is a modeling approach that transforms a class of nonconvex optimal control problems, where nonconvexity primarily arises from control constraints, into convex problems through convex relaxations. These convex problems can be solved using polynomial-time numerical methods after discretization, which converts the original infinite-dimensional problem into a finite-dimensional one. However, existing LCvx theory is limited to continuous-time optimal control problems, as the equivalence between the relaxed convex problem and the original nonconvex problem holds only in continuous-time. This paper extends LCvx theory to discrete-time optimal control problems by classifying them into normal and long-horizon cases. For normal cases, after an arbitrarily small perturbation to the system dynamics (recursive equality constraints), applying the existing LCvx method to discrete-time problems results in optimal controls that meet the original nonconvex constraints at all but no more than n x − 1 temporal grid points, where n x is the state dimension. For long-horizon cases, the existing LCvx method fails, but we resolve this issue by integrating it with a bisection search, leveraging the continuity of the value function from the relaxed convex problem to achieve similar results as in normal cases. This paper strengthens the theoretical foundation of LCvx, extending the applicability of LCvx theory to discrete-time optimal control problems.}, archive = {J_AUTOM}, author = {Dayou Luo and Kazuya Echigo and Behçet Açıkmeşe}, doi = {10.1016/j.automatica.2025.112537}, journal = {Automatica}, month = {1}, pages = {112537}, shortjournal = {Automatica}, title = {Revisiting lossless convexification: Theoretical guarantees for discrete-time optimal control problems}, volume = {183}, year = {2026}, }
• (2026). Federated cubic regularized newton learning with sparsification-amplified differential privacy. AUTOM, 183, 112531. (www)

  @article{ , abstract = {This paper explores the cubic-regularized Newton method within a federated learning framework while addressing two major concerns: privacy leakage and communication bottlenecks. We propose the Differentially Private Federated Cubic Regularized Newton (DP-FCRN) algorithm, which leverages second-order techniques to achieve lower iteration complexity than first-order methods. We incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset.}, archive = {J_AUTOM}, author = {Wei Huo and Changxin Liu and Kemi Ding and Karl Henrik Johansson and Ling Shi}, doi = {10.1016/j.automatica.2025.112531}, journal = {Automatica}, month = {1}, pages = {112531}, shortjournal = {Automatica}, title = {Federated cubic regularized newton learning with sparsification-amplified differential privacy}, volume = {183}, year = {2026}, }
• (2026). A consensus kalman filter on l2 spaces. AUTOM, 183, 112530. (www)

  @article{ , abstract = {We study the estimation problem of infinite dimensional discrete-time stochastic linear systems with finite dimensional measurements on sensor networks modeled by connected undirected graphs. The framework encompasses discretized PDEs with sampled measurements. A new scheme of distributed consensus on measurements is extended to systems evolving in L 2 spaces in order to limit the information exchange to finite-dimensional vectors. We show that, in analogy to the finite-dimensional case, at each node the variance of the estimation error tends to the one of the centralized Kalman filter for systems is L 2 when the number of consensus steps increases.}, archive = {J_AUTOM}, author = {Stefano Battilotti and Alessandro Borri and Filippo Cacace and Massimiliano d’Angelo and Alfredo Germani}, doi = {10.1016/j.automatica.2025.112530}, journal = {Automatica}, month = {1}, pages = {112530}, shortjournal = {Automatica}, title = {A consensus kalman filter on l2 spaces}, volume = {183}, year = {2026}, }
• (2026). Fixed-time learning for safe time-critical verification using reachability analysis. AUTOM, 183, 112528. (www)

  @article{ , abstract = {In this paper, we address a safe time-critical control problem using reachability analysis and design a reinforcement learning-based mechanism for learning online and in fixed-time the solution to the safe time-critical control problem. Safety is ensured by determining a set of states for which there exists an admissible control law generating a system trajectory that does not reach a set of forbidden states at a user-prescribed time instant. Specifically, we cast our safe time-critical problem as a Mayer optimal feedback control problem whose solution satisfies the Hamilton–Jacobi–Bellman (HJB) equation and characterizes the set of safe states. Since the HJB equation is generally difficult to solve, we develop an online critic-only reinforcement learning-based algorithm for simultaneously learning the solution to the HJB equation and the safe set in a fixed time. In particular, we introduce a non-Lipschitz experience replay-based learning law utilizing recorded and current data for updating the critic weights to learn the value function and the safe set. The non-Lipschitz property of the dynamics gives rise to fixed-time convergence, whereas the experience replay-based approach eliminates the need to satisfy the persistence of excitation condition provided that a recorded data set is sufficiently rich. Simulation results illustrate the efficacy of the proposed approach to the problem of fixed-wing unmanned aerial vehicle collision avoidance.}, archive = {J_AUTOM}, author = {Nick-Marios T. Kokolakis and Kyriakos G. Vamvoudakis and Wassim M. Haddad}, doi = {10.1016/j.automatica.2025.112528}, journal = {Automatica}, month = {1}, pages = {112528}, shortjournal = {Automatica}, title = {Fixed-time learning for safe time-critical verification using reachability analysis}, volume = {183}, year = {2026}, }
• (2026). Orchestrating on-board sensors for global hybrid robust stabilization of unicycles. AUTOM, 183, 112502. (www)

  @article{ , abstract = {We consider mobile robots described through unicycle dynamics equipped with on-board range sensors and cameras, one facing forward and one facing backward, providing measurements of the distance and misalignment to a target. We propose a hybrid control law combining the two on-board measurements and discuss stability results for the closed-loop expressed in the on-board camera-based coordinates, using Lyapunov-based arguments. We prove robustness of the stability properties to uncertainties affecting the sensors and external perturbations acting on the robot. The results are illustrated via simulations.}, archive = {J_AUTOM}, author = {Riccardo Ballaben and Alessandro Astolfi and Philipp Braun and Luca Zaccarian}, doi = {10.1016/j.automatica.2025.112502}, journal = {Automatica}, month = {1}, pages = {112502}, shortjournal = {Automatica}, title = {Orchestrating on-board sensors for global hybrid robust stabilization of unicycles}, volume = {183}, year = {2026}, }

CMA - 5

• (2026). Numerical simulation of generalized finite difference wave equation based on automatic construction of interface nodes. CMA, 201, 65-79. (www)

  @article{ , abstract = {In seismic exploration, the Finite Difference Method (FDM) is commonly used to simulate the propagation of seismic waves. This numerical method approximates derivatives by calculating the weighted sum of values at adjacent nodes. Currently, models are stored using regular grids. When discretizing complex structural interfaces such as inclined strata and faults, non - smooth surfaces will appear, which leads to errors in the forward modeling of wave equations. To address the forward - modeling issues caused by model errors, a meshless method called the Generalized Finite Difference Method (GFDM) has been proposed and has been successfully applied in computational geosciences. This method constructs node clouds for discrete nodes and solves derivatives based on the relationships between central nodes and surrounding nodes in the node cloud, offering flexible solutions. However, it requires substantial time for fine-grained modeling of the model, and conventional node construction performs poorly for complex models with drastic lateral variations. In this study, we analyzed the causes of errors in relation to interface dip angles and proposed an automatic interface node construction method. Testing on various models demonstrates that this method can effectively construct models with smaller discretization errors and significantly reduced scattering errors in forward modeling compared to conventional methods.}, archive = {J_CMA}, author = {Zhili Chen and Yong Wang and Zhixian Gui}, doi = {10.1016/j.camwa.2025.10.001}, journal = {Computers & Mathematics with Applications}, month = {1}, pages = {65-79}, shortjournal = {Comput. Meth. Appl.}, title = {Numerical simulation of generalized finite difference wave equation based on automatic construction of interface nodes}, volume = {201}, year = {2026}, }
• (2026). Meshfree method for solving the elliptic monge-ampère equation with dirichlet boundary. CMA, 201, 53-64. (www)

  @article{ , abstract = {We develop the meshfree method for solving the elliptic Monge-Ampère equation with Dirichlet boundary on the bounded domain and prove its convergence in the paper. In terms of trial, we use the radial functions (for example, Whittle-Matérn-Sobolev kernels and Wendland's compactly supported radial basis functions) which can reproduce W σ , 2 ( R d ) to construct the finite dimensional approximate spaces. It allows the easy construction of approximation spaces in arbitrary dimensions with arbitrary smoothness and avoids the huge workload caused by mesh-based methods at the same time. In terms of testing, it just needs to take values directly on the collocation points and greatly simplifies the difficulties caused by variation and integration. Theoretically, we obtain L 2 error when the testing discretization is finer than the trial discretization. The convergence rate depends on the regularity of the solution, the smoothness of the computing domain, and the approximation of kernel-based trial spaces. An extension to non-Dirichlet boundary condition is in a forthcoming paper.}, archive = {J_CMA}, author = {Zhiyong Liu and Qiuyan Xu}, doi = {10.1016/j.camwa.2025.09.036}, journal = {Computers & Mathematics with Applications}, month = {1}, pages = {53-64}, shortjournal = {Comput. Meth. Appl.}, title = {Meshfree method for solving the elliptic monge-ampère equation with dirichlet boundary}, volume = {201}, year = {2026}, }
• (2026). A second-order time-accurate, linear fully decoupled unconditional energy stabilization finite element method for tumor growth model. CMA, 201, 35-52. (www)

  @article{ , abstract = {By using the L 2 gradient flow method, we derive a phase-field model for tumor growth from the free energy. The scalar auxiliary variable (SAV) method is employed to handle the nonlinear energy potential. Based on the second-order backward differentiation formula (BDF2) and the finite element method, we construct an unconditionally stable, linear, and decoupled fully discrete numerical scheme. We rigorously prove the unconditional energy stability of the proposed scheme and the optimal L 2 -norm error estimates for ϕ and c . Numerical examples are presented to validate the theoretical results and to demonstrate the effectiveness of the model and the scheme.}, archive = {J_CMA}, author = {Mingle Sun and Bo Wang and Guang-an Zou and Yuxing Zhang}, doi = {10.1016/j.camwa.2025.09.028}, journal = {Computers & Mathematics with Applications}, month = {1}, pages = {35-52}, shortjournal = {Comput. Meth. Appl.}, title = {A second-order time-accurate, linear fully decoupled unconditional energy stabilization finite element method for tumor growth model}, volume = {201}, year = {2026}, }
• (2026). High order energy invariant fast algorithm for space two dimensional klein-gordon-zakharov equations. CMA, 201, 18-34. (www)

  @article{ , abstract = {Space two dimensional Klein-Gordon-Zakharov equations are directly changed into the Hamiltonian system with infinite dimensional space by the variational formula, which can be discretized into finite dimensional Hamiltonian system by Fourier pseudo-spectral method. The average vector field formulas with second and fourth order accuracy in time are utilized to compute the finite dimensional Hamiltonian system. In order to improve computation velocity of these formulas, the fast computation algorithm of these formulas is proposed by decomposing the spectral matrix. Solitary wave evolution of the equations is analyzed with different initial conditions by these new computational formulas. Energy invariant property, accuracy and computation efficiently of these new formulas are also investigated.}, archive = {J_CMA}, author = {Jie Chen and Jianqiang Sun}, doi = {10.1016/j.camwa.2025.09.026}, journal = {Computers & Mathematics with Applications}, month = {1}, pages = {18-34}, shortjournal = {Comput. Meth. Appl.}, title = {High order energy invariant fast algorithm for space two dimensional klein-gordon-zakharov equations}, volume = {201}, year = {2026}, }
• (2026). Fundamental solution neural networks for solving inverse cauchy problems for the laplace and biharmonic equations. CMA, 201, 1-17. (www)

  @article{ , abstract = {This paper proposes a novel fundamental solution neural networks method (FSNNs) to solve inverse Cauchy problems, which combines the method of fundamental solutions (MFS) with the physics-informed neural networks (PINNs). To optimize the distribution of source points, the method starts by partitioning the interval into equal segments, determined by the number of the source points. The coordinate system is situated at the center of the computational domain. The resulting angles as network inputs for the FSNNs and the intermediate variable as outputs, which is subsequently substituted into a length function to obtain the final length. The coordinates of the source points are then determined, and the MFS is employed to approximate the numerical solutions. The loss function is formulated based on the boundary conditions on the accessible boundary, and the training is employed to optimize the network parameters in the FSNNs and source point intensities in the MFS. The introduction of the PINNs overcomes the challenge of source point selection in the MFS and effectively addresses the ill-posedness of inverse problems. In summary, the proposed scheme is a machine learning-based semi-analytical meshless method which is simple, accurate and easily implemented, making it highly suitable for the numerical solution of inverse problems. Four numerical experiments, including the Laplace and biharmonic equations, validate the effectiveness and accuracy of the proposed FSNNs.}, archive = {J_CMA}, author = {Xin Li and Fajie Wang and Renhao Wang and Shengdong Zhao and Daigeng Yang}, doi = {10.1016/j.camwa.2025.09.032}, journal = {Computers & Mathematics with Applications}, month = {1}, pages = {1-17}, shortjournal = {Comput. Meth. Appl.}, title = {Fundamental solution neural networks for solving inverse cauchy problems for the laplace and biharmonic equations}, volume = {201}, year = {2026}, }

CMAME - 39

• (2026). Non-iterative method for reliability-based topology optimization of static and dynamic problems with uncertain-but-bounded parameters. CMAME, 448, 118456. (www)

  @article{ , abstract = {The non-probabilistic reliability-based topology optimization (NRBTO) method offers a powerful tool for achieving high-performance and high-safety layout designs under uncertain-but-bounded (UBB) parameters. However, the practical application of NRBTO is limited by unaffordable computational burden associated with repeated non-probabilistic reliability iterations. To address this issue, a new non-iterative reliability-based topology optimization method for static and dynamic problems with UBB parameters is established to avoid the non-probabilistic reliability iteration, in which a novel non-iterative method (NIM) is proposed by strict proving the monotonicity conditions with respect to UBB parameters. The complex NRBTO model is transformed into an equivalent deterministic topology optimization model, thereby reducing computational costs. Moreover, the sensitivities with respect to design variables are derived using the adjoint method. The effectiveness of proposed NIM for NRBTO is validated through two static and two dynamic examples, where the compliance, displacement, stress, frequency, and frequency-band problems are addressed.}, archive = {J_CMAME}, author = {Gang Yang and Zeng Meng and Peng Hao and Changting Zhong}, doi = {10.1016/j.cma.2025.118456}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118456}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Non-iterative method for reliability-based topology optimization of static and dynamic problems with uncertain-but-bounded parameters}, volume = {448}, year = {2026}, }
• (2026). Aerodynamics-driven topology optimization of compliant airfoils considering stability. CMAME, 448, 118454. (www)

  @article{ , abstract = {Airfoil structures optimized solely for stiffness can suffer from buckling instabilities under realistic aerodynamic loads. We present the first topology optimization framework to improve the stability of aerodynamic structures. For a clear representation of structure, this work employs the topology optimization of binary structures with geometry trimming. Reynolds-averaged Navier-Stokes turbulence model is employed to accurately predict the turbulent aerodynamic loading under realistic flight conditions. Fluid–structure interaction and buckling analysis are conducted using an elastic formulation with geometrical nonlinearities to allow for large deformations. The numerical model system is solved through the finite element method and the Arbitrary Lagrangian-Eulerian method is applied. The sensitivities are calculated using semi-automatic differentiation and interpolated to the optimization mesh. Kreisselmeier-Steinhauser aggregation function is used and augmented Lagrangian multipliers are developed for buckling constraints. Numerical examples demonstrate that the proposed method can effectively improve the airfoil stability to different constraint levels across various configurations with minimal parameter tuning. Additionally, the algorithm produces designs that are conducive to manufacturing.}, archive = {J_CMAME}, author = {Qingdi Wang and Lucas Oliveira Siqueira and Tao Xu and Guanzhe Cui and Zhi Li and Anderson Soares da Costa Azevêdo and Renato Picelli and Yi Min Xie}, doi = {10.1016/j.cma.2025.118454}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118454}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Aerodynamics-driven topology optimization of compliant airfoils considering stability}, volume = {448}, year = {2026}, }
• (2026). Nine circles of elastic brittle fracture: A series of challenge problems to assess fracture models. CMAME, 448, 118449. (www)

  @article{ , abstract = {Since the turn of the millennium, capitalizing on modern advances in mathematics and computation, a slew of computational models have been proposed in the literature with the objective of describing the nucleation and propagation of fracture in materials subjected to mechanical, thermal, and/or other types of loads. By and large, each new proposal focuses on a particular aspect of the problem, while ignoring others that have been well-established. This approach has resulted in a plethora of models that are, at best, descriptors of fracture only under a restricted set of conditions, while they may predict grossly incorrect and even non-physical behaviors in general. In an attempt to address this predicament, this paper introduces a vetting process in the form of nine challenge problems that any computational model of fracture must convincingly handle if it is to potentially describe fracture nucleation and propagation in general. The focus is on the most basic of settings, that of isotropic elastic brittle materials subjected to quasi-static mechanical loads. The challenge problems have been carefully selected so that: i ) they can be carried out experimentally with standard testing equipment; i i ) they can be unambiguously analyzed with a sharp description of fracture; and, most critically, i i i ) in aggregate they span the entire range of well settled experimental knowledge on fracture nucleation and propagation that has been amassed for over a century. For demonstration purposes, after their introduction, each challenge problem is solved with two phase-field models of fracture, a classical variational phase-field model and the phase-field model initiated by Kumar, Francfort, and Lopez-Pamies ( J. Mech. Phys. Solids 112 (2018), 523–551), this both for a prototypical elastic brittle hard material (soda-lime glass) and a prototypical elastic brittle soft material (a polyurethane elastomer).}, archive = {J_CMAME}, author = {Farhad Kamarei and Bo Zeng and John E. Dolbow and Oscar Lopez-Pamies}, doi = {10.1016/j.cma.2025.118449}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118449}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Nine circles of elastic brittle fracture: A series of challenge problems to assess fracture models}, volume = {448}, year = {2026}, }
• (2026). Nonlinear projection-based model order reduction with machine learning regression for closure error modeling in the latent space. CMAME, 448, 118443. (www)

  @article{ , abstract = {A significant advancement in nonlinear projection-based model order reduction (PMOR) is presented through a highly effective methodology. This methodology employs Gaussian process regression (GPR) and radial basis function (RBF) interpolation for closure error modeling in the latent space, offering notable gains in efficiency and expanding the scope of PMOR. Moving beyond the limitations of deep artificial neural networks (ANNs), previously used for this task, this approach provides crucial advantages in terms of interpretability and a reduced demand for extensive training data. The capabilities of GPR and RBFs are showcased in two demanding applications: a two-dimensional parametric inviscid Burgers problem, featuring propagating shocks across the entire computational domain, and a complex three-dimensional turbulent flow simulation around an Ahmed body. The results demonstrate that this innovative approach preserves accuracy and achieves substantial improvements in efficiency and interpretability when contrasted with traditional PMOR and ANN-based closure modeling.}, archive = {J_CMAME}, author = {S. Ares de Parga and Radek Tezaur and Carlos G. Hernández and Charbel Farhat}, doi = {10.1016/j.cma.2025.118443}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118443}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Nonlinear projection-based model order reduction with machine learning regression for closure error modeling in the latent space}, volume = {448}, year = {2026}, }
• (2026). A block preconditioner for thermo-poromechanics with frictional deformation of fractures. CMAME, 448, 118440. (www)

  @article{ , abstract = {The numerical modeling of fracture contact thermo-poromechanics is crucial for advancing subsurface engineering applications, including CO 2 sequestration, production of geo-energy resources, energy storage and wastewater disposal operations. Accurately modeling this problem presents substantial challenges due to the complex physics involved in strongly coupled thermo-poromechanical processes and the frictional contact mechanics of fractures. To resolve process couplings in the resulting mathematical model, it is common to apply fully implicit time stepping. This necessitates the use of an iterative linear solver to run the model. The solver’s efficiency primarily depends on a robust preconditioner, which is particularly challenging to develop because it must handle the mutual couplings between linearized contact mechanics and energy, momentum, and mass balance. In this work, we introduce a preconditioner for the problem based on the nested approximations of Schur complements. To decouple the momentum balance, we utilize the fixed-stress approximation, extended to account for both the porous media and fracture subdomains. The singularity of the contact mechanics submatrix is resolved by a linear transformation. Two variations of the algorithm are proposed to address the coupled mass and energy balance submatrix: either the Constrained Pressure Residual (CPR) or the algebraic multigrid method (AMG) for systems of equations. The preconditioner is evaluated through numerical experiments of fluid injection into fractured porous media, which causes thermal contraction and subsequent sliding and opening of fractures. The experiments show that the preconditioner performs robustly for a wide range of simulation regimes governed by various fracture states, friction coefficients and Peclétnumber. The grid refinement experiments demonstrate that the preconditioner scales well in terms of GMRES iterations, in both two and three dimensions.}, archive = {J_CMAME}, author = {Yury Zabegaev and Inga Berre and Eirik Keilegavlen}, doi = {10.1016/j.cma.2025.118440}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118440}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {A block preconditioner for thermo-poromechanics with frictional deformation of fractures}, volume = {448}, year = {2026}, }
• (2026). Inverse scattering without phase: Carleman convexification and phase retrieval via the Wentzel–Kramers–Brillouin approximation. CMAME, 448, 118439. (www)

  @article{ , abstract = {This paper addresses the challenging and interesting inverse problem of reconstructing the spatially varying dielectric constant of a medium from phaseless backscattering measurements generated by single-point illumination. The underlying mathematical model is governed by the three-dimensional Helmholtz equation, and the available data consist solely of the magnitude of the scattered wave field. To address the nonlinearity and servere ill-posedness of this phaseless inverse scattering problem, we introduce a robust, globally convergent numerical framework combining several key regularization strategies. Our method first employs a phase retrieval step based on the Wentzel–Kramers–Brillouin (WKB) ansatz, where the lost phase information is reconstructed by solving a nonlinear optimization problem. Subsequently, we implement a Fourier-based dimension reduction technique, transforming the original problem into a more stable system of elliptic equations with Cauchy boundary conditions. To solve this resulting system reliably, we apply the Carleman convexification approach, constructing a strictly convex weighted cost functional whose global minimizer provides an accurate approximation of the true solution. Numerical simulations using synthetic data with high noise levels demonstrate the effectiveness and robustness of the proposed method, confirming its capability to accurately recover both the geometric location and contrast of hidden scatterers.}, archive = {J_CMAME}, author = {Thuy T. Le and Phuong M. Nguyen and Loc H. Nguyen}, doi = {10.1016/j.cma.2025.118439}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118439}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Inverse scattering without phase: Carleman convexification and phase retrieval via the Wentzel–Kramers–Brillouin approximation}, volume = {448}, year = {2026}, }
• (2026). A green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials. CMAME, 448, 118436. (www)

  @article{ , abstract = {Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. The computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.}, archive = {J_CMAME}, author = {Miroslav Zecevic}, doi = {10.1016/j.cma.2025.118436}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118436}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {A green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials}, volume = {448}, year = {2026}, }
• (2026). A mesh-based geometric deep learning framework for rapid response prediction of large-scale and multi-component mechanical structures in engineering. CMAME, 448, 118435. (www)

  @article{ , abstract = {Mesh-based finite element method (FEM) plays a critical role in simulating structural response. However, the analysis of complex physical processes, such as vehicle crashworthiness, is hindered by inherent high nonlinearities and large-scale meshes, leading to significant computational overhead and impeding rapid structure design. In recent years, the use of machine learning (ML) or deep learning (DL) methods to build surrogate models for simulations has gained much attention, which offers the potential to drastically reduce computational time while preserving accuracy. In this paper, we develop an end-to-end and mesh-based geometric DL framework that takes finite element (FE) solver files (such as.k file for LS-Dyna) containing mesh and material information as input, and quickly outputs response prediction of large-scale and multi-component mechanical structures in engineering, thus serving a promising alternative to FE solvers. We innovatively introduce the graph self-supervised learning (SSL) to transform FE data of structural component with varied material properties, complex geometric shapes and arbitrary number of unstructured meshes into low-dimensional embeddings, which are then employed to build an equivalent small-scale graph representation of the large-scale assembly, effectively alleviating the computational costs of subsequent prediction models. Then, we present GNN-FNN and GNN-Transformer models specifically designed for three different prediction tasks, including forecasting static and dynamic structural performance metrics, and constructing time-dependent physical fields. Using a large-scale industrial case of the electric vehicle (EV) under side pole impact, three regression tasks are carried out to assess the effectiveness of the proposed approach. Results reveal that the non-parametric model, free from the need for manually defined explicit parameters, excels in extracting implicit parameters for diverse structures, which support satisfactory prediction accuracy in each task with a considerable speedup than the simulation. Besides, it is surprising that our model is weakly sensitive to the moderate variation in the mesh resolution, which is valuable for practical engineering applications. The adaptability and scalability of our method are further verified on three additional industrial cases with varied structural simulation scenarios and progressively increasing FE model complexity. This work offers an effective surrogate model to accelerate the response evaluation of mechanical structures in engineering and shorten the design cycle requiring iterative optimization.}, archive = {J_CMAME}, author = {Gongxi Zhang and Ying Liu and Yi Quan and Junfei Yan}, doi = {10.1016/j.cma.2025.118435}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118435}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {A mesh-based geometric deep learning framework for rapid response prediction of large-scale and multi-component mechanical structures in engineering}, volume = {448}, year = {2026}, }
• (2026). Physics- and data-driven active learning of neural network representations for free energy density functions of materials from statistical mechanics. CMAME, 448, 118434. (www)

  @article{ , abstract = {Accurate free energy density representations are crucial for understanding phase dynamics in materials. We employ a scale-bridging approach to incorporate atomistic information into our free energy density model by training a neural network on DFT-informed Monte Carlo data. To optimize sampling in the high-dimensional Monte Carlo space, we present an active learning framework that integrates space-filling sampling, uncertainty-based sampling, and physics-informed sampling. Additionally, our approach includes methods such as hyperparameter tuning, dynamic sampling, and novelty enforcement. These strategies can be combined to reduce the mean squared error-either globally or in targeted regions of interest-while minimizing the number of required data points. The framework introduced here is broadly applicable to Monte Carlo sampling of a range of materials systems.}, archive = {J_CMAME}, author = {J. Holber and K. Garikipati}, doi = {10.1016/j.cma.2025.118434}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118434}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Physics- and data-driven active learning of neural network representations for free energy density functions of materials from statistical mechanics}, volume = {448}, year = {2026}, }
• (2026). Dimension-reduced chapman-kolmogorov equation for high-dimensional stochastic dynamical systems. CMAME, 448, 118433. (www)

  @article{ , abstract = {Random vibration analysis of high-dimensional dynamical systems is a fundamental problem in science and engineering, yet it remains challenging due to the curse of dimensionality. While dimension-reduced formulations have been developed for differential-type equations governing time-variant probability density, such as the Fokker-Planck equation, no equivalent formulation has been established for the integral-type Chapman-Kolmogorov (CK) equation, despite its theoretical importance and computational advantages. In this paper, a novel dimension-reduced Chapman-Kolmogorov (DRCK) equation is established governing the transient probability density function (PDF) of any quantity of interest in high-dimensional Markov systems. The derivation is conducted based on the projection of the full Chapman-Kolmogorov equation onto the dimension-reduced space. It is established that the intrinsic transition probability density (TPD) of the DRCK equation is the conditional expectation of the original TPD. Further, the short-time approximate intrinsic TPDs under both Gaussian and Poisson white noise excitations are derived analytically, enabling practical numerical implementation. The proposed DRCK equation provides a mathematically rigorous and computationally efficient framework for high-dimensional stochastic systems. Numerical examples are developed to demonstrate its accuracy and effectiveness. The DRCK equation thus provides a new tool for reliability assessment and uncertainty quantification in complex engineering applications.}, archive = {J_CMAME}, author = {Jianbing Chen and Meng-Ze Lyu and Shenghan Zhang}, doi = {10.1016/j.cma.2025.118433}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118433}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Dimension-reduced chapman-kolmogorov equation for high-dimensional stochastic dynamical systems}, volume = {448}, year = {2026}, }
• (2026). Second order three-dimensional serendipity virtual elements for hyperelasticity: Static and dynamic analysis. CMAME, 448, 118432. (www)

  @article{ , abstract = {In this work, a three-dimensional (3D) second-order serendipity virtual element method (S-VEM) is developed for the static and dynamic analysis of hyperelastic materials. The VEM framework is based on the projection of unknown basis functions onto polynomial spaces, allowing for flexible discretization with arbitrary polyhedral meshes. While most existing VEM formulations for 3D mechanical problems are discretized using first-order formulations, higher-order schemes offer improved precision, especially for nonlinear problems. However, conventional second-order VEM formulations introduce additional degrees of freedom (DOFs), such as body and surface moments, which complicate the implementation and reduce computation efficiency. To address this challenge, we propose a novel 3D second-order serendipity VEM that avoids any extra moment-related DOFs. This is the first application of a serendipity VEM to 3D static and dynamic problems in hyperelasticity. Furthermore, by integrating advanced mesh generation techniques, the proposed method enables hybrid simulations that combine second-order serendipity VEM and FEM to efficiently handle complex geometries.}, archive = {J_CMAME}, author = {Bing-Bing Xu and Lourenco Beirao da Veiga and Yongjie Jessica Zhang and Peter Wriggers}, doi = {10.1016/j.cma.2025.118432}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118432}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Second order three-dimensional serendipity virtual elements for hyperelasticity: Static and dynamic analysis}, volume = {448}, year = {2026}, }
• (2026). Stabilized explicit material point method for fluid flow and fluid-structure interaction simulations using dual high-order B-spline volume averaging. CMAME, 448, 118428. (www)

  @article{ , abstract = {Traditional explicit Material Point Methods (MPM) for weakly compressible fluids often suffer from volumetric locking, cell-crossing instability, and excessive energy dissipation, particularly in fluid-structure interaction (FSI) scenarios. This study presents a stabilized explicit MPM framework that integrates dual high-order B-spline volume averaging to address these challenges. The proposed dual averaging technique simultaneously smooths deformation gradients and pressure fields using cubic B-spline basis functions to eliminate cell-crossing errors and reduce volumetric locking. A blended APIC/FLIP mapping scheme is developed to enhance energy conservation and stability at coarse grid resolutions. The framework is further enhanced by seamlessly integrating various complementary techniques such as δ -correction, pressure smoothing, and specialized boundary handling for more robust and effective modeling of free-surface and FSI problems. The framework is rigorously validated through benchmark cases, including 1D elastic wave propagation, Poiseuille flow, lid-driven cavity flow, water sloshing, dam break, and water impact on elastic obstacles. The simulation results demonstrate a remarkable reduction in pressure oscillations and improved particle distribution uniformity compared to prior MPM approaches. The proposed method establishes a robust and efficient tool for large-deformation FSI problems and bridges gaps in accuracy and stability for industrial-scale applications.}, archive = {J_CMAME}, author = {Zhang Cheng and Shiwei Zhao and Hao Chen and Jidong Zhao}, doi = {10.1016/j.cma.2025.118428}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118428}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Stabilized explicit material point method for fluid flow and fluid-structure interaction simulations using dual high-order B-spline volume averaging}, volume = {448}, year = {2026}, }
• (2026). Personalized multiscale modeling of coronary plaque progression: The interaction between low-density-lipoprotein transport and cellular dynamics. CMAME, 448, 118427. (www)

  @article{ , abstract = {Multiscale agent-based modeling has shown promise in elucidating the mechanobiological mechanisms underlying atherosclerotic plaque formation and progression. However, the integration of advanced models of low-density lipoprotein (LDL) transport in the lumen and across the endothelium with agent-based models (ABMs) of plaque growth remains underexplored. Furthermore, patient-specific applications are lacking. This study introduces a novel agent-based modeling framework for atherosclerosis, integrating hemodynamics and LDL transport in the lumen through computational fluid dynamics simulations, a three-pore model of trans-endothelial LDL migration, and an ABM of lipid and cellular dynamics. For the first time, the framework was applied to a patient-specific coronary artery and validated against 1-year follow-up data. Furthermore, it was used to explore potential plaque evolution over 5 years and under elevated LDL concentration. The calibrated model predicted the 1-year variation in wall area in two patient-specific coronary cross-sections with an error of less than 10%. Simulated scenarios indicated that variations in blood LDL concentrations can result in distinct plaque morphologies, from localized to diffuse patterns. This study provided an innovative, advanced multiscale model of atherosclerotic plaque formation and progression. As the first patient-specific application of a multiscale agent-based modeling framework for atherosclerosis with initial validation, this study underscored the potential of the approach for deciphering the mechanobiological pathways driving coronary plaque progression. The developed model provided valuable insights into how the interplay between LDL transport and hemodynamics influences arterial wall cellular dynamics in a patient-specific context.}, archive = {J_CMAME}, author = {Anna Corti and Giuseppe De Nisco and Jolanda J. Wentzel and Francesco Migliavacca and Umberto Morbiducci and Claudio Chiastra}, doi = {10.1016/j.cma.2025.118427}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118427}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Personalized multiscale modeling of coronary plaque progression: The interaction between low-density-lipoprotein transport and cellular dynamics}, volume = {448}, year = {2026}, }
• (2026). Linearized localized orthogonal decomposition for quasilinear nonmonotone elliptic PDE. CMAME, 448, 118426. (www)

  @article{ , abstract = {In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition (LOD), so that we do not require structural assumptions such as periodicity or scale separation and only need minimal regularity assumptions on the coefficient. To construct the multiscale space, we solve linear fine-scale problems on small local subdomains, for which we consider two different linearization techniques. For both, we present a rigorous well-posedness analysis and convergence estimates in the H 1 -semi norm. We compare and discuss theoretically and numerically the performance of our strategies for different linearization points. Both numerical experiments and theoretical analysis demonstrate the validity and applicability of the method.}, archive = {J_CMAME}, author = {Maher Khrais and Barbara Verfürth}, doi = {10.1016/j.cma.2025.118426}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118426}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Linearized localized orthogonal decomposition for quasilinear nonmonotone elliptic PDE}, volume = {448}, year = {2026}, }
• (2026). The isogeometric MITC shell in geometric nonlinear analysis. CMAME, 448, 118425. (www)

  @article{ , abstract = {This paper extends the isogeometric MITC shell formulation proposed by Mi and Yu (2021) for linear analysis to address geometric nonlinear shell problems. Built on the Reissner-Mindlin shell theory, the original linear formulation employs the Mixed Interpolation of Tensorial Components (MITC) technique to alleviate shear and membrane locking. The present nonlinear extension retains the MITC framework while incorporating a mixed Non-Uniform Rational B-Spline (NURBS)-Lagrange interpolation strategy to address the additional complexities induced by geometric nonlinearity. The interpolatory nature of the Lagrange basis functions is leveraged to simplify the construction of director vectors and assumed strain fields. The nonlinear problem is formulated in a total Lagrangian setting and solved using Newton-Raphson iterations. The effectiveness of the proposed method is demonstrated through a comprehensive set of numerical examples, including both standard benchmarks and a collection of geometric nonlinear shell problems, which features challenging behaviors such as large rotations and the development of local creases. Through Bézier extraction, the method is further evaluated using T-spline and U-spline basis functions. The numerical results confirm that the MITC technique effectively suppresses shear and membrane locking, and the proposed shell formulation exhibits high accuracy and robust convergence, even for coarse and severely distorted meshes. However, it is also observed that the high inter-element continuity inherent in splines-based discretization can inhibit large deformations, introducing a new form of locking. This issue is successfully mitigated using Bézier extraction to reduce the inter-element continuity. Overall, the proposed formulation offers a general and reliable isogeometric framework for geometrically nonlinear analysis, applicable across a wide range of shell geometries, loading conditions, and boundary constraints.}, archive = {J_CMAME}, author = {Yongzhen Mi}, doi = {10.1016/j.cma.2025.118425}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118425}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {The isogeometric MITC shell in geometric nonlinear analysis}, volume = {448}, year = {2026}, }
• (2026). A new pre-stressing algorithm for patient-specific simulations of growth and remodeling using the homogenized constrained mixture theory. CMAME, 448, 118424. (www)

  @article{ , abstract = {The homogenized constrained mixture theory has been implemented in different Finite-Element software packages for almost ten years to simulate growth and remodeling in soft biological tissues. In these models, it is essential to determine the pre-stresses of each constituent of the mixture in the reference configuration. However, no efficient numerical solution has been proposed so far to solve this problem. We propose to address this lack with a new algorithm based on the concept of anisotropic thermal contraction. In this algorithm, the pre-stretch tensor is incrementally updated by applying a series of anisotropic thermal contractions to each representative volume element of the model to restore its reference configuration. These contractions are proportional to the inverse of the local right stretch tensor, obtained through the polar decomposition of the deformation gradient. We implemented the algorithm in the Abaqus Finite-Element package through a UMAT subroutine and verified it on examples including growth and remodeling of a patient-specific aorta. We demonstrate that the model captures the residual stresses in good agreement with experimental results. To highlight the potential clinical relevance of the proposed algorithm, we expanded our model predictions to investigate the influence of the aortic axial pre-stretch on morphological and microstructural evolutions of the aorta under hypertensive conditions. Our simulations show that loss of axial tension, induced by hypertension, increases aortic length and may lead to pathological deformations such as aortic tortuosity. These findings highlight the importance of efficiently determining pre-stresses for simulating long-term vascular growth and remodeling.}, archive = {J_CMAME}, author = {Ali Akbar Karkhaneh Yousefi and Stéphane Avril}, doi = {10.1016/j.cma.2025.118424}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118424}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {A new pre-stressing algorithm for patient-specific simulations of growth and remodeling using the homogenized constrained mixture theory}, volume = {448}, year = {2026}, }
• (2026). GPU-accelerated multi-phase, multi-resolution SPH method with ray tracing for laser powder bed fusion. CMAME, 448, 118423. (www)

  @article{ , abstract = {Powder-scale simulation of laser powder bed fusion (LPBF) is increasingly vital for understanding, predicting, and controlling metallurgical defects. However, the complex multi-physics and multi-material interactions involved, along with high computational demands, pose significant challenges. This study presents the first multiphase smoothed particle hydrodynamics (SPH) simulation framework for LPBF under both low and high evaporation regimes, incorporating a multi-resolution particle strategy and ray tracing (RT). An adaptive particle refinement (APR) method, compatible with multiphase SPH and optimized for GPU acceleration, is developed to enhance computational efficiency of the multiphase model. The RT model is also optimized and integrated with the APR-GPU architecture, further improving performance. A physics-based wetting force model is introduced, along with a novel method for improving normal vector accuracy near the contact line. The proposed framework is validated through three benchmark cases and applied to simulate LPBF processes. The results demonstrate that the framework achieves high accuracy and efficiency in resolving key LPBF phenomena, including melt pool dynamics and keyhole formation.}, archive = {J_CMAME}, author = {Yibo Ma and Zhilang Zhang and Christian Weißenfels and Minli Zhou and Lingxiao Ma and Xiaofei Tang and Moubin Liu}, doi = {10.1016/j.cma.2025.118423}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118423}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {GPU-accelerated multi-phase, multi-resolution SPH method with ray tracing for laser powder bed fusion}, volume = {448}, year = {2026}, }
• (2026). Physics-guided hybrid network for predicting nonlinear dynamic response of structures under bi-directional ground motions. CMAME, 448, 118422. (www)

  @article{ , abstract = {Seismic structural response is a critical indicator for assessing collapse resistance and ensuring post-earthquake functionality. Therefore, accurate and rapid prediction of these responses is essential, with Deep Learning (DL) models offering a robust alternative to finite element methods due to their computational efficiency and capability to model nonlinear dynamic responses of structures. However, prevailing DL approaches predominantly focus on unidirectional seismic excitations, often neglecting the complex effects of bidirectional seismic excitations on real-world structures. Furthermore, while the development of the physics-informed neural network effectively enhances interpretability under limited data, most existing approaches incorporate physical constraints solely into the loss function, potentially leading to optimization conflicts and slow convergence rates. To bridge these gaps, this study introduces a novel physics-guided hybrid deep learning framework, the Physical Residual Long Short-term Memory network-Kolmogorov–Arnold network model (Phy-RLK), for real-time bidirectional seismic structural response prediction. The proposed DL architecture embeds the Newmark- β numerical integration scheme as a physical residual within LSTM cells. Simultaneously, the adaptive basis functions of the KAN enhance the feature extraction capability from bidirectional seismic inputs, enabling real-time correction of acceleration, velocity, and displacement predictions at each time step, thereby ensuring improved accuracy and physical consistency. The effectiveness of the proposed model is initially verified on a six-story Reinforced Concrete (RC) frame structure, determining optimal hyperparameters in the process. An ablation study further confirms the necessity of both the physics-residual LSTM cell and KAN layer. The model is subsequently implemented on a five-story RC frame structure to verify accuracy and applicability. The experimental results demonstrate that the Phy-RLK provides superior predictive accuracy and robustness, and significantly higher computational efficiency compared to finite element simulations.}, archive = {J_CMAME}, author = {Zheyi Guo and Jun Xu}, doi = {10.1016/j.cma.2025.118422}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118422}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Physics-guided hybrid network for predicting nonlinear dynamic response of structures under bi-directional ground motions}, volume = {448}, year = {2026}, }
• (2026). Sparse data assimilation for under-resolved large-eddy simulations. CMAME, 448, 118421. (www)

  @article{ , abstract = {The need for accurate and fast scale-resolving simulations of fluid flows, where turbulent dispersion is a crucial physical feature, is evident. Large-eddy simulations (LES) are computationally more affordable than direct numerical simulations, but their accuracy depends on sub-grid scale models and the quality of the computational mesh. In order to compensate related errors, a data assimilation approach for LES is devised in this work. The presented method is based on variational assimilation of sparse time-averaged velocity reference data. Working with the time-averaged LES momentum equation allows to employ a stationary discrete adjoint method. Therefore, a stationary corrective force in the unsteady LES momentum equation is iteratively updated within the gradient-based optimization framework in conjunction with the adjoint gradient. After data assimilation, corrected anisotropic Reynolds stresses are inferred from the stationary corrective force. Ultimately, this corrective force that acts on the mean velocity is replaced by a term that scales the velocity fluctuations through nudging of the corrected anisotropic Reynolds stresses. Efficacy of the proposed framework is demonstrated for turbulent flow over periodic hills and around a square cylinder. Coarse meshes are leveraged to further enhance the speed of the optimization procedure. Time- and spanwise-averaged velocity reference data from high-fidelity simulations is taken from the literature. Our results demonstrate that adjoint-based assimilation of averaged velocity enables the optimization of the mean flow, vortex shedding frequency (i. e., Strouhal number), and anisotropic Reynolds stresses. This highlights the superiority of scale-resolving simulations such as LES over simulations based on the (unsteady) Reynolds-averaged equations.}, archive = {J_CMAME}, author = {Justin Plogmann and Oliver Brenner and Patrick Jenny}, doi = {10.1016/j.cma.2025.118421}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118421}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Sparse data assimilation for under-resolved large-eddy simulations}, volume = {448}, year = {2026}, }
• (2026). Improved accuracy of dirichlet-like microscopic solutions on representative volume elements. CMAME, 448, 118420. (www)

  @article{ , abstract = {This work focuses on the improvement of Dirichlet Boundary Value Finite Element solutions on Representative Volume Elements (RVE). For random microstructure Finite Element calculations, it is well-known that Periodic Boundary Conditions (PBC) applied on fixed size periodic RVE are much more precise than classical Dirichlet boundary conditions, so-called Uniform Strain Boundary Conditions (USBC), at the expense of additional efforts. The numerical experiments reported here clearly reveal that the inaccuracy of USBC is mainly due to boundary effects located around and in artificially cut inclusions because of the classical RVE cubic shape. To improve USBC solutions, without affecting their competitive computational speed and memory requirements, existing Dirichlet-based post-processing and pre-processing approaches are benchmarked through an in-depth comparison on various measure of interest: apparent properties, phase first and second moments, frequency histograms. The post-processing methods are namely truncation and filtering. For this latter, a dedicated cut inclusions filter is proposed. The pre-processing methods consist in modifying the inclusions sampling law or the RVE shape to avoid boundary cut inclusions. The main advantage of these pre-processing strategies is to obtain improved local fields, and hence to avoid dedicated post-processing. Innovative Dirichlet-like Boundary Conditions (namely Homogeneous Strain Boundary Conditions - HSBC) based on a rigid body motion of inclusions at the RVE boundary are also introduced. For enough stiff inclusions (material contrast greater than 10), these latter show a promising efficiency on apparent properties but also on local and phase-average fields (even second moments).}, archive = {J_CMAME}, author = {Louis Belgrand and Isabelle Ramière and Marc Josien and Frédéric Lebon}, doi = {10.1016/j.cma.2025.118420}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118420}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Improved accuracy of dirichlet-like microscopic solutions on representative volume elements}, volume = {448}, year = {2026}, }
• (2026). DGTO: Derivable geodesics-coupled topology optimization for multi-axis 3D printing of continuous fiber-reinforced spatial structures. CMAME, 448, 118419. (www)

  @article{ , abstract = {Continuous fiber reinforced composites (CFRCs) are composite materials with exceptional mechanical properties to enhance structural mechanical performance. In comparison with traditional three-axis 3D printing (also referred to as 2.5D printing), multi-axis 3D printing simultaneously moves the nozzle and rotates the build platform during the printing process, making it particularly suited for fabricating spatial structures made of CFRCs due to better alignment between the fiber depositions and principal stress directions. In this research, we propose a Derivable Geodesics-coupled Topology Optimization (DGTO) method for design of CFRCs given the manufacturing scheme of multi-axis 3D printing. A prominent feature of DGTO is the introduction of two geodesic fields to achieve curved layer generation and continuous fiber path planning. The heat diffusion equation and Poisson equation are solved to produce the geodesic fields, and hence, all objective functions and constraints related to the slices and paths are derivable, making them perfectly suitable to be integrated with topology optimization. Hence, the proposed method concurrently optimizes the density field and the auxiliary geodesic fields, simultaneously tuning the material distribution and spatial fiber distribution, thereby attaining optimal performance while fulfilling the manufacturing constraints of multi-axis printing, i.e., self-support of structure and overlap/gap-free of continuous fibers. Four numerical examples are presented to demonstrate the effectiveness of the algorithm, especially showing outstanding performances than designs for traditional three-axis 3D printing.}, archive = {J_CMAME}, author = {Kaixian Liang and Jikai Liu and Shuzhi Xu and Yifan Guo}, doi = {10.1016/j.cma.2025.118419}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118419}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {DGTO: Derivable geodesics-coupled topology optimization for multi-axis 3D printing of continuous fiber-reinforced spatial structures}, volume = {448}, year = {2026}, }
• (2026). Active evolutionary gaussian process for structural large-scale full-field reliability analysis and critical domain prognosis with only few initial samples. CMAME, 448, 118418. (www)

  @article{ , abstract = {Reliability analysis is crucial for ensuring structural integrity, yet it requires repeated, time-consuming evaluations of responses and multivariate limit state functions, while struggling to provide full-field estimations efficiently. Therefore, we propose an active evolutionary reduced Gaussian Process framework ( AER-GP ) for fast and large-scale full-field reliability analysis and critical domain prognosis, utilizing only a few initial samples. In which we first define a novel probability indicator of erroneously evaluating the sign of the minimum of the full-field limit state function. Based on this, we then develop an efficient convergence criterion that relies on the expected error in failure probability estimates. Furthermore, we advance the dual order-reduced Gaussian process coupled Monte Carlo methods to accurately predict the large-scale full-field stochastic response under material and load uncertainty. Where the preliminary design of experiments starts from a significantly small number of sets (e.g.,5), and is progressively added by those samples containing the most information to distinguish the failure boundary. More importantly, we propose a novel mechanism for structural critical domain prognosis mechanism based on the failure probability of each single material point within the entire field, and make accurate critical domain prognosis. Real-world examples, including a car wheel hub and a single-tower cable-stayed bridge, demonstrate that the proposed algorithm achieves high prediction accuracy, computational efficiency, and robustness in large-scale structural reliability analysis and critical domain prognosis. It consistently outperforms widely used methods such as AK-MCS, EFF-MCS, ERF-MCS, and H-MCS. Notably, the proposed AER-GP method requires only a small number of initial DoE samples (fewer than 40), and through adaptive learning, it can reliably produce results with very low errors (typically less than 2%).}, archive = {J_CMAME}, author = {Xinlong Li and Chensen Ding}, doi = {10.1016/j.cma.2025.118418}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118418}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Active evolutionary gaussian process for structural large-scale full-field reliability analysis and critical domain prognosis with only few initial samples}, volume = {448}, year = {2026}, }
• (2026). Mixed-dimensional analysis for coupling 2D elastodynamics and timoshenko beam. CMAME, 448, 118416. (www)

  @article{ , abstract = {Wave propagation is considered in a two-dimensional (2D) elastic structure, which includes a relatively small region whose behavior is fully 2D and a long and slender region whose bending behavior is like that of a Timoshenko beam. To save in computational effort, the latter region is reduced to a genuinely one-dimensional (1D) Timoshenko beam. The mathematical and computational problem posed then involves the coupling of the two regions, such that a well-posed, accurate, numerically stable and efficient hybrid 2D-elastic-Timoshenko-beam model is formed. The appropriate interface conditions are derived, and the well-posedness of the time-dependent problem is proved. A new computational coupling method is proposed, where the shape functions associated with the axial degrees of freedom on the interface of the elastic solid are modified in a special manner, to allow for the rotation continuity. The method results in a symmetric, positive and stable finite element formulation. Numerical examples are presented which demonstrate the performance of the scheme.}, archive = {J_CMAME}, author = {Daniel Rabinovich and Abimael F.D. Loula and Dan Givoli}, doi = {10.1016/j.cma.2025.118416}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118416}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Mixed-dimensional analysis for coupling 2D elastodynamics and timoshenko beam}, volume = {448}, year = {2026}, }
• (2026). Variable stiffness boundary condition to determine effective toughness of heterogeneous materials. CMAME, 448, 118414. (www)

  @article{ , abstract = {We present a computational framework that combines a variable stiffness boundary condition (VSBC) with a phase-field model to evaluate the effective fracture toughness of heterogeneous materials. It is built on the so-called surfing boundary condition (SBC) that applies nonuniform displacement at the remote boundary to stabilize crack-propagation in a heterogeneous medium. Unlike SBC, VSBC is easily implementable in traditional universal testing machines and commercial software packages. The VSBC passively translates a simple, uniform remote displacement into a non-uniform load via an engineered stiffness gradient, enabling the stable, natural propagation of cracks along energetically favorable paths. The framework is validated on homogeneous materials, where the calculated J -integral precisely matches the prescribed fracture toughness. When applied to heterogeneous domains, the VSBC method successfully quantifies the increase in effective toughness due to stiffness and toughness contrasts and captures the critical transition from crack penetration to deflection. Experimental validation using 3D-printed samples confirms the model’s predictive capability. The VSBC framework provides a robust easily accessible tool for investigating fracture in complex materials and guide the design of advanced, fracture-resistant composites.}, archive = {J_CMAME}, author = {Tengyuan Hao and Adrian Piel and Zubaer Hossain}, doi = {10.1016/j.cma.2025.118414}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118414}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Variable stiffness boundary condition to determine effective toughness of heterogeneous materials}, volume = {448}, year = {2026}, }
• (2026). Graph neural network surrogates for contacting deformable bodies with necessary and sufficient contact detection. CMAME, 448, 118413. (www)

  @article{ , abstract = {Surrogate models for the rapid inference of nonlinear boundary value problems in mechanics are helpful in a broad range of engineering applications. However, effective surrogate modeling of applications involving the contact of deformable bodies, especially in the context of varying geometries, is still an open issue. In particular, existing methods are confined to rigid body contact or, at best, contact between rigid and soft objects with well-defined contact planes. Furthermore, they employ contact or collision detection filters that serve as a rapid test but use only the necessary and not sufficient conditions for detection. In this work, we present a graph neural network architecture that utilizes continuous collision detection and, for the first time, incorporates sufficient conditions designed for contact between soft deformable bodies. We test its performance on two benchmarks, including a problem in soft tissue mechanics of predicting the closed state of a bioprosthetic aortic valve. We find a regularizing effect on adding additional contact terms to the loss function, leading to better generalization of the network. These benefits hold for simple contact at similar planes and element normal angles, and complex contact at differing planes and element normal angles. We also demonstrate that the framework can handle varying reference geometries. However, such benefits come with high computational costs during training, resulting in a trade-off that may not always be favorable. We quantify the training cost and the resulting inference speedups on various hardware architectures. Importantly, our graph neural network implementation results in up to a hundred- to thousand-fold speedup on GPU, and twenty- to two hundred-fold speedup on CPU for our benchmark problems at inference.}, archive = {J_CMAME}, author = {Vijay K. Dubey and Collin E. Haese and Osman Gültekin and David Dalton and Manuel K. Rausch and Jan Fuhg}, doi = {10.1016/j.cma.2025.118413}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118413}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Graph neural network surrogates for contacting deformable bodies with necessary and sufficient contact detection}, volume = {448}, year = {2026}, }
• (2026). Personalized multiscale modeling of left atrial mechanics and blood flow. CMAME, 448, 118412. (www)

  @article{ , abstract = {We present a personalized multiscale mechanics model of the left atrium (LA) to simulate its deformation throughout the cardiac cycle and drive blood flow. Our patient data-driven model tightly integrates 3D structural mechanics of the LA myocardium, incorporating both passive and active components, with a 0D closed-loop lumped parameter network (LPN)-based circulatory system model. A finite element (FE) model of LA tissue is constructed from the patient’s images, assuming uniform thickness and employing rule-based fiber directions. We then adopted a multi-step personalization approach, in which the LPN parameters with a surrogate LA model are first optimized to match cuff-based blood pressures and cardiac lumen volumes derived from time-resolved 3D gated computed tomography angiography (CTA) images. The surrogate LA pressure during passive expansion is used to estimate myocardial passive mechanics parameters and the reference unloaded configuration using an inverse finite element analysis (iFEA) framework. Finally, a robust multiscale coupling is applied between the iFEA-optimized FE model and the tuned 0D LPN model to characterize LA contraction. This effectively captures the physiological LA pressure-volume curve and reasonably aligns with the image-based cavity volumes and deformation. We then imposed the resulting simulation-predicted deformation as a moving-wall boundary condition to model atrial hemodynamics. We analyzed the model sensitivities to various simplifications to demonstrate its robustness and versatility and discussed potential future improvements. Overall, this comprehensive digital twinning platform could be applied to study LA biomechanics in health and disease and assist in devising personalized treatment plans.}, archive = {J_CMAME}, author = {Lei Shi and Boyang Gan and Ian Y. Chen and Vijay Vedula}, doi = {10.1016/j.cma.2025.118412}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118412}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Personalized multiscale modeling of left atrial mechanics and blood flow}, volume = {448}, year = {2026}, }
• (2026). Quantum neural network-assisted topology optimization: Concept and implementation with parameterized quantum circuits. CMAME, 448, 118411. (www)

  @article{ , abstract = {This study proposes a quantum machine learning-assisted approach to accelerating density-based topology optimization using quantum neural network (QNN), a class of trainable models based on parameterized quantum circuits (PQCs). The proposed framework extracts key features from classical data, starting by encoding the corresponding finite element analysis results, i.e., strain energy, sensitivity, and design variables from early design iterations obtained using the standard optimizer. Then, the PQCs are fine-tuned using minimization of the binary cross-entropy loss function, enabling the model to learn the mapping between input features and optimal design. Specifically, the framework consists of two main stages. First, an offline training stage where the QNN is calibrated using precomputed iterative results from a relatively coarse mesh obtained through the standard optimizer, establishing pattern recognition between input features and the final design variables. The second is an online stage where the trained QNN model is integrated with the standard optimizer to accelerate the final design. Numerical results show that QNN requires only a small number of qubits, and once trained on coarse meshes with several different boundary conditions, can effectively integrate with standard optimizers to predict target designs across various configurations, including different resolutions, volume constraints, and loading conditions. Furthermore, the proposed QNN-assisted framework significantly reduces computational time compared to standard iterative approaches, laying the groundwork for solving large-scale problems with near-term quantum computers.}, archive = {J_CMAME}, author = {Naruethep Sukulthanasorn and Kenjiro Terada}, doi = {10.1016/j.cma.2025.118411}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118411}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Quantum neural network-assisted topology optimization: Concept and implementation with parameterized quantum circuits}, volume = {448}, year = {2026}, }
• (2026). Generative emulation of chaotic dynamics with coherent prior. CMAME, 448, 118410. (www)

  @article{ , abstract = {Data-driven emulation of nonlinear dynamics is challenging due to long-range skill decay that often produces physically unrealistic outputs. Recent advances in generative modeling aim to address these issues by providing uncertainty quantification and correction. However, the quality of generated simulation remains heavily dependent on the choice of conditioning prior. In this work, we present an efficient generative framework for nonlinear dynamics emulation, connecting principles of turbulence with diffusion-based modeling: Cohesion. Our method estimates large-scale coherent structure of the underlying dynamics as guidance during the denoising process, where small-scale fluctuation in the flow is then resolved. These coherent prior are efficiently approximated using reduced-order models, such as deep Koopman operators, that allow for rapid generation of long prior sequences while maintaining stability over extended forecasting horizon. With this gain, we can reframe forecasting as trajectory planning, a common task in reinforcement learning, where conditional denoising is performed once over entire sequences, minimizing the computational cost of autoregressive-based generative methods. Numerical evaluations on chaotic systems of increasing complexity, including Kolmogorov flow, shallow water equations, and subseasonal-to-seasonal climate dynamics, demonstrate Cohesion superior long-range forecasting skill that can efficiently generate physically-consistent simulations, even in the presence of partially-observed guidance.}, archive = {J_CMAME}, author = {Juan Nathaniel and Pierre Gentine}, doi = {10.1016/j.cma.2025.118410}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118410}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Generative emulation of chaotic dynamics with coherent prior}, volume = {448}, year = {2026}, }
• (2026). Concurrent 3D topology optimization method for hierarchical hybrid structures under static and dynamic loads with CPU-GPU heterogeneous parallelism. CMAME, 448, 118408. (www)

  @article{ , abstract = {Topology optimization of 3D hierarchical hybrid structures (HHS) is constrained by the coupling of high-dimensional design spaces and multiscale computational complexity, often addressed by restricting certain designable components, which limits the full exploration of the design space and realization of performance potential. This paper proposes a novel concurrent topology optimization method for 3D-HHS, achieving concurrent optimization of all designable components, including macroscopic topology, substructural topology, and their spatial distribution, under static and dynamic loads. This approach significantly expands the design space, enhancing the mechanical performance of hierarchical structures. To address the computational challenges of large-scale 3D problems, we employ CPU-GPU heterogeneous parallel computing to improve the efficiency of structural response and sensitivity analysis. Numerical examples demonstrate that this method delivers superior 3D-HHS designs with markedly improved optimization efficiency, providing an innovative solution for efficient 3D structural optimization.}, archive = {J_CMAME}, author = {Yunfei Liu and Ruxin Gao and Ying Li and Daining Fang}, doi = {10.1016/j.cma.2025.118408}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118408}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Concurrent 3D topology optimization method for hierarchical hybrid structures under static and dynamic loads with CPU-GPU heterogeneous parallelism}, volume = {448}, year = {2026}, }
• (2026). Tensegrity structures and data-driven analysis for 3D cell mechanics. CMAME, 448, 118406. (www)

  @article{ , abstract = {The cytoskeleton (CSK) plays an important role in many cell functions. Given the similarities between the mechanical behavior of tensegrity structures and the CSK, many studies have proposed different tensegrity-based models for simulating cell mechanics. However, the low symmetry of most tensegrity units has hindered the analysis of realistic 3D structures. As a result, tensegrity-based modeling in cell mechanics has been mainly focused on single cells or monolayers. In this paper, we propose a 3D tensegrity model based on the finite element method for simulating 3D cell mechanics. We show that the proposed model not only captures the nonlinearity of a single cell in an indentation test and a monolayer in stretch test but also the non-uniform stress distribution in multicellular spheroids upon non-uniform prestress design. Furthermore, we introduce a multiscale data-driven framework for cellular mechanics to optimize the computation, thus paving the way for modeling the mechanobiology of large cellular assemblies such as organs.}, archive = {J_CMAME}, author = {Ziran Zhou and Jacinto Ulloa and Guruswami Ravichandran and José E. Andrade}, doi = {10.1016/j.cma.2025.118406}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118406}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Tensegrity structures and data-driven analysis for 3D cell mechanics}, volume = {448}, year = {2026}, }
• (2026). Configuration-decoupled concurrent topology optimization of heterogeneous lattice structures. CMAME, 448, 118405. (www)

  @article{ , abstract = {Multi-configuration lattice structures have recently been introduced into structural optimization due to their broadly tunable physical properties. Traditional methods for multi-configuration lattice optimization employ extreme strategies of complete fusion or separation, leading to a trade-off between optimality and scalability that has not been fully addressed in the existing literature. The paper suggests decomposing the lattice library into pairs of lattices, through which multi-configuration lattice optimization is decoupled into the concurrent optimization of iso-value, combination category, and ratio within combination. A novel hybrid interpolation scheme is proposed to describe the effective mechanical behavior of the configuration-decoupled lattices. In this approach, polynomial models are employed to characterize the performance of individual lattice combinations, while the Uniform Multiphase Materials Interpolation model is used to integrate the contributions of all combinations. Benchmark experiments, including full-scale simulations, are conducted to validate the effectiveness of the framework. The proposed method enables rapid convergence to configuration layouts that align with the principal stress orientations. Compared to single- and dual-configuration designs, it achieves compliance reductions of 61.0 % and 26.2 %, respectively, approaching the performance of density-based topology optimization. Extended numerical experiments reveal the joint influence of resolution and configuration count on the overall performance. This method achieves a better trade-off between optimality and extensibility, enabling more flexible utilization of large lattice databases in practical engineering fields.}, archive = {J_CMAME}, author = {Xinze Shen and Changdong Zhang and Wenhe Liao and Dawei Li and Tingting Liu}, doi = {10.1016/j.cma.2025.118405}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118405}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Configuration-decoupled concurrent topology optimization of heterogeneous lattice structures}, volume = {448}, year = {2026}, }
• (2026). Intrepid MCMC: Metropolis-hastings with exploration. CMAME, 448, 118402. (www)

  @article{ , abstract = {In engineering examples, one often encounters the need to sample from unnormalized distributions with complex shapes that may also be implicitly defined through a physical or numerical simulation model, making it computationally expensive to evaluate the associated density function. For such cases, MCMC has proven to be an invaluable tool. Random-walk Metropolis Methods (also known as Metropolis-Hastings (MH)), in particular, are highly popular for their simplicity, flexibility, and ease of implementation. However, most MH algorithms suffer from significant limitations when attempting to sample from distributions with multiple modes (particularly disconnected ones). In this paper, we present Intrepid MCMC - a novel MH scheme that utilizes a simple coordinate transformation to significantly improve the mode-finding ability and convergence rate to the target distribution of random-walk Markov chains while retaining most of the simplicity of the vanilla MH paradigm. Through multiple examples, we showcase the improvement in the performance of Intrepid MCMC over vanilla MH for a wide variety of target distribution shapes. We also provide an analysis of the mixing behavior of the Intrepid Markov chain, as well as the efficiency of our algorithm for increasing dimensions. A thorough discussion is presented on the practical implementation of the Intrepid MCMC algorithm. Finally, its utility is highlighted through a Bayesian parameter inference problem for a two-degree-of-freedom oscillator under free vibration.}, archive = {J_CMAME}, author = {Promit Chakroborty and Michael D. Shields}, doi = {10.1016/j.cma.2025.118402}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118402}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Intrepid MCMC: Metropolis-hastings with exploration}, volume = {448}, year = {2026}, }
• (2026). Two-level overlapping additive schwarz preconditioner for training scientific machine learning applications. CMAME, 448, 118400. (www)

  @article{ , abstract = {We introduce a novel two-level overlapping additive Schwarz preconditioner for accelerating the training of scientific machine learning applications. The design of the proposed preconditioner is motivated by the nonlinear two-level overlapping additive Schwarz preconditioner. The neural network parameters are decomposed into groups (subdomains) with overlapping regions. In addition, the network’s feed-forward structure is indirectly imposed through a novel subdomain-wise synchronization strategy and a coarse-level training step. Through a series of numerical experiments, which consider physics-informed neural networks and operator learning approaches, we demonstrate that the proposed two-level preconditioner significantly speeds up the convergence of the standard (LBFGS) optimizer while also yielding more accurate machine learning models. Moreover, the devised preconditioner is designed to take advantage of model-parallel computations, which can further reduce the training time.}, archive = {J_CMAME}, author = {Youngkyu Lee and Alena Kopaničáková and George Em Karniadakis}, doi = {10.1016/j.cma.2025.118400}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118400}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Two-level overlapping additive schwarz preconditioner for training scientific machine learning applications}, volume = {448}, year = {2026}, }
• (2026). A cohesive zone treatment for the material point method involving problems of large deformation and damage. CMAME, 448, 118399. (www)

  @article{ , abstract = {A new algorithm is described that permits the use of cohesive zones in the material point method for problems involving large deformation and fracture. In contrast to previous cohesive zone implementations, this method does not utilize massless surface-element particles. Instead, cohesive tractions are computed using the shape function mappings from a reference grid configuration in combination with explicitly defined particle surface normals and surface positions. These normals and relative surface positions are updated each time step according to particle deformation. The tractions are converted to cohesive forces using the nodal areas and mapped back to particles using the same reference shape function mappings. These forces are then remapped by conventional particle-to-grid interpolation as external forces using the current-configuration shape-function mappings. This allows highly compliant cohesive zones to function over jump displacements larger than a grid cell. Upon damage, these interfaces can revert to conventional multi-field contact surfaces. This approach is general and readily applies to two and three dimensions as well as being compatible with damage-field gradient partitioning offering exceptional computational flexibility. The framework for this method enables other capabilities, such as improved contact precision using explicitly defined surface normals and positions, and a method to mitigate spurious material damage at weak discontinuities between stiff brittle materials and soft or compliant materials.}, archive = {J_CMAME}, author = {Cameron M. Crook and Michael A. Homel}, doi = {10.1016/j.cma.2025.118399}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118399}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {A cohesive zone treatment for the material point method involving problems of large deformation and damage}, volume = {448}, year = {2026}, }
• (2026). Overlapping schwarz preconditioners for isogeometric discretizations of acoustic wave problems. CMAME, 448, 118397. (www)

  @article{ , abstract = {The aim of this work is to construct and analyze two-level overlapping additive Schwarz (OAS) preconditioners for isogeometric discretizations of the acoustic wave equation with absorbing boundary conditions. Both Collocation and Galerkin isogeometric methods are employed for space discretization, while time advancing is performed by means of a Newmark implicit scheme. The linear systems to be solved at each time step are ill conditioned, especially in case of highly regular splines, thus their solution requires the use of effective preconditioners. Two-level OAS solvers consist of partitioning the domain into overlapping subdomains, solving independent local problems on each subdomain and an additional coarse problem associated with the subdomain mesh. Several two-dimensional numerical results validate our theoretical estimates, showing the scalability and quasi-optimality of the algorithms proposed. We also investigate numerically the robustness of the OAS preconditioners with respect to the spline polynomial degree, the spline regularity and the overlap parameter.}, archive = {J_CMAME}, author = {Elena Zampieri and Simone Scacchi and Luca F. Pavarino}, doi = {10.1016/j.cma.2025.118397}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118397}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Overlapping schwarz preconditioners for isogeometric discretizations of acoustic wave problems}, volume = {448}, year = {2026}, }
• (2026). Latent space modeling of parametric and time-dependent PDEs using neural ODEs. CMAME, 448, 118394. (www)

  @article{ , abstract = {Partial Differential Equations (PDEs) are central to science and engineering. Since solving them is computationally expensive, a lot of effort has been put into approximating their solution operator via both traditional and recently increasingly Deep Learning (DL) techniques. In this paper, we propose an autoregressive and data-driven method using the analogy with classical numerical solvers for time-dependent, parametric and (typically) nonlinear PDEs. We present how Dimensionality Reduction (DR) can be coupled with Neural Ordinary Differential Equations (NODEs) in order to learn the solution operator of arbitrary PDEs accounting both for (continuous) time and parameter dependency. The idea of our work is that it is possible to map the high-fidelity (i.e., high-dimensional) PDE solution space into a reduced (low-dimensional) space, which subsequently exhibits dynamics governed by a (latent) Ordinary Differential Equation (ODE). Solving this (easier) ODE in the reduced space allows avoiding solving the PDE in the high-dimensional solution space, thus decreasing the computational burden for repeated calculations for e.g., uncertainty quantification or design optimization purposes. The main outcome of this work is the importance of exploiting DR as opposed to the recent trend of building large and complex architectures: we show that by leveraging DR we can deliver not only more accurate predictions, but also a considerably lighter and faster DL model compared to existing methodologies.}, archive = {J_CMAME}, author = {Alessandro Longhi and Danny Lathouwers and Zoltán Perkó}, doi = {10.1016/j.cma.2025.118394}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118394}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Latent space modeling of parametric and time-dependent PDEs using neural ODEs}, volume = {448}, year = {2026}, }
• (2026). Geometry-agnostic model reduction with GNN-generated reduced POD bases and boosted PGD enrichment for (non)linear structural elastodynamics. CMAME, 448, 118357. (www)

  @article{ , abstract = {This contribution proposes a new and significantly enhanced extension of a recently-introduced hybrid Graph Neural Network (GNN)-based reduced-order modeling approach for the numerical solution of time-dependent partial differential equations on non-parametric finite element meshes. Building upon previous proof-of-concept work, this more generalized framework presents a number of key novelties: tight integration of graph-based learning with physical information via direct imposition of finite element operators as node and edge level features; introduction of a Grassmannian subspace distance measure as a dedicated training objective; incorporation of a Gated Recurrent Unit (GRU) for a more efficient and lightweight architecture; hybridization with other Galerkin-based reduced-order methods such as the Proper Orthogonal Decomposition (POD); and a first treatment of nonlinear problems. A novel, on-the-fly enrichment mechanism, modified from a classical Proper General Decomposition (PGD) and dubbed ”Boosted PGD”, is additionally introduced to improve prediction accuracy at low computational cost via additional greedy corrective modes. The efficacy of the overall methodology is assessed on two challenging datasets featuring significant geometric and topological variations that include highly heterogeneous spatial discretizations. A variety of performance studies demonstrate very competitive accuracy and computational cost in simulating highly-dynamic behavior when compared to conventional full-order finite element models, including a remarkable capacity to generalize to configurations well outside of the topological scope of the original training and validation sets. Results imply that solvers constructed from such an approach may enable more scalable and robust mechanical simulations for complex, real-world engineering applications related to iterative design.}, archive = {J_CMAME}, author = {Victor Matray and David Néron and Frédéric Feyel and Faisal Amlani}, doi = {10.1016/j.cma.2025.118357}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118357}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Geometry-agnostic model reduction with GNN-generated reduced POD bases and boosted PGD enrichment for (non)linear structural elastodynamics}, volume = {448}, year = {2026}, }
• (2026). Weighted eigenseparation-based residual approach for model reduction of interface failure in heterogeneous materials. CMAME, 448, 118352. (www)

  @article{ , abstract = {Interface failure plays a critical role in the degradation of heterogeneous materials, often governing structural integrity across a range of applications from fiber-reinforced composites to polycrystalline rocks. This paper introduces a novel model reduction framework—the Weighted Eigenseparation-based Residual (WER) approach—for efficiently simulating interface failure using cohesive zone models. Two variants of the WER are developed: a force-based formulation that weakly enforces equilibrium equations at the interface at the modal level and a separation-based formulation that weakly enforces contact conditions at the modal level. These formulations are supported by precomputed influence functions within representative volume elements (RVEs), significantly reducing computational cost while preserving accuracy. The separation-based variant, in particular, demonstrates broad applicability across microstructures with interface junctions. Numerical examples in two and three dimensions—including fiber composites and geological microstructures—demonstrate the effectiveness, convergence behavior, and computational advantages of the WER over direct numerical simulations. The results show that high-fidelity predictions can be obtained even with coarsely discretized interface modes, confirming the robustness and versatility of the WER methodology.}, archive = {J_CMAME}, author = {Jacob Fish and Junhe Cui}, doi = {10.1016/j.cma.2025.118352}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118352}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Weighted eigenseparation-based residual approach for model reduction of interface failure in heterogeneous materials}, volume = {448}, year = {2026}, }
• (2026). Stretch-based hyperelastic electromechanical constitutive metamodels via gradient enhanced gaussian predictors using hierarchical structure discovery. CMAME, 448, 118349. (www)

  @article{ , abstract = {This paper introduces a new approach to developing electromechanical constitutive metamodels via the use of Gradient Enhanced Gaussian Predictors (Kriging). The formulation uses principal stretches for the isotropic mechanics, invariants for the electrostatics and coupling terms, and accounts for anisotropy through the relevant inclusion of anisotropic invariants associated with a respective symmetry integrity basis. Three novelties are presented in this paper. The first is the use of orthogonal projections to identify the most appropriate set of inputs - related to material anisotropy - for use in the metamodel. By projecting the stress and electric field data into several derivative bases - defined for each anisotropic class - and then reconstructing the quantities, the errors in reconstruction can be assessed thus inferring the most appropriate class of anisotropy. Furthermore, the procedure forms a pre-processing stage and is particularly useful when an underlying model is completely unknown as seen when modelling Relative Volume Elements. The second novelty arises from the use of a hybrid formulation, namely the principal stretches for isotropic mechanics and the electromechanical anisotropic invariants. This is beneficial during the projection procedure in reducing the cases where the projection matrix becomes singular but requires careful development of the correlation function to maintain physical symmetry conditions. Thirdly, the electromechanical metamodels are calibrated upon the concentric styled data before being integrated within a Finite Element framework and tested upon a range of challenging simulations including bending actuators with induced torsion, frilling due to bending with selected electrode placement, as well as buckling plates tested with three rank-one laminate materials with increasing levels of anisotropy due to physical contrasts. The successful calibration and implementation of the metamodels can be witnessed amongst the wide range of presented numerical examples.}, archive = {J_CMAME}, author = {Nathan Ellmer and Rogelio Ortigosa and Jesús Martínez-Frutos and Roman Poya and Johann Sienz and Antonio J. Gil}, doi = {10.1016/j.cma.2025.118349}, journal = {Computer Methods in Applied Mechanics and Engineering}, month = {1}, pages = {118349}, shortjournal = {Comput. Meth. Appl. Mech. Eng.}, title = {Stretch-based hyperelastic electromechanical constitutive metamodels via gradient enhanced gaussian predictors using hierarchical structure discovery}, volume = {448}, year = {2026}, }

COMCOM - 11

• (2025). An effective method for data aggregation point placement in LoRaWAN network for smart metering service. COMCOM, 243, 108335. (www)

  @article{ , abstract = {Electric grids have been restructured with Smart Grids (SGs), and the deployment of Advanced Metering Infrastructure (AMI) systems is a fundamental part of this process. An AMI system consists of Smart Meters (SMs) that collect energy consumption data and send it to the utility company through Data Aggregation Points (DAPs). Thus, methods to determine the appropriate quantity and positions of DAPs become necessary. In this context, this paper proposes a method called DAP Placement (DPlace), which determines the minimum number of DAPs and applies the Fuzzy C-Means algorithm to position the DAPs at coordinates that enhance the successful reception of packets, ensuring that smart metering applications can adequately transmit data through a Long Range Wide-Area Network (LoRaWAN) network. The proposed method is compared to three state-of-the-art solutions through simulations, and the results show that the DPlace method reduces the required number of DAPs by up to 37.04% while achieving communication performance – evaluated through metrics such as packet delivery ratio and delay – similar to related methods, even with less DAPs.}, archive = {J_COMCOM}, author = {Thiago A.R. da Silva and Geraldo A. Sarmento N. and Luís H. de O. Mendes and Pedro F. de Abreu and Artur F. da S. Veloso and Fernando J.V. Santos and José Valdemir dos R. Júnior}, doi = {10.1016/j.comcom.2025.108335}, journal = {Computer Communications}, month = {11}, pages = {108335}, shortjournal = {Comput. Commun.}, title = {An effective method for data aggregation point placement in LoRaWAN network for smart metering service}, volume = {243}, year = {2025}, }
• (2025). META: Multi-classified encrypted traffic anomaly detection with fine-grained flow and interaction analysis. COMCOM, 243, 108333. (www)

  @article{ , abstract = {The pervasive implementation of encryption mechanisms has introduced considerable obstacles to anomalous traffic detection, rendering conventional attack detection methodologies that rely on packet payload characteristics ineffectual. In the absence of plaintext information, current anomaly encrypted traffic detection mainly relies on traffic data analysis to identify and characterize anomalous attack patterns in encrypted traffic, employing machine learning or deep learning models. However, the existing methods still suffer from limited detection capabilities, especially the ability to classify multi-class attacks due to insufficient internal and external features. In this paper, we propose a Multi-classified Encrypted Traffic Anomaly Detection (META) method. META refines and extends the available feature dimensions in encrypted traffic by leveraging two key aspects: the internal interaction behavior information within the traffic and the external interaction behavior information in network topology. Specifically, an in-depth examination of the internal packet interaction features is undertaken, resulting in a novel feature set, designated as META-Features, encompassing 278 fine-grained statistical features. Furthermore, a Graph Neural Network (GNN) is employed to learn the external interaction behavior in the network topology from the embedding of the IP node graph and flow edge graph. The results of the experiments demonstrate that the refined feature set META-Features significantly enhances the model’s detection capabilities. Thereby, the META-GNN model exhibits superior performance compared to the traditional approaches, with an accuracy of 91.90% and an F1-score of 87.41%.}, archive = {J_COMCOM}, author = {Boyu Kuang and Yuchi Chen and Yansong Gao and Yaqian Xu and Anmin Fu and Willy Susilo}, doi = {10.1016/j.comcom.2025.108333}, journal = {Computer Communications}, month = {11}, pages = {108333}, shortjournal = {Comput. Commun.}, title = {META: Multi-classified encrypted traffic anomaly detection with fine-grained flow and interaction analysis}, volume = {243}, year = {2025}, }
• (2025). Evaluating scalability of median-based ADR under different mobility conditions. COMCOM, 243, 108322. (www)

  @article{ , abstract = {The LoRaWAN protocol is widely used in Internet of Things (IoT) applications due to its ability to provide long-range, low-power communication. The Adaptive Data Rate (ADR) mechanism dynamically adjusts transmission parameters to optimize energy consumption. However, ADR is primarily designed for static devices, which limits its effectiveness in mobile environments, where fluctuating signal conditions can degrade performance. To address this limitation, the Median-Based ADR (MB-ADR) scheme was introduced, leveraging statistical measures to improve ADR adaptability to changing channel conditions. This study evaluates the scalability of MB-ADR in networks with up to 1,000 end devices and node speeds of up to 20 m/s, considering mobility models such as Random Walk and Gauss–Markov. The results show that MB-ADR demonstrates superior performance in scenarios with realistic mobility patterns, particularly under the Steady-State Random Waypoint model, resulting in improvements of up to 15% in Packet Delivery Ratio (PDR) and 55% in energy efficiency compared to a Kalman filter-based scheme under the same mobility model. Additionally, the analysis demonstrates the effectiveness of MB-ADR in improving throughput and reducing collisions by promoting an efficient distribution of spreading factors. Overall, the study confirms the potential of MB-ADR to enhance communication reliability and energy efficiency in mobile IoT networks, making it a viable solution for large-scale, high-density IoT deployments with variable mobility.}, archive = {J_COMCOM}, author = {Geraldo A. Sarmento Neto and Thiago A.R. da Silva and Artur F. da S. Veloso and Pedro Felipe de Abreu and Luis H. de O. Mendes and J. Valdemir dos Reis Jr}, doi = {10.1016/j.comcom.2025.108322}, journal = {Computer Communications}, month = {11}, pages = {108322}, shortjournal = {Comput. Commun.}, title = {Evaluating scalability of median-based ADR under different mobility conditions}, volume = {243}, year = {2025}, }
• (2025). Revisiting the problem of optimizing spreading factor allocations in LoRaWAN: From theory to practice. COMCOM, 243, 108321. (www)

  @article{ , abstract = {This paper revisits the problem of optimizing LoRa network success probability by proposing an optimized allocation strategy for Spreading Factors (SFs) under both uniform and Gaussian network deployments with a single or multiple gateways. More specifically, we solve the problem of finding the best SF allocations in dense network deployments whose EDs are first assigned with the minimum SF. Theoretical models are developed to quantify the success probability of transmissions, considering the capture effect as well as intra- and inter-SF interference. A mathematical optimization framework is introduced to determine the optimal SF distribution that maximizes the average probability of packet reception. The problem is solved using Mixed Integer Linear Programming (MILP), and then evaluated using simulations. Even though optimal SF allocation strategies have been proposed in the literature, no practical insights have been discovered and no real-world deployments have been considered. To this extent, the practical benefits of using improved or optimal SF settings are discovered in this paper. Simulation results confirm the theoretical findings while they demonstrate an up to 10 percentage points improvements in Packet Reception Ratio (PRR) in the real-world use-case.}, archive = {J_COMCOM}, author = {Dimitrios Zorbas and Aruzhan Sabyrbek and Luigi Di Puglia Pugliese}, doi = {10.1016/j.comcom.2025.108321}, journal = {Computer Communications}, month = {11}, pages = {108321}, shortjournal = {Comput. Commun.}, title = {Revisiting the problem of optimizing spreading factor allocations in LoRaWAN: From theory to practice}, volume = {243}, year = {2025}, }
• (2025). Energy consumption optimization in UAV-assisted multi-layer mobile edge computing with active transmissive RIS. COMCOM, 243, 108320. (www)

  @article{ , abstract = {Unmanned Aerial Vehicle (UAV)-assisted edge computing provides low-latency and low-energy consumption computing capabilities for sparsely distributed Internet of Things (IoT) networks. In addition, the assisted UAVs provide line-of-sight links to further improve communication quality. However, the existing offloading strategies have low efficiency and high costs. Motivated by this, we propose a novel UAV-assisted multi-layer mobile edge computing network with active transmissive reconfigurable intelligent surface (RIS). The introduced an active transmissive RIS not only receives data from UAVs but also performs computing functionality. We establish an optimization to minimize the total system energy consumption under delay constraints by jointly planning UAV positions and allocating computing bits, sub-carriers, time slots, transmission power, and RIS transmission coefficient. To tackle this problem, we first use the block coordinate descent (BCD) algorithm to decouple it into four sub-problems. Then, we solve them by adopting successive convex approximation (SCA), difference-convex (DC) programming, and introducing slack variables. Experimental results demonstrate that the proposed network is superior to the other five baselines concerning energy consumption reduction. Also, the influences of system parameters are verified, including the number of IoT devices, the number of RIS elements, and the delay threshold.}, archive = {J_COMCOM}, author = {Kexin Yang and Yaxi Liu and Boxin He and Jiahao Huo and Wei Huangfu}, doi = {10.1016/j.comcom.2025.108320}, journal = {Computer Communications}, month = {11}, pages = {108320}, shortjournal = {Comput. Commun.}, title = {Energy consumption optimization in UAV-assisted multi-layer mobile edge computing with active transmissive RIS}, volume = {243}, year = {2025}, }
• (2025). RIS-assisted LoRa networks with diversity: Impact of hardware impairments and phase noise. COMCOM, 243, 108319. (www)

  @article{ , abstract = {This paper investigates the performance of downlink LoRa networks assisted by reconfigurable intelligent surfaces (RIS) and diversity techniques. We derive closed-form expressions for the coverage probability (Pcov) under four scenarios: phase noise at the RIS only, hardware impairments at both the gateway and end devices (EDs), the combined effect of both impairments, and an ideal benchmark case. The analysis is carried out within a unified framework that is valid for any number of RIS elements, providing key insights into the influence of hardware impairment levels, gateway transmit power, and the diversity order as the number of RIS elements grows large. The results reveal that coverage probability improves with transmit power but deteriorates under more severe hardware impairments, while the diversity order scales directly with the number of RIS elements. Monte Carlo simulations validate the analytical findings and confirm that the ideal scenario achieves the best performance, followed in order by the phase noise, hardware impairment, and combined impairment cases.}, archive = {J_COMCOM}, author = {Thi-Phuong-Anh Hoang and Thien Huynh-The and Tien Hoa Nguyen and Trong-Thua Huynh and Nguyen-Son Vo and Lam-Thanh Tu}, doi = {10.1016/j.comcom.2025.108319}, journal = {Computer Communications}, month = {11}, pages = {108319}, shortjournal = {Comput. Commun.}, title = {RIS-assisted LoRa networks with diversity: Impact of hardware impairments and phase noise}, volume = {243}, year = {2025}, }
• (2025). Channel-hopping sequence generation for blind rendezvous in cognitive radio-enabled internet of vehicles: A multi-agent twin delayed deep deterministic policy gradient-based method. COMCOM, 243, 108318. (www)

  @article{ , abstract = {Efficient spectrum utilization is a major challenge in highly dynamic vehicular environments due to the scarcity of spectrum resources. Cognitive Radio (CR) has emerged as a solution to improve spectrum utilization by enabling opportunistic access in IoV. In this context, channel-hopping based blind rendezvous offers a practical approach for decentralized spectrum access in CR-enabled IoV (CR-IoV). This paper presents a novel Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (MATD3PG)-based strategy for generating channel sequences in channel-hopping-based blind rendezvous. Unlike existing methods that overlook the quality of licensed spectrum, our approach ensures spectrum efficiency and QoS awareness in dynamic channel sequence generation. We formulate the channel sequence selection problem as a multi-objective optimization, aiming to maximize spectrum efficiency and minimize Time-To-Rendezvous (TTR) while meeting stringent latency and reliability requirements for vehicular communications. Each vehicle independently generates a channel-hopping sequence using a learning agent, which considers key channel quality metrics such as availability, reliability, and capacity. The generated sequences are employed in an asynchronous and asymmetric blind rendezvous process, enhancing adaptability to dynamic network conditions. Simulation results demonstrate that the proposed method significantly outperforms existing approaches, including Enhanced Jump-Stay (EJS), Single-radio Sunflower Set (SSS), Zero-type, One-type, and S-type (ZOS), Multi-Agent Q-Learning based Rendezvous (MAQLR), Exponential-weight algorithm for Exploration and Exploitation (Exp3), and Reinforcement Learning-based Channel-Hopping Rendezvous (RLCH) in terms of Expected TTR (ETTR), Maximum TTR (MTTR), delay, capacity, and reliability.}, archive = {J_COMCOM}, author = {Mehri Asadi Vasfi and Behrouz Shahgholi Ghahfarokhi}, doi = {10.1016/j.comcom.2025.108318}, journal = {Computer Communications}, month = {11}, pages = {108318}, shortjournal = {Comput. Commun.}, title = {Channel-hopping sequence generation for blind rendezvous in cognitive radio-enabled internet of vehicles: A multi-agent twin delayed deep deterministic policy gradient-based method}, volume = {243}, year = {2025}, }
• (2025). Tensor-based task allocation using multi-objective optimization in GECC environment. COMCOM, 243, 108316. (www)

  @article{ , abstract = {Green Edge-Cloud Computing (GECC) has emerged as a promising paradigm to meet the diverse requirements of modern applications by integrating edge and cloud resources. Existing task allocation strategies in GECC environment often fail to adequately address the problems of low resource utilization and high economic cost in multi-objective conflicts. Therefore, this paper proposes a tensor-based task allocation scheme using multi-objective optimization in GECC environment. We first extend the task allocation problem in GECC environment to a multi-objective optimization problem and construct five optimization models, i.e., energy, system reliability, quality of experience, economic cost, and latency. Then, to address the complex relationship among these objectives, we develop a tensor-based representation and calculation model for task allocation across cloud, edge service, and edge device platforms. Furthermore, we propose a tensor-based multi-objective beetle swarm optimization algorithm combined speed limiting and dynamic step strategies (TMOBSO-SLDS) that dynamically adjusts the step size and limit speed to improve the global search efficiency and the diversity of solution set. Extensive experimental results in various task allocation scenarios demonstrate that our proposed TMOBSO-SLDS algorithm outperforms existing approaches, as measured by the HV value. It can significantly enhance the diversity of the solution set and improve resource utilization.}, archive = {J_COMCOM}, author = {Huazhong Liu and Longtao Huang and Yuan Tian and Jihong Ding and Xiaoxue Yin and Guangshun Zhang}, doi = {10.1016/j.comcom.2025.108316}, journal = {Computer Communications}, month = {11}, pages = {108316}, shortjournal = {Comput. Commun.}, title = {Tensor-based task allocation using multi-objective optimization in GECC environment}, volume = {243}, year = {2025}, }
• (2025). A preemptive task unloading scheme based on second optional unloading in cloud-fog collaborative networks. COMCOM, 243, 108315. (www)

  @article{ , abstract = {Long-distance data transmission between Internet of Things (IoT) devices and remote cloud center often leads to unacceptable latency for certain tasks. Fog computing has emerged as a promising solution for low-latency tasks. Consequently, the concept of cloud-fog collaborative networks has garnered significant attention. However, existing research primarily focuses on heterogeneous tasks, overlooking the crucial aspect of considering both task priority and second unloading. To address this gap, this paper proposes a novel task unloading scheme that concurrently takes preemptive priority and second optional unloading into account. In this scheme, delay-sensitive tasks (DSTs) are given preemptive priority over delay-tolerant tasks (DTTs). Furthermore, some DTTs may undergo preprocessing in the fog layer to optimize resource utilization. Moreover, tasks encountering blocking or preemption in the fog layer can also be secondarily unloaded to the cloud layer. In this framework, we devise a four-dimensional Markov chain (4DMC) to model and analyze this process. Through numerical experiments, we assess performance indicators under various parameters. Ultimately, our proposed strategy is compared with the unloading scheme that does not incorporate second unloading through both numerical analysis and simulation validation. The results indicate that our scheme notably enhances the throughput of DTTs, albeit at a marginal performance trade-off.}, archive = {J_COMCOM}, author = {Yuan Zhao and Hongmin Gao and Shuaihua Liu}, doi = {10.1016/j.comcom.2025.108315}, journal = {Computer Communications}, month = {11}, pages = {108315}, shortjournal = {Comput. Commun.}, title = {A preemptive task unloading scheme based on second optional unloading in cloud-fog collaborative networks}, volume = {243}, year = {2025}, }
• (2025). ScaleIP: A hybrid autoscaling of VoIP services based on deep reinforcement learning. COMCOM, 243, 108314. (www)

  @article{ , abstract = {Adaptive resource provisioning has become crucial for cloud-based applications, especially those managing real-time traffic like Voice over IP (VoIP), which experience rapidly fluctuating workloads. Traditional static provisioning methods often fall short in these dynamic environments, leading to inefficiencies and potential service disruptions. Existing solutions struggle to maintain performance under varying traffic conditions, particularly for time-sensitive applications. This paper introduces ScaleIP, a hybrid autoscaling solution for containerized VoIP services that offers real-time adaptability and efficient resource management. ScaleIP leverages Deep Reinforcement Learning to make dynamic and efficient scaling decisions, improving call latency, increasing the number of successfully routed calls, and maximizing resource utilization. We evaluated ScaleIP through extensive experiments conducted on a real testbed utilizing the customer Call Detail Record (CDR) from 2023 provided by World Direct, encompassing over 89 million calls. The results show that ScaleIP consistently maintains call latency below 2 s, increases the number of successfully routed calls by 3.26 ×, and increases the resource utilization up to 60 % compared to state-of-the-art autoscaling methods.}, archive = {J_COMCOM}, author = {Zahra Najafabadi Samani and Juan Aznar Poveda and Dominik Gratz and Rene Hueber and Philipp Kalb and Thomas Fahringer}, doi = {10.1016/j.comcom.2025.108314}, journal = {Computer Communications}, month = {11}, pages = {108314}, shortjournal = {Comput. Commun.}, title = {ScaleIP: A hybrid autoscaling of VoIP services based on deep reinforcement learning}, volume = {243}, year = {2025}, }
• (2025). Beyond performance comparing the costs of applying deep and shallow learning. COMCOM, 243, 108312. (www)

  @article{ , abstract = {The rapid growth of mobile network traffic and the emergence of complex applications, such as self-driving cars and augmented reality, demand ultra-low latency, high throughput, and massive device connectivity, which traditional network design approaches struggle to meet. These issues were initially addressed in Fifth-Generation (5G) and Beyond-5G (B5G) networks, where Artificial Intelligence (AI), particularly Deep Learning (DL), is proposed to optimize the network and to meet these demanding requirements. However, the resource constraints and time limitations inherent in telecommunication networks raise questions about the practicality of deploying large Deep Neural Networks (DNNs) in these contexts. This paper analyzes the costs of implementing DNNs by comparing them with shallow ML models across multiple datasets and evaluating factors such as execution time and model interpretability. Our findings demonstrate that shallow ML models offer comparable performance to DNNs, with significantly reduced training and inference times, achieving up to 90% acceleration. Moreover, shallow models are more interpretable, as explainability metrics struggle to agree on feature importance values even for high-performing DNNs.}, archive = {J_COMCOM}, author = {Rafael Teixeira and Leonardo Almeida and Pedro Rodrigues and Mário Antunes and Diogo Gomes and Rui L. Aguiar}, doi = {10.1016/j.comcom.2025.108312}, journal = {Computer Communications}, month = {11}, pages = {108312}, shortjournal = {Comput. Commun.}, title = {Beyond performance comparing the costs of applying deep and shallow learning}, volume = {243}, year = {2025}, }

COR - 41

• (2026). The obnoxious facilities p-center problem with forbidden regions. COR, 185, 107297. (www)

  @article{ , abstract = {We formulate a planar obnoxious p -center problem with circular forbidden regions, such as a minimum required distance from some or all the demand points. We use geometric computation to develop a tight lower bound on the optimal value of the objective function and propose solution techniques which yield optimal solutions to several multiple large-scale tsplib instances in less than few hours’ time. We observe that, for larger forbidden regions, the obnoxious p -center problem reaches the best possible overall objective for a relatively small number of facilities. Our proposed solution approach is particularly useful in instances with multiple overlapping forbidden regions.}, archive = {J_COR}, author = {Pawel Kalczynski and Zvi Drezner}, doi = {10.1016/j.cor.2025.107297}, journal = {Computers & Operations Research}, month = {1}, pages = {107297}, shortjournal = {Comput. Oper. Res.}, title = {The obnoxious facilities p-center problem with forbidden regions}, volume = {185}, year = {2026}, }
• (2026). An adaptive and efficient path planning algorithm for UAV navigation in complex environments. COR, 185, 107296. (www)

  @article{ , abstract = {Efficient and reliable path planning is critical for autonomous unmanned aerial vehicle (UAV) navigation in complex environments, including urban obstacle fields and sensor-restricted airspaces. This paper proposes the rapidly converging and greedy-optimized RRT* (RGO-RRT*) algorithm, which integrates four adaptive modules to enhance planning performance. These include: (1) region-based probabilistic sampling that prioritizes high-potential regions to reduce redundant exploration and accelerate convergence; (2) adaptive step-size adjustment based on obstacle density for fine maneuverability in cluttered areas and rapid expansion in open spaces; (3) dynamic goal biasing that gradually increases goal attraction to balance exploration and convergence; and (4) an improved artificial potential field with an adaptive repulsion model to mitigate local minima and ensure smoother trajectories. Additionally, three auxiliary strategies — bidirectional tree expansion, greedy optimization, and feasibility constraints-are employed to further refine path quality and search efficiency. Extensive simulations are conducted in four structurally diverse environments to evaluate performance under various levels of obstacle density and geometric complexity. Results show that RGO-RRT* consistently outperforms five benchmark algorithms (RRT*, Bi-RRT*, APF-RRT*, Bi-APF-RRT*, and Improved Bi-APF-RRT*), achieving up to 83.1% fewer iterations, 11.7% shorter path lengths, and 87.9% reduction in planning time. These findings demonstrate the method’s robustness, efficiency, and applicability to UAV navigation in cluttered scenarios.}, archive = {J_COR}, author = {Yonggang Wang and Guoliang Wang}, doi = {10.1016/j.cor.2025.107296}, journal = {Computers & Operations Research}, month = {1}, pages = {107296}, shortjournal = {Comput. Oper. Res.}, title = {An adaptive and efficient path planning algorithm for UAV navigation in complex environments}, volume = {185}, year = {2026}, }
• (2026). On-demand meal delivery: Drone scheduling with battery replacement optimization. COR, 185, 107295. (www)

  @article{ , abstract = {Drones have become a promising solution for on-demand delivery thanks to their ability to travel fast and navigate without road restrictions. In the context of direct meal delivery using drones, it is a common practice to replace the drone’s battery after each round trip between the central launch site and customer locations to prevent power interruptions. This practice can lead to frequent battery replacements, resulting in increased downtime and decreased drone utilization. To enhance the efficiency of drone delivery, we take into account load-dependent energy consumption for the drones and optimize battery replacement along with drone scheduling. A mixed integer programming formulation is constructed to mathematically capture the problem. Additionally, we develop a time-expanded network flow method and a tailored hybrid variable neighborhood search algorithm to solve the problem exactly and heuristically. Computational studies validate the effectiveness and efficiency of the proposed operational model and solution approaches. The results indicate that optimizing battery replacement can induce an increase in on-time deliveries by up to 7.69% compared to replacing batteries after each return, and by 14.29% compared to only replacing them when energy levels are low. Such benefits are particularly significant in scenarios with tighter delivery deadlines and longer battery replacement times.}, archive = {J_COR}, author = {Wenqian Liu and Yandong He and Ginger Y. Ke and Lianmin Zhang}, doi = {10.1016/j.cor.2025.107295}, journal = {Computers & Operations Research}, month = {1}, pages = {107295}, shortjournal = {Comput. Oper. Res.}, title = {On-demand meal delivery: Drone scheduling with battery replacement optimization}, volume = {185}, year = {2026}, }
• (2026). Optimizing production–transportation–delivery in global supply chain with demand ambiguity by branch-and-cut algorithm. COR, 185, 107293. (www)

  @article{ , abstract = {The complexity incorporated in global supply chain (GSC) means the production, transportation, and delivery are totally operating and completing in the dynamic business environment with unforeseen events. At present, there are two key challenges in the transnational supply chain network: addressing the demand ambiguity and enhancing cooperation among supply chain entities. To optimize the production–transportation–delivery decision in GSC, a novel globalized distributionally robust GSC (GDR-GSC) model with horizontal cooperation is proposed, in which the ambiguity of demand distribution is characterized by inner and outer ambiguity sets. Subsequently, the proposed model is transformed into mixed integer nonlinear programming (MINLP) model by duality theory. It is commonly difficult to solve in high-dimensional case. Therefore, a customized Branch-and-Cut (B&C) algorithm tailored for the GDR-GSC model is designed to handle complex MINLP problems, and improves computational efficiency and solution quality. The case study based on Apple’s sales operations in China and Malaysia demonstrates the effectiveness and superiority of the B&C algorithm in solving the GDR-GSC model. Numerical experiments show that the customized B&C algorithm can improve the average solving time by 18% while maintaining the same solution quality. Based on realistic cases, we know that horizontal cooperation can increase profits by at least 6.25%.}, archive = {J_COR}, author = {Zheng Wang and Pingyuan Dong and Ying Liu}, doi = {10.1016/j.cor.2025.107293}, journal = {Computers & Operations Research}, month = {1}, pages = {107293}, shortjournal = {Comput. Oper. Res.}, title = {Optimizing production–transportation–delivery in global supply chain with demand ambiguity by branch-and-cut algorithm}, volume = {185}, year = {2026}, }
• (2026). Dynamic crowdsourcing problem in urban–rural distribution using the learning-based approach. COR, 185, 107292. (www)

  @article{ , abstract = {Inspired by real-world urban and rural distribution logistics scenarios, this study explores the dynamic crowdsourcing multi-depot pickup and delivery problem (DCMDPDP) through an online platform (OCP), where requests and crowdsourced vehicles arrive dynamically. Vehicles either collect from multiple depots for deliveries or pick up from customers to depots. To maximize the OCP’s daily total gain, the net value of completed task revenue minus vehicle compensation costs, we integrate anticipated future gains into each decision-making process and formulate the DCMDPDP as a Markov decision process. A learning-based hybrid heuristic algorithm is proposed for the DCMDPDP. Specifically, we develop an enhanced adaptive large neighborhood search algorithm leveraging the heat map to batch orders into multiple groups and assign them to depots, where the heat map is learned offline using a graph convolutional residual network with an attention mechanism model. A value learning-based algorithm is also developed to obtain optimal matches between order batches and vehicles, and near-optimal travel routes. Experimental results demonstrate that the proposed algorithm improves the OCP total gain by 46.09%, 57.13%, 0.49%, 2.45%, 1.08%, and 2.77% over six benchmarks. Furthermore, the proposed algorithm reduces unserved customers to 7.83 on average, outperforming six benchmarks by 2.19–167.52 fewer cases. Moreover, extensive experiments validate that the proposed algorithm is strongly generalizable in handling instances with varying customer sizes and different temporal, spatial, and demand distributions.}, archive = {J_COR}, author = {Zongcheng Zhang and Maoliang Ran and Yanru Chen and M.I.M. Wahab and Mujin Gao and Yangsheng Jiang}, doi = {10.1016/j.cor.2025.107292}, journal = {Computers & Operations Research}, month = {1}, pages = {107292}, shortjournal = {Comput. Oper. Res.}, title = {Dynamic crowdsourcing problem in urban–rural distribution using the learning-based approach}, volume = {185}, year = {2026}, }
• (2026). Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs. COR, 185, 107290. (www)

  @article{ , abstract = {Mixed integer programming (MIP) has been widely utilized to tackle a broad range of real-world decision-making problems, while its solution efficiency remains a key challenge. In this paper, we describe a novel unsupervised learning scheme for accelerating the solution of a family of MIP problems. Distinct substantially from existing learning-to-optimize methods, our proposal seeks to train an autoencoder (AE) for binary variables in an unsupervised learning fashion, using data of optimal solutions to historical instances for a parametric family of MIPs. By a deliberate design of AE architecture and exploitation of its statistical implication, we present a simple and straightforward strategy to construct a class of cutting plane constraints from the decoder parameters of an offline-trained AE. These constraints reliably enclose the optimal binary solutions of new problem instances thanks to the representation strength of AE. More importantly, their integration into the primal MIP problem of an unseen instance leads to a tightened MIP, which can be resolved at decision time using off-the-shelf solvers with much higher efficiency. Our method is applied to two benchmark problems: the batch process scheduling problem, formulated as a mixed-integer linear programming (MILP) problem, and the cart–pole system control problem, formulated as a mixed-integer quadratic programming (MIQP) problem. Comprehensive results demonstrate that our approach significantly reduces the computational cost of off-the-shelf MILP solvers while retaining a high solution quality. The codes of this work are open-sourced at https://github.com/qushiyuan/AE4BV .}, archive = {J_COR}, author = {Shiyuan Qu and Fenglian Dong and Zhiwei Wei and Chao Shang}, doi = {10.1016/j.cor.2025.107290}, journal = {Computers & Operations Research}, month = {1}, pages = {107290}, shortjournal = {Comput. Oper. Res.}, title = {Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs}, volume = {185}, year = {2026}, }
• (2026). Optimal placement of electric vehicle slow-charging stations: A continuous facility location problem under uncertainty. COR, 185, 107289. (www)

  @article{ , abstract = {Electric vehicles (EVs) are becoming a key mechanism to reduce emissions in the transportation industry, and hence contribute to the green transition. In this paper, we present a mathematical programming model which determines the optimal placement of EV charging stations such that chargers are placed in the most cost-efficient way possible for all stakeholders, assuming additionally that EV charging demand is inherently stochastic in nature. The model is formulated as a two-stage, continuous location–allocation model in the form of a generalised Weber problem in two dimensions. However, this formulation is non-convex and notoriously difficult to solve. We therefore propose a suitable discretisation procedure to find high quality solutions in suitable time. The discretisation procedure shows strong performance across a variety of computational experiments using randomly generated scenarios, maintaining robustness in terms of the objective value and overall solution quality. A part of this solution procedure was entered into the 15th AIMMS-MOPTA Optimisation Modelling Competition.}, archive = {J_COR}, author = {H.W. Ljósheim and S. Jenkins and K.D. Searle and J.K. Wolff}, doi = {10.1016/j.cor.2025.107289}, journal = {Computers & Operations Research}, month = {1}, pages = {107289}, shortjournal = {Comput. Oper. Res.}, title = {Optimal placement of electric vehicle slow-charging stations: A continuous facility location problem under uncertainty}, volume = {185}, year = {2026}, }
• (2026). A multi-time-window multi-objective hybrid fleet home health care routing optimization problem considering caregiver utilization and compatibility. COR, 185, 107288. (www)

  @article{ , abstract = {Home healthcare plays a key role in the era of an aging population and limited healthcare resources in hospitals, and one of its important tasks is to develop optimal caregiver visit routines. In the context of sustainable development and dual carbon goals, home healthcare must also address carbon emissions during caregiver visits. One of the most effective initiatives is the use of electric vehicles to gradually replace fuel vehicles as an important means of transportation. Therefore, this paper investigates a multi-objective home healthcare path optimization problem based on a mixed fleet of vehicles. In this problem, the transportation of caregivers is either electric or fuel vehicles, and this paper considers the case of patients with different numbers of multiple time windows, defines compatibility, and optimizes five conflicting objectives under the constraints of time windows, doctor-patient skill matching, electric vehicle battery capacity, compatibility, and maximum working hours. To address this problem, we develop a mixed integer programming model to optimize five objectives: cost minimization, caregiver utilization maximization, workload deviation minimization, patient-caregiver compatibility maximization, and skill level deviation minimization. In addition, this paper proposes a hybrid algorithmic solution model with hybrid simulated annealing and a third-generation non-dominated sorting genetic algorithm and designs two neighborhood structures based on the problem characteristics as well as heuristics for charging station insertion. The results show that the improved hybrid algorithm solves the problem more comprehensively and effectively and can cover a wider solution space with good distribution and diversity.}, archive = {J_COR}, author = {Wendi Li and Gang Du and Xiaohang Yue}, doi = {10.1016/j.cor.2025.107288}, journal = {Computers & Operations Research}, month = {1}, pages = {107288}, shortjournal = {Comput. Oper. Res.}, title = {A multi-time-window multi-objective hybrid fleet home health care routing optimization problem considering caregiver utilization and compatibility}, volume = {185}, year = {2026}, }
• (2026). Modeling and algorithm for job shop scheduling with batch operations in semiconductor fabs. COR, 185, 107287. (www)

  @article{ , abstract = {Semiconductor manufacturing presents a highly complex Job Shop Scheduling Problem (JSP) due to the diversity and large number of processing machines, as well as the intricate manufacturing processes including batch and non-batch operations. Existing studies often either overlook batching problems or address them in oversimplified ways, failing to provide effective solutions for large-scale scheduling challenges with batch operations. For this problem, a model for the JSP involving both batching and non-batching processes in semiconductor fabs is first developed. Then, the First Come First Served (FCFS) approach, as an effective rule-based method, is employed to generate high-quality initial solutions. A tailored Constrained Genetic Algorithm (CGA) by embedding constraints to the stages of genetic algorithms is proposed to further optimize the solution. The CGA incorporates batch grouping, constrained encoding, constrained crossover and constrained mutation to effectively handle the sequential constraints of batch and non-batch processes, ensuring the generation of valid solutions. The CGA is validated using the SMT2020 and SMAT2022 datasets across various scales and scenarios. Experimental results demonstrate that the CGA outperforms FCFS, backward simulation and reinforcement learning. These results highlight the CGA’s effectiveness and robustness in solving complex scheduling problems in semiconductor manufacturing.}, archive = {J_COR}, author = {Wen Ma and Gedong Jiang and Nuogang Sun and Chaoqing Min and Xuesong Mei}, doi = {10.1016/j.cor.2025.107287}, journal = {Computers & Operations Research}, month = {1}, pages = {107287}, shortjournal = {Comput. Oper. Res.}, title = {Modeling and algorithm for job shop scheduling with batch operations in semiconductor fabs}, volume = {185}, year = {2026}, }
• (2026). A bi-criterion steiner traveling salesperson problem with time windows for last-mile electric vehicle logistics. COR, 185, 107286. (www)

  @article{ , abstract = {This paper addresses the problem of energy-efficient and safe routing of last-mile electric freight vehicles. With the rising environmental footprint of the transportation sector and the growing popularity of E-Commerce, freight companies are likely to benefit from optimal time window feasible tours that minimize energy usage while reducing traffic conflicts at intersections and thereby improving safety. We formulate this problem as a Bi-criterion Steiner Traveling Salesperson Problem with Time Windows (BSTSPTW) with energy consumed and the number of left turns at intersections as the two objectives while also considering regenerative braking capabilities. We first discuss an exact mixed-integer programming model with scalarization to enumerate points on the efficiency frontier for small instances. For larger networks, we develop an efficient local search-based heuristic, which uses several operators to intensify and diversify the search process. We demonstrate the utility of the proposed methods using benchmark data and real-world instances from Amazon delivery routes in Austin, US. Comparisons with state-of-the-art solvers show that our heuristics can generate near-optimal solutions within reasonable time budgets, effectively balancing energy efficiency and safety under practical delivery constraints.}, archive = {J_COR}, author = {Prateek Agarwal and Debojjal Bagchi and Tarun Rambha and Venktesh Pandey}, doi = {10.1016/j.cor.2025.107286}, journal = {Computers & Operations Research}, month = {1}, pages = {107286}, shortjournal = {Comput. Oper. Res.}, title = {A bi-criterion steiner traveling salesperson problem with time windows for last-mile electric vehicle logistics}, volume = {185}, year = {2026}, }
• (2026). Maximum capture location problem with random utilities and overflow penalties. COR, 185, 107285. (www)

  @article{ , abstract = {This paper extends the maximum capture location problem with random utilities by incorporating the facility capacity and introducing penalties for overflows into the objective function. We propose a method that combines the key features of two state-of-the-art approaches for the uncapacitated case, which are adapted to solve the problem at hand. The first approach is a linear reformulation that extends the best-known linearization in the literature, which is based on variable substitution. The second approach is a reformulation that incorporates outer-approximation cuts and enhanced submodular cuts, solving the problem via a branch-and-cut approach. We tested the performance of the three approaches on several instances and show that the combined method outperforms each of the preceding techniques. The optimal location patterns of the model are also analysed, and it is found that considering the overflow and overflow penalties in the objective function affects the location decisions. The resulting optimal locations align more closely with practical scenarios.}, archive = {J_COR}, author = {Gonzalo Méndez-Vogel and Sebastián Dávila-Gálvez and Pedro Jara-Moroni and Jorge Zamorano and Vladimir Marianov}, doi = {10.1016/j.cor.2025.107285}, journal = {Computers & Operations Research}, month = {1}, pages = {107285}, shortjournal = {Comput. Oper. Res.}, title = {Maximum capture location problem with random utilities and overflow penalties}, volume = {185}, year = {2026}, }
• (2026). A novel mathematical model for the scheduling of a zero inventory production: An application of process scheduling in fog computing. COR, 185, 107284. (www)

  @article{ , abstract = {One of the main production-related costs in manufacturing is inventory cost since manufacturing firms allocate a vast area to raw material, semi-processed, and final products in production lines and warehouses. Reducing the volume of these inventories leads to lower production-related costs. This paper presents a novel mathematical model for zero-inventory production scheduling. In this model, the jobs arrive at fixed times and are scheduled on a set of unrelated machines. The jobs have different operations that need to be processed one by one. Since the system has zero inventory, the jobs must be processed immediately upon arrival. Also, whenever a job’s operation is complete, the following operation must instantly start (no wait time). That operation is outsourced if no machines are available to process any of the job’s operations. The jobs’ operations are dispatched to the machines from a dispatching center, and there is a latency between the dispatching center, the machines, and the outsourcing center. We present a mixed-integer non-linear programming (MINLP) model to formulate this problem. Then, the MINLP model is turned into a mixed-integer linear programming (MILP) model by linearizing its constraints. Since many production scheduling problems are known to be NP-hard, particularly those involving unrelated parallel machines, precedence constraints, and time-dependent decisions like ours, we adopt two metaheuristics to solve the problem for large-scale cases where exact methods are computationally inefficient. The first is a Genetic Algorithm (GA), and the second is a Teaching-Learning-Based Optimization (TLBO) algorithm. The performance of these algorithms is tested against the optimal solutions obtained from CPLEX for a set of small-scale problems. We consider a real case study, an image processing system, to validate the proposed developments (the MILP model and the GA). The results show that the presented model and algorithm can reduce the system’s total cost by about 12.57% compared to the existing online dispatching rules.}, archive = {J_COR}, author = {Mani Sharifi and Sharareh Taghipour and Abdolreza Abhari and Maciej Rysz}, doi = {10.1016/j.cor.2025.107284}, journal = {Computers & Operations Research}, month = {1}, pages = {107284}, shortjournal = {Comput. Oper. Res.}, title = {A novel mathematical model for the scheduling of a zero inventory production: An application of process scheduling in fog computing}, volume = {185}, year = {2026}, }
• (2026). A unified approach to extract interpretable rules from tree ensembles via integer programming. COR, 185, 107283. (www)

  @article{ , abstract = {Tree ensembles are widely used machine learning models, known for their effectiveness in supervised classification and regression tasks. Their performance derives from aggregating predictions of multiple decision trees, which are renowned for their interpretability properties. However, tree ensemble models do not reliably exhibit interpretable output. Our work aims to extract an optimized list of rules from a trained tree ensemble, providing the user with a condensed, interpretable model that retains most of the predictive power of the full model. Our approach consists of solving a set partitioning problem formulated through Integer Programming. The extracted list of rules is unweighted and defines a partition of the training data, assigning each instance to exactly one rule, and thereby simplifying the explanation process. The proposed method works with tabular or time series data, for both classification and regression tasks, and its flexible formulation can include any arbitrary loss or regularization functions. Our computational experiments offer statistically significant evidence that our method performs comparably to several rule extraction methods in terms of predictive performance and fidelity towards the tree ensemble. Moreover, we empirically show that the proposed method effectively extracts interpretable rules from tree ensembles that are designed for time series data.}, archive = {J_COR}, author = {Lorenzo Bonasera and Emilio Carrizosa}, doi = {10.1016/j.cor.2025.107283}, journal = {Computers & Operations Research}, month = {1}, pages = {107283}, shortjournal = {Comput. Oper. Res.}, title = {A unified approach to extract interpretable rules from tree ensembles via integer programming}, volume = {185}, year = {2026}, }
• (2026). Optimizing high-tech product take-back schemes in a closed-loop supply chain. COR, 185, 107282. (www)

  @article{ , abstract = {Frequent product development is a solution to the shortened product lifecycles in the consumer electronics industry. It enables companies to maintain competitiveness and strengthen their market share. However, environmental concerns bring reverse logistics practices into focus. A take-back policy is a strategic reverse logistics activity known to foster market share; however, it poses various challenges and uncertainties. Considering uncertain demand, we introduced an innovative adoption model with two distinct take-back policies, trade-in and credit, to address challenges in multi-generation production planning. Inspired by real-world practices of companies like Apple and Samsung, our model first examines how trade-in programs drive repeat purchases and enhance market share, with credit-based programs to attract new customers. It then captures changes in demand, production planning, recovery decisions, and internal competition among multiple product generations. Distinct from previous conclusions, this study explores how producers can strategically manage demand for new generations to slow diffusion, thereby increasing refurbishment and recycling volumes over time. Our findings highlight the pivotal role of adaptive pricing strategies and production scalability in maximizing profitability and promoting sustainability in competitive high-tech industries.}, archive = {J_COR}, author = {Fatemeh Keshavarz-Ghorbani and Mohamad Y. Jaber and Seyed Hamid Reza Pasandideh}, doi = {10.1016/j.cor.2025.107282}, journal = {Computers & Operations Research}, month = {1}, pages = {107282}, shortjournal = {Comput. Oper. Res.}, title = {Optimizing high-tech product take-back schemes in a closed-loop supply chain}, volume = {185}, year = {2026}, }
• (2026). Minimizing the weighted number of tardy jobs: Data-driven heuristic for single-machine scheduling. COR, 185, 107281. (www)

  @article{ , abstract = {Existing research on single-machine scheduling is largely focused on exact algorithms, which perform well on typical instances but can significantly deteriorate on certain regions of the problem space. In contrast, data-driven approaches provide strong and scalable performance when tailored to the structure of specific datasets. Leveraging this idea, we focus on a single-machine scheduling problem where each job is defined by its weight, duration, due date, and deadline, aiming to minimize the total weight of tardy jobs. We introduce a novel data-driven scheduling heuristic that combines machine learning with problem-specific characteristics, ensuring feasible solutions, which is a common challenge for ML-based algorithms. Experimental results demonstrate that our approach significantly outperforms the state-of-the-art in terms of optimality gap, number of optimal solutions, and adaptability across varied data scenarios, highlighting its flexibility for practical applications. In addition, we conduct a systematic exploration of ML models, addressing a common gap in similar studies by offering a detailed model selection process and demonstrating why the chosen model is the best fit.}, archive = {J_COR}, author = {Nikolai Antonov and Přemysl Šůcha and Mikoláš Janota and Jan Hůla}, doi = {10.1016/j.cor.2025.107281}, journal = {Computers & Operations Research}, month = {1}, pages = {107281}, shortjournal = {Comput. Oper. Res.}, title = {Minimizing the weighted number of tardy jobs: Data-driven heuristic for single-machine scheduling}, volume = {185}, year = {2026}, }
• (2026). On the periodic service scheduling problem with non-uniform demands. COR, 185, 107280. (www)

  @article{ , abstract = {This paper introduces the Periodic Service Scheduling Problem with Non-uniform Demands, in which the best service policy for a set of customers with periodically recurring demand through a given finite planning horizon has to be determined. Service to customers is provided at every time period by a set of potential service providers, each of them with an activation cost and a capacity. The decisions to be made include the servers to be activated at each time period together with a service schedule and server allocation for every customer that respect the periodicity of customer demand and the capacity of the activated servers, which minimize the total cost of the activated servers. We give a first Integer Linear Programming formulation with one set of decision variables associated with each of the decisions of the problem. Afterwards, we develop a logic-based Benders reformulation where one set of variables is projected out and constraints that guarantee the feasibility of the solutions are introduced. The separation problem for the new set of constraints is studied, and an exact Branch & Logic-Benders-Cut algorithm for the reformulation is proposed together with several variations and enhancements. The particular cases in which all servers are identical and in which all parameters are time-invariant are also studied. Extensive computational experiments assess the superiority of the logic-based Benders reformulation over the first formulation.}, archive = {J_COR}, author = {Elena Fernández and Jörg Kalcsics}, doi = {10.1016/j.cor.2025.107280}, journal = {Computers & Operations Research}, month = {1}, pages = {107280}, shortjournal = {Comput. Oper. Res.}, title = {On the periodic service scheduling problem with non-uniform demands}, volume = {185}, year = {2026}, }
• (2026). Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems. COR, 185, 107279. (www)

  @article{ , abstract = {Heuristic methods provide a computationally efficient framework for addressing two-dimensional irregular packing problems, particularly in resource-constrained industrial settings. As a typical combinatorial optimization problem, irregular packing exhibits exponential growth in computational complexity with increasing workpiece counts, while the solution space dynamically reconfigures due to geometric variability among workpieces. Although heuristic algorithms can generate feasible layouts within acceptable timeframes, their reliance on fixed search rule limits adaptability to diverse scenarios, necessitating more flexible approaches. In this paper, a hyper-heuristic algorithm based on Q-Learning is proposed to solve open dimension packing problems, including one-open and two-open dimension problems. Q-Learning is adopted as the high-level strategy for its ability to optimize low-level heuristic selection through reward-driven experience accumulation. The method incorporates a mixed encoding method for solution representation, four specialized low-level heuristic operators, a linear population decline mechanism, and an elite preservation strategy to balance exploration–exploitation. The Q-Learning controller dynamically selects operators by updating the Q-table based on Bellman’s equation. The proposed algorithm is compared to some advanced algorithms in general datasets. The results show that our method has better performance and applicability.}, archive = {J_COR}, author = {Yongchun Wang and Qingjin Peng and Zhen Wang and Shuiquan Huang and Zhengkai Xu and Chuanzhen Huang and Baosu Guo}, doi = {10.1016/j.cor.2025.107279}, journal = {Computers & Operations Research}, month = {1}, pages = {107279}, shortjournal = {Comput. Oper. Res.}, title = {Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems}, volume = {185}, year = {2026}, }
• (2026). Hybrid modelling using simulation and machine learning in healthcare. COR, 185, 107278. (www)

  @article{ , abstract = {Modelling & Simulation (M&S) and Machine Learning (ML) methodologies have undergone significant advancements, enabling transformative applications across various industries. The integration of M&S and ML into a Hybrid M&S-ML approach leverages the unique strengths of both fields, offering enhanced model precision, improved efficiency, and more effective decision support. This review explores the increasing convergence of ML algorithms with traditional M&S methods- namely Agent-Based Modelling & Simulation, Discrete Event Simulation, and System Dynamics- in healthcare applications. Through a systematic review of 90 relevant studies, this article provides a comprehensive synthesis of the current state-of-the-art Hybrid M&S-ML in healthcare. Specifically, it examines the M&S and ML methodologies employed, associated software tools and programming languages, analyses integration patterns and data exchange mechanisms, and explores application domains, as well as the types and motivations for hybridisation. Key findings highlight prominent methodological and technical trends, as well as opportunities for combining M&S with ML to address healthcare challenges. These insights provide direction for modellers and data scientists in developing hybrid M&S–ML approaches that more effectively combine simulation capabilities with data-driven learning. The review also demonstrates the potential of such approaches to advance methodological innovation and support evidence-based decision-making in diverse healthcare contexts.}, archive = {J_COR}, author = {Ali Ahmadi and Masoud Fakhimi and Carin Magnusson}, doi = {10.1016/j.cor.2025.107278}, journal = {Computers & Operations Research}, month = {1}, pages = {107278}, shortjournal = {Comput. Oper. Res.}, title = {Hybrid modelling using simulation and machine learning in healthcare}, volume = {185}, year = {2026}, }
• (2026). A note on battery swapping policies in the electric vehicle routing problem with time windows and battery swapping vehicles. COR, 185, 107277. (www)

  @article{ , abstract = {Çatay and Sadati [An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping. Computers & Operations Research 159, 106310, 2023] explores a variant of the Electric Vehicle Routing Problem with Time Windows that incorporates mobile chargers for recharging electric vehicles (EVs) at selected locations while serving customers. The authors propose a matheuristic method to address this problem and its special case, where EV batteries are swapped in constant time instead of being recharged over variable durations. While comparing their results with those in the literature, the authors overlook a critical assumption regarding the swapping policy, potentially causing confusion in interpreting the findings. This note addresses the issue, clarifies the overlooked assumption, and updates the results that do not align with the actual scenario in the literature. Furthermore, it introduces two new battery swapping policies and presents an extensive computational study to offer new insights on synchronized mobile battery swapping.}, archive = {J_COR}, author = {Bülent Çatay and İhsan Sadati}, doi = {10.1016/j.cor.2025.107277}, journal = {Computers & Operations Research}, month = {1}, pages = {107277}, shortjournal = {Comput. Oper. Res.}, title = {A note on battery swapping policies in the electric vehicle routing problem with time windows and battery swapping vehicles}, volume = {185}, year = {2026}, }
• (2026). Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization. COR, 185, 107276. (www)

  @article{ , abstract = {In the strip packing problem, the objective is to pack a set of two-dimensional items into a strip of fixed width such that the total height of the packing is minimized. The current state-of-the-art exact approach for the problem uses a decomposition framework in which the main problem (MP) fixes the item abscissas and the strip height, whereas the subproblem (SP) determines whether a set of item ordinates resulting in a feasible packing exists. Even though this decomposition framework has already been used several times in the literature, implementation details were often obfuscated, limiting the outreach of the approach. We address this issue by thoroughly describing and testing various builds for this framework, investigating important features such as the way to forbid an infeasible solution in the MP (e.g., by rejecting them or through a no-good cut) and the techniques used to solve the MP and the SP. One of our findings is that a minor implementation tweak such as changing the random seed between two MP iterations can bring the same level of improvement as a more involved feature such as strengthening the no-good cuts. From our extensive experiments, we identify two versions of the framework that produce complementary results: one where the main problem is solved with integer linear programming and the other where it is solved with constraint programming. We then train a reinforcement learning agent to find the best hybridization of these two algorithms and show that the resulting approach obtains state-of-the-art results on benchmark instances.}, archive = {J_COR}, author = {Fatih Burak Akçay and Maxence Delorme}, doi = {10.1016/j.cor.2025.107276}, journal = {Computers & Operations Research}, month = {1}, pages = {107276}, shortjournal = {Comput. Oper. Res.}, title = {Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization}, volume = {185}, year = {2026}, }
• (2026). An adaptive K-means and reinforcement learning (RL) algorithm to effective vaccine distribution. COR, 185, 107275. (www)

  @article{ , abstract = {We present a new adaptive reinforcement learning (RL) approach, integrated with a K-means clustering algorithm and guided by simulated annealing, to address the capacitated vehicle routing for vaccine distribution (CVRVD) problem. This integrated method provides an efficient and scalable solution for optimizing vaccine distribution logistics. By incorporating cost factors related to travel distance, inventory levels, and penalty terms – while adhering to delivery time windows – our approach improves both operational efficiency and vaccine allocation effectiveness. Experimental results demonstrate that our K-means supported RL algorithm significantly outperforms traditional solvers in tackling this NP-hard problem, particularly in large-scale scenarios. Specifically, our approach can efficiently solve CVRVD instances with up to 1,000 facilities—scenarios that are computationally intractable for exact methods. We demonstrate the effectiveness of the adaptive K-means supported RL algorithm using data from New Jersey, USA, where facility-level vaccination data were available through the state’s Immunization Information System. Beyond vaccine distribution, our method has broad applicability in logistics and transportation, enabling more efficient and cost-effective allocation of critical resources such as vaccines and medical supplies.}, archive = {J_COR}, author = {Elson Cibaku and İ. Esra Büyüktahtakın}, doi = {10.1016/j.cor.2025.107275}, journal = {Computers & Operations Research}, month = {1}, pages = {107275}, shortjournal = {Comput. Oper. Res.}, title = {An adaptive K-means and reinforcement learning (RL) algorithm to effective vaccine distribution}, volume = {185}, year = {2026}, }
• (2026). A Q-learning-based multi-objective hyper-heuristic algorithm for energy-efficient integrated distributed hybrid flow-shop scheduling with preventive maintenance. COR, 185, 107267. (www)

  @article{ , abstract = {Driven by the dual engines of supply chain integration and low-carbon transformation in industrial Internet of Things (IIoT) manufacturing systems, energy-efficient integrated distributed scheduling has emerged as a pivotal component of industrial intelligence-driven smart manufacturing. This article investigates the energy-efficient integrated distributed hybrid flow shop scheduling problem with preventive maintenance (EE-IDHFSP-PM), which aims to minimize the dual objectives of makespan and total carbon emissions. In this study, a mixed-integer linear programming (MILP) model is established for the EE-IDHFSP-PM, making the first attempt to solve such NP-hard problem by using a Q -learning-based multi-objective hyper-heuristic algorithm (QLMHHA). First, a modified NEH-based initialization method is introduced to produce high-quality solutions that balance multiple optimization objectives, ensuring both the quality and diversity of initial populations. Second, a novel multi-stage collaborative energy-efficient strategy (MSC_EES) is developed to dynamically adjust the processing speeds of machines on non-critical paths, which reduces energy consumption across stages. Third, a new Q -learning-based high-level strategy (HLS) is devised to dynamically coordinate twelve low-level heuristics (LLHs) according to specific states, improving adaptive search efficiency through superior exploration–exploitation trade-offs. Fourth, a dual-criterion reward mechanism is proposed to evaluate population quality in terms of both convergence and diversity, which can deliver immediate feedback and effectively guide evolutionary processes. Fifth, comprehensive convergence and computational complexity analyses of critical components are conducted to confirm the stability, reliability, and efficiency of QLMHHA. Extensive experiments are carried out on 54 small-scale and 24 large-scale instances, which demonstrate that QLMHHA achieves promising performance in both effectiveness and efficacy against state-of-the-art multi-objective algorithms for addressing the EE-IDHFSP-PM. These findings validate the efficacy and superiority of QLMHHA in tackling complex scheduling challenges, providing valuable theoretical implications and practical insights for energy-efficient distributed manufacturing systems.}, archive = {J_COR}, author = {Zi-Qi Zhang and Xin-Yun Wu and Bin Qian and Rong Hu and Jian-Bo Yang}, doi = {10.1016/j.cor.2025.107267}, journal = {Computers & Operations Research}, month = {1}, pages = {107267}, shortjournal = {Comput. Oper. Res.}, title = {A Q-learning-based multi-objective hyper-heuristic algorithm for energy-efficient integrated distributed hybrid flow-shop scheduling with preventive maintenance}, volume = {185}, year = {2026}, }
• (2026). A Q-learning-based evolutionary algorithm for solving the low-carbon multi-objective flexible job shop scheduling problem. COR, 185, 107266. (www)

  @article{ , abstract = {In recent years, how to reduce energy consumption at the manufacturing system level in the low-carbon multi-objective flexible job shop scheduling problem (LCM-FJSP) has received significant attention. In this research, a model with the maximum completion time, total machine workload and total carbon emissions is built. Moreover, a Q-learning-based adaptive weight-adjusted decomposition evolutionary algorithm (QMOEA/D-AWA) is proposed. In the QMOEA/D-AWA, an initialization strategy with four heuristic initial rules for obtaining high-quality population, a variable neighborhood search strategy with four problem-specific local search methods for enhancing exploration and a Q-learning-based parameter adaptive strategy for automatically determining the number of neighborhood solutions are designed. To validate the effectiveness of the proposed QMOEA/D-AWA, it is compared with five state-of-the-art algorithms on 15 instances. In the statistical analysis, the QMOEA/D-AWA obtains the overwhelming metric results in 10 instances. In the visual analysis, the completion time is reduced by 3.74%, the total workload is reduced by 3.94%, and the carbon emissions are reduced by 5.94%.}, archive = {J_COR}, author = {Zhixue Wang and Maowei He and Hanning Chen and Yabao Hu and Yelin Xia}, doi = {10.1016/j.cor.2025.107266}, journal = {Computers & Operations Research}, month = {1}, pages = {107266}, shortjournal = {Comput. Oper. Res.}, title = {A Q-learning-based evolutionary algorithm for solving the low-carbon multi-objective flexible job shop scheduling problem}, volume = {185}, year = {2026}, }
• (2026). A benders-branch-and-cut methodology for global cargo vessel traffic prediction given declining arctic sea ice and changing risks. COR, 185, 107265. (www)

  @article{ , abstract = {Global warming has led to declining sea-ice in the Arctic Ocean, making it easier for ice-class vessels to navigate Arctic waters for greater portions of the year. As sailing conditions in these waters improve over coming decades, these passageways are expected to open for larger portions of the year and to become increasingly viable options for unsupported transit and even open-water vessels. This paper proposes a Benders-branch-and-cut methodology for estimating changes in global maritime cargo flow patterns under future climate scenarios with declining Arctic sea ice. The model accounts for changing incident risk along Arctic passageways and corresponding ice-class vessel and icebreaker escort requirements, lower speeds, increased insurance premiums, higher accident probabilities, and constraints on path-based maximum risk exposure. The resulting mixed-integer program involves path-based, continuous decision variables. The solution technique is applied on a model of the global maritime container network including 80 ports, 76 routes, 426 links and 4,303 legs associated with the world’s largest carrier alliance. Embedded acceleration techniques and a label-correcting algorithm that employs specialized fathoming rules for a non-additive, constrained path subproblem enable solution at this global scale. The outcome is an estimate of seasonal future global maritime trade flows along key global routes and through ports predicted under six climate-related scenarios. Results illustrate that the developed model can provide support to companies, nations and regions as they prepare for a changing global landscape and climate.}, archive = {J_COR}, author = {Wenjie Li and Elise Miller-Hooks}, doi = {10.1016/j.cor.2025.107265}, journal = {Computers & Operations Research}, month = {1}, pages = {107265}, shortjournal = {Comput. Oper. Res.}, title = {A benders-branch-and-cut methodology for global cargo vessel traffic prediction given declining arctic sea ice and changing risks}, volume = {185}, year = {2026}, }
• (2026). Mitigating choice model ambiguity: A consensus framework and its application to assortment optimization. COR, 185, 107264. (www)

  @article{ , abstract = {Discrete choice models have become a popular tool to accurately predict complex choice behavior. Due to a variety of possible error sources, estimated choice models tend to be subject to ambiguity, inducing different optimal decisions of highly varying quality. This study aims at mitigating choice model ambiguity associated with a given set of models in terms of their ability to yield optimal decisions. We propose a framework and a set of performance metrics to assess the reliability of choice models and their induced decisions. The use of this framework is then exemplified in the context of rank-based choice models for assortment optimization. Extensive sets of numerical results suggest that our proposed approaches indeed allow decision-makers to identify choice models that are likely to produce high quality decisions, boosting confidence in using choice models in practice. While robust optimization on the original set of choice models tends to be rather conservative, we then use the proposed metrics to reduce the size of the ambiguity set, allowing us to improve the expected assortment quality and the overall downside risk. Given the practical usefulness of robust optimization in this context, we further propose a decomposition algorithm, solving the optimization problem in a fraction of the original time and revealing that only a few among a large set of choice models are determinant in optimal robust solutions.}, archive = {J_COR}, author = {Öykü Naz Attila and Sanjay Dominik Jena and Walter Rei}, doi = {10.1016/j.cor.2025.107264}, journal = {Computers & Operations Research}, month = {1}, pages = {107264}, shortjournal = {Comput. Oper. Res.}, title = {Mitigating choice model ambiguity: A consensus framework and its application to assortment optimization}, volume = {185}, year = {2026}, }
• (2026). A deep reinforcement learning approach for dynamic job-shop scheduling problem considering time variable and new job arrivals. COR, 185, 107263. (www)

  @article{ , abstract = {In recent years, the complexity of the production process due to increased demand for customization has greatly increased the difficulty of dynamic job-shop scheduling problem (DJSP). This paper proposes a deep reinforcement learning (DRL) approach to tackle the DJSP based on proximal policy optimization (PPO) algorithm. A novel state representation method that expresses state features as multi-channel images is proposed to simplify the state characterization process. Various heuristic-based priority dispatching rules (PDRs)are used to construct action space. By converting scheduling instances into images and leveraging the spatial pyramid pooling fast (SPPF) module for feature extraction, this model can handle scheduling instances of varying scales and map size-independent processing information matrix to fixed action space. Additionally, a dense reward based on a predefined scheduling region is developed to offer detailed guidance to the agent, enabling more precise and comprehensive policy assessment. Static tests are conducted on well-known benchmarks, and the experimental results indicate that our scheduling model surpasses the performance of the three latest DRL approaches on average. Compared with PDR methods, dynamic experiments demonstrate that the proposed DRL model excels in adaptability and robustness when new tasks arrive and the processing time fluctuates with uncertainty.}, archive = {J_COR}, author = {Haoyang Yu and Wenbin Gu and Na Tang and Zhenyang Guo}, doi = {10.1016/j.cor.2025.107263}, journal = {Computers & Operations Research}, month = {1}, pages = {107263}, shortjournal = {Comput. Oper. Res.}, title = {A deep reinforcement learning approach for dynamic job-shop scheduling problem considering time variable and new job arrivals}, volume = {185}, year = {2026}, }
• (2026). An efficient resource utilization and scheduling strategy for in-service aircraft maintenance and operations. COR, 185, 107262. (www)

  @article{ , abstract = {Optimal scheduling of maintenance activities requires the solution of combinatorial optimization problems that need to be efficiently modeled and solved with optimization techniques. Maintenance scheduling and operations-associated problems in the aviation industry can efficiently enhance competitiveness. In the maintenance and scheduling problem, aircrafts need to undergo tasks for both line (A check) and base (C check) maintenance at various hangers at MRO (Maintenance, Repair and Operations) based on resource availability (both human and material). The determination of the optimal maintenance plan, in terms of allocating the resources to the aircraft, and resource movement from one aircraft to another based on availability and licensed skills in the presence of multiple tasks and capacity constraints so as to obtain maximum utilization of resources at maintenance site and minimize the turnaround time is a complex combinatorial optimization problem. To the best of our knowledge, this work is the first CP (Constraint Programming) based mathematical solution that jointly integrates zone, task precedence, technician-pool sharing, and multi-shift continuity for large-scale aircraft maintenance scheduling. In this article, we proposed an efficient optimization strategy that overcomes many of the drawbacks of the formulation/strategies available in literature and helps in determining efficient execution of maintenance work packages. The proposed strategy is generic, encompassing multi-aircraft, multi-skill and multi-shift scheduling capabilities and is validated on two real scenario business case studies, one each for line maintenance (A check) tasks and base maintenance (C check) tasks, as well as six large-scale synthetic scenarios with up to 20,000 tasks, demonstrating feasibility and scalable performance. The proposed strategy is demonstrated on MRO scheduling and it shows an improvement of up to 30.68% in the turn-around time by incorporating the proposed optimization strategy.}, archive = {J_COR}, author = {Sandeep Singh Chauhan and Likhith Maadhav and Abhijit Dake and Gauthier Brillaud}, doi = {10.1016/j.cor.2025.107262}, journal = {Computers & Operations Research}, month = {1}, pages = {107262}, shortjournal = {Comput. Oper. Res.}, title = {An efficient resource utilization and scheduling strategy for in-service aircraft maintenance and operations}, volume = {185}, year = {2026}, }
• (2026). A data-driven optimization approach for the integrated train scheduling and maintenance planning in high-speed railways. COR, 185, 107261. (www)

  @article{ , abstract = {In railway systems, preventive maintenance plans are essential for ensuring the safety of train operations. However, these tasks are often subject to various disturbances (e.g., bad weather), leading to unpredictable deviations between planned and actual maintenance durations, which can further disrupt train schedules. Unlike most studies that assume constant maintenance durations, this paper introduces a data-driven, two-stage distributionally robust optimization (DRO) model for jointly optimizing train scheduling and maintenance planning. In the first stage, we determine the initial train schedule and maintenance plan. In the second stage, we allow for slight adjustments to train departure and arrival times at each station to accommodate disturbances affecting maintenance tasks. Our objective is to minimize both the expected travel time of trains and the deviation from the planned schedule under worst-case scenarios for maintenance disturbances. To capture the uncertainty of maintenance disturbances, we construct an ambiguity set using historical data and the Wasserstein metric. We show that the proposed two-stage DRO model, formulated over the Wasserstein ambiguity set, can be reformulated into an efficiently solvable equivalent form. Finally, we apply our model to a real-world case study of the Beijing–Guangzhou high-speed railway and compare it with traditional stochastic programming methods, including sample average approximation and robust optimization. The results highlight the efficiency of our approach and provide valuable insights for railway management.}, archive = {J_COR}, author = {Hangyu Ji and Chuntian Zhang and Jiateng Yin and Lixing Yang}, doi = {10.1016/j.cor.2025.107261}, journal = {Computers & Operations Research}, month = {1}, pages = {107261}, shortjournal = {Comput. Oper. Res.}, title = {A data-driven optimization approach for the integrated train scheduling and maintenance planning in high-speed railways}, volume = {185}, year = {2026}, }
• (2026). ROBIST: Robust optimization by iterative scenario sampling and statistical testing. COR, 185, 107260. (www)

  @article{ , abstract = {In this paper, we propose ROBIST , a simple, yet effective, data-driven algorithm for optimization under parametric uncertainty. The algorithm first generates solutions in an iterative manner by sampling and optimizing over a relatively small set of scenarios. Then, using statistical testing, the robustness of the solutions is evaluated, which can be done with a much larger set of scenarios. ROBIST offers a number of practical advantages over existing methods as it is: (i) easy to implement, (ii) able to deal with a wide range of problems and (iii) capable of providing sharp probability guarantees that are easily computable and independent of the dimensions of the problem. Numerical experiments demonstrate the effectiveness of ROBIST in comparison to alternative methods.}, archive = {J_COR}, author = {Justin Starreveld and Guanyu Jin and Dick den Hertog and Roger J.A. Laeven}, doi = {10.1016/j.cor.2025.107260}, journal = {Computers & Operations Research}, month = {1}, pages = {107260}, shortjournal = {Comput. Oper. Res.}, title = {ROBIST: Robust optimization by iterative scenario sampling and statistical testing}, volume = {185}, year = {2026}, }
• (2026). A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites. COR, 185, 107259. (www)

  @article{ , abstract = {This paper presents a branch-and-price algorithm for solving the Optimal Network Task Scheduling (ONTS) problem in satellite constellations. The algorithm efficiently manages both constellation tasks that can be performed by any satellite and satellite-specific tasks that must be executed by designated satellites, while considering critical energy constraints. We formulate the problem as a Mixed-Integer Linear Programming (MILP) model and develop a Dantzig–Wolfe decomposition that handles battery management constraints for the satellites at the master level, while addressing constellation-wide coordination requirements in the subproblems. A novel dynamic programming algorithm is proposed to solve the pricing subproblem for constellation tasks, augmented with dual stabilization techniques to improve convergence. Comprehensive computational experiments on realistic instances derived from nanosatellite operations demonstrate the effectiveness of the algorithm. Results show that our structured formulation significantly outperforms a naive approach, particularly for large instances, while effectively balancing workload distribution and energy management across the constellation. This work provides a practical framework for optimizing task scheduling in modern satellite constellations, with direct applications in Earth observation, telecommunications, and scientific missions.}, archive = {J_COR}, author = {Pedro Marcolin Antunes and Laio Oriel Seman and Eduardo Camponogara}, doi = {10.1016/j.cor.2025.107259}, journal = {Computers & Operations Research}, month = {1}, pages = {107259}, shortjournal = {Comput. Oper. Res.}, title = {A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites}, volume = {185}, year = {2026}, }
• (2026). A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks. COR, 185, 107258. (www)

  @article{ , abstract = {The work presented in this paper is motivated by some practical applications, introducing and solving a new problem called the split delivery vehicle routing problem with time windows and two-dimensional loading constraints considering load balance (2L-SDVRPTW-LB). This problem expands the integrated routing and loading problem, in which the required pallet orders are delivered to customers by a fleet of homogeneous semi-trailer trucks. Firstly, with the goal to minimize the total transportation cost, a mixed-integer linear programming model for the 2L-SDVRPTW-LB is proposed. Secondly, an exact algorithm framework based on the branch-and-cut algorithm is designed to solve the problem. In the algorithm framework, a metaheuristic algorithm is designed to obtain the upper bound. Subsequently, various classes of valid inequalities are introduced to strengthen the formulation, while the constraints ensuring load balance are applied in a lazy manner to optimize computational efficiency. Numerical experiments based on modified benchmark instances demonstrate that the proposed branch-and-cut algorithm effectively solves the 2L-SDVRPTW-LB and its variant of excluding split delivery. This study provides valuable insights for addressing the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks.}, archive = {J_COR}, author = {Xiangbin Xu and Haoxing Ouyang}, doi = {10.1016/j.cor.2025.107258}, journal = {Computers & Operations Research}, month = {1}, pages = {107258}, shortjournal = {Comput. Oper. Res.}, title = {A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks}, volume = {185}, year = {2026}, }
• (2026). A hybrid memetic metaheuristic for medical staff assignment in major public health emergencies. COR, 185, 107256. (www)

  @article{ , abstract = {During major public health emergencies, effective assignment of medical staff is crucial for saving lives and controlling the spread of epidemics. This work focuses on the assignment of doctors and nurses to hospitals to form treatment groups that carry out patient treatment tasks. We consider the practical constraints of skill types of medical staff and the severity of patients’ conditions and propose a mixed integer programming model with the objective of maximizing demand satisfaction and personnel skill matching. To solve this problem, we introduce a hybrid memetic search algorithm that combines a specialized crossover operator for generating promising offspring solutions and a variable neighborhood search procedure to improve their quality. Computational results demonstrate that our algorithm outperforms the general mixed integer programming solver GUROBI . The key components of the proposed algorithm are experimentally analyzed and managerial insights are derived.}, archive = {J_COR}, author = {Yang Wang and He Zheng and Zequn Wei and Christophe Wilbaut and Saïd Hanafi}, doi = {10.1016/j.cor.2025.107256}, journal = {Computers & Operations Research}, month = {1}, pages = {107256}, shortjournal = {Comput. Oper. Res.}, title = {A hybrid memetic metaheuristic for medical staff assignment in major public health emergencies}, volume = {185}, year = {2026}, }
• (2026). Learning-guided iterated local search for the minmax multiple traveling salesman problem. COR, 185, 107255. (www)

  @article{ , abstract = {The minmax multiple traveling salesman problem involves minimizing the costs of a longest tour among a set of tours. The problem is of great practical interest because it can be used to formulate several real-life applications. To solve this computationally challenging problem, we propose a learning-driven iterated local search approach that combines an effective local search procedure to find high-quality local optimal solutions and a multi-armed bandit algorithm to select removal and insertion operators to escape local optimal traps. Extensive experiments on 77 commonly used benchmark instances show that the algorithm achieves excellent results in terms of solution quality and running time. In particular, it achieves 32 new best results (improved upper bounds) and matches the best-known results for 35 other instances. Additional experiments shed light on the understanding of the algorithm’s constituent elements. Multi-armed bandit selection can be used advantageously in other multi-operator local search algorithms.}, archive = {J_COR}, author = {Pengfei He and Jin-Kao Hao and Jinhui Xia}, doi = {10.1016/j.cor.2025.107255}, journal = {Computers & Operations Research}, month = {1}, pages = {107255}, shortjournal = {Comput. Oper. Res.}, title = {Learning-guided iterated local search for the minmax multiple traveling salesman problem}, volume = {185}, year = {2026}, }
• (2026). Grouping strategies on two-phase methods for bi-objective combinatorial optimization. COR, 185, 107254. (www)

  @article{ , abstract = {Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a dichotomic search. This phase also allows the identification of search zones that may contain other nondominated points. The second phase focuses on exploring these search zones to locate the remaining points, which typically accounts for most of the computational cost. Ranking algorithms are frequently employed to explore each zone individually, but this approach leads to redundancies, causing multiple visits to the same solutions. To mitigate these redundancies, we propose several strategies that group adjacent zones, allowing a single run of the ranking algorithm for the entire group. Additionally, we explore an implicit grouping approach based on a new concept of coverage. Our experiments on the Bi-Objective Spanning Tree Problem demonstrate the beneficial impact of these grouping strategies when combined with coverage.}, archive = {J_COR}, author = {Felipe O. Mota and Luís Paquete and Daniel Vanderpooten}, doi = {10.1016/j.cor.2025.107254}, journal = {Computers & Operations Research}, month = {1}, pages = {107254}, shortjournal = {Comput. Oper. Res.}, title = {Grouping strategies on two-phase methods for bi-objective combinatorial optimization}, volume = {185}, year = {2026}, }
• (2026). Drone-aided mobile blood collection problem: A rolling-horizon-based matheuristic. COR, 185, 107253. (www)

  @article{ , abstract = {This study introduces the drone-aided mobile blood collection problem, which integrates mobile blood donation vehicles with drones to improve operations related to the blood collection in urban areas. Each vehicle, carrying multiple drones, travels to several collection sites to conduct blood collection operations within a working day. Drones fly between vehicles to pick up collected blood bags and deliver them to the blood center. This collaborative framework enhances the performances of the collection system and ensures the freshness of collected blood upon arrival to the blood center. We develop a novel mixed-integer linear programming model to optimally synchronize the routes and collection schedules of mobile units and drones to ensure the timely delivery of collected blood to the blood center. We also develop a rolling-horizon-based matheuristic to solve large-scale instances of the problem. This algorithm combines a rolling horizon approach, which divides the problem into manageable subproblems solved sequentially, with a local branching technique that enhances solutions by exploring promising neighborhoods. To evaluate the algorithm’s performance, we conduct a comprehensive computational study. Our results show that the proposed algorithm not only finds better solutions than those obtained by Gurobi but also outperforms other matheuristics, including the rolling horizon, relax-and-fix, and fix-and-optimize algorithms. Finally, we demonstrate the real-life applicability of the problem through a case study in Quebec City, Canada.}, archive = {J_COR}, author = {Amirhossein Abbaszadeh and Hossein Hashemi Doulabi}, doi = {10.1016/j.cor.2025.107253}, journal = {Computers & Operations Research}, month = {1}, pages = {107253}, shortjournal = {Comput. Oper. Res.}, title = {Drone-aided mobile blood collection problem: A rolling-horizon-based matheuristic}, volume = {185}, year = {2026}, }
• (2026). Fair and efficient multi-agent routing for cooperative and autonomous agricultural fleets with implements. COR, 185, 107252. (www)

  @article{ , abstract = {The growing use of autonomous tractor fleets with detachable implements presents complex logistical challenges in agriculture. Current systems often rely on simple heuristics and avoid implement swapping, limiting efficiency. A central challenge is to dynamically coordinate vehicle routing and implement exchanges to enable efficient, low-intervention task execution. Due to high costs, such fleets are owned mainly by large enterprises or cooperatives, where fair task allocation and profit sharing are critical. Addressing both coordination and fairness, in this paper, we introduce the Agricultural Fleet Vehicle Routing Problem with Implements (AFVRPI). We propose a distributed model derived from a centralized formulation also presented in this paper. This model is embedded within a Distributed Multi-Agent System Architecture (DIMASA), where autonomous vehicle agents manage routing and implement use under limited fuel autonomy, while implement agents ensure compatibility and sufficient capacity to meet task demands. Our solution applies systematic egalitarian social welfare optimization to iteratively maximize the profit of the worst-off vehicle, balancing fairness with system efficiency. To enhance scalability, we use column generation in the distributed model, achieving solution quality comparable to the centralized model while significantly reducing computing time. Simulation results on new benchmark instances demonstrate that our distributed multi-agent AFVRPI approach is scalable, efficient, and fair.}, archive = {J_COR}, author = {Aitor López-Sánchez and Marin Lujak and Frédéric Semet and Holger Billhardt}, doi = {10.1016/j.cor.2025.107252}, journal = {Computers & Operations Research}, month = {1}, pages = {107252}, shortjournal = {Comput. Oper. Res.}, title = {Fair and efficient multi-agent routing for cooperative and autonomous agricultural fleets with implements}, volume = {185}, year = {2026}, }
• (2026). Flexible scheduling of customized bus for green mega-events: A distributionally robust optimization approach. COR, 185, 107249. (www)

  @article{ , abstract = {Mega-events such as the Olympics and the World Championships face significant challenges in evacuating large numbers of attendees after the events conclude, which consume substantial transportation resources. Under the global pressure to reduce carbon emissions, energy conservation and emission reduction are increasingly becoming top priorities. This paper focuses on the efficient scheduling of customized buses (CB) after green mega-events, incorporating skip-stop operations and coordinated bus services to minimize energy consumption, fixed and transportation costs, and facilitate the evacuation of attendees, while accounting for practical constraints such as the availability of customized buses, vehicle capacity, time windows, and flow balance. A distributionally robust optimization (DRO) model is developed, using a novel ambiguity set to model uncertain demand via parametric interval-valued fuzzy variables. To ensure computational tractability, the model is reformulated as an integer linear programming model. To address the computational challenges of large-scale instances, an improved variable neighborhood search heuristic is designed by incorporating the reinforcement learning techniques, including the KL-UCB algorithm and a sliding window mechanism. Extensive numerical experiments are conducted to verify the performance of the proposed heuristic. Computational results demonstrate that the proposed DRO model effectively handles uncertainty, offering robust and adaptable solutions. Compared to existing heuristics, the proposed heuristic improves performance by 6.51% on average, and incorporating reinforcement learning into VNS enhances computational efficiency by 4.88% on average. A real-life case study further validates the model, demonstrating that the skip-stop strategy significantly reduces vehicle travel time and enhances overall operational efficiency.}, archive = {J_COR}, author = {Xiaojie An and Xiang Li and Bowen Zhang}, doi = {10.1016/j.cor.2025.107249}, journal = {Computers & Operations Research}, month = {1}, pages = {107249}, shortjournal = {Comput. Oper. Res.}, title = {Flexible scheduling of customized bus for green mega-events: A distributionally robust optimization approach}, volume = {185}, year = {2026}, }
• (2026). Optimal planning of power distribution networks with fault-tolerant configuration. COR, 185, 107248. (www)

  @article{ , abstract = {Power Distribution networks are essential infrastructures that should be designed by satisfying two conflicting requests: cost minimization and reliability. While traditional network planning aimed at radial configurations, which are more similar to the typical working configuration of a network but are not fault-tolerant, modern techniques seek for meshed configurations, since these architectures are more fault-tolerant. Due to the complexity of the problem and the large size of nowadays instances, most of the techniques used for planning are based on heuristic approaches. Thus, they are usually unable to guarantee optimality and not even able to provide an assessment of the distance from the optimal solution. In this work, we address the challenge of planning a fault tolerant network through an exact approach, by introducing innovative Mixed-Integer Linear Programming models designed for the planning of meshed distribution networks with loop-feeder or open-loop topology. Differently from other techniques, our approach simplifies the formulation by avoiding the need for fault scenarios, significantly reducing the computational burden of the optimization problem. The outcomes of our approach are the generation of optimal meshed network, which effectively balance cost and reliability of the electric distribution system. Comprehensive studies on realistic test instances show the advantages of the proposed formulations.}, archive = {J_COR}, author = {Renato Bruni and Alberto Geri and Marco Maccioni and Ludovico Nati}, doi = {10.1016/j.cor.2025.107248}, journal = {Computers & Operations Research}, month = {1}, pages = {107248}, shortjournal = {Comput. Oper. Res.}, title = {Optimal planning of power distribution networks with fault-tolerant configuration}, volume = {185}, year = {2026}, }
• (2026). Centrality measures and opinion dynamics in two-layer networks with replica nodes. COR, 185, 107245. (www)

  @article{ , abstract = {We propose two fast and accurate algorithms to approximate game-theoretic centrality measures and examine connection between centrality measures, network properties, and key performance indicators (consensus time and winning rate) of opinion dynamic processes on such networks. As an example, we consider a Zachary’s karate club as a social network and extend it by adding the second (internal) layer of communication. The internal layer represents the network where individuals can share their real opinions with the close friends. The structures of the external and internal layers may be different. The significant positive correlation between internal graph density and consensus time, and significant negative correlation between centrality of authoritative nodes and consensus time are found. The proposed algorithms are verified by a series of experiments from two aspects: the accuracy and the efficiency. The algorithms are novel and can be considered as a contribution to the network theory independently of opinion dynamics as they can be used to calculate node centrality in any weighted graph.}, archive = {J_COR}, author = {Chi Zhao and Elena Parilina}, doi = {10.1016/j.cor.2025.107245}, journal = {Computers & Operations Research}, month = {1}, pages = {107245}, shortjournal = {Comput. Oper. Res.}, title = {Centrality measures and opinion dynamics in two-layer networks with replica nodes}, volume = {185}, year = {2026}, }
• (2026). AI automatic decision in newsvendor model with nash bargaining fairness concern. COR, 185, 107227. (www)

  @article{ , abstract = {This paper investigates the impact of artificial intelligence (AI) automatic ordering and producing decisions on fairness-concerned supply chains under the newsvendor model. We develop a dyadic supply chain model in which the manufacturer acts as the Stackelberg leader while the retailer serves as the follower in a push supply chain. In contrast, their roles are switched in a pull supply chain. We assume that only human decision-making leads to decision regret behavior, whereas AI-automated decision-making does not. Without adopting AI, our results show that fairness concern does not necessarily lead to a decreasing quantity in ordering or producing, which is different from most previous studies. Different from the prior findings, our work reveals that in binding equilibrium, if fairness concerns are considered, the order quantity will decrease, while in non-binding equilibrium, the order quantity may not necessarily be less than the previous results. Interestingly, when decision regret bias is considered for fairness-concerned decision-makers, we can obtain quantity coordination solutions for supply chains under specific conditions. With adopting AI, our results show that increasing fairness concerns are beneficial for improving the follower’s profit while at the expense of sacrificing the leader’s profit margins, while the leader can only benefit from AI adoption when the decision regret bias of the follower is relatively high. It is noteworthy that under certain conditions, AI automation may negatively impact the profits of both push and pull decentralized supply chains. For instance, in low-margin profit scenarios where decision-makers exhibit moderate regret bias and fairness concerns, such effects can emerge. This indicates that under specific circumstances, the human behavioral factors — regret bias and fairness concerns — may sometimes enhance the performance of decentralized supply chain members. Our research findings provide significant practical implications for the adoption of AI-automated decision-making in real-world supply chains.}, archive = {J_COR}, author = {Rui Hou and Yishen Cen and Jianxin Chen}, doi = {10.1016/j.cor.2025.107227}, journal = {Computers & Operations Research}, month = {1}, pages = {107227}, shortjournal = {Comput. Oper. Res.}, title = {AI automatic decision in newsvendor model with nash bargaining fairness concern}, volume = {185}, year = {2026}, }
• (2026). Green horizons: Sustainable global logistics in dynamic supply chain management. COR, 185, 107226. (www)

  @article{ , abstract = {Supply chain management in a global scale involves addressing numerous uncertainties, from demand fluctuations to unforeseen disruptions. Developing advanced solution approaches is critical to manage such complexities and ensure resilience. This study presents a multi-stage stochastic–dynamic model for the global supply chain, incorporating hedging policies. The aim is to identify optimal order scheduling for bill of materials, production planning, and inventory management across warehouses (i.e., materials and finished products). Due to the dynamic nature of the global supply chain (e.g., demand fluctuations, disruptions, and lead time), a multi-stage stochastic model is developed for the stochastic–dynamic supply chain network. To address dynamic factors of real-world global supply chain, an accelerated parallel stochastic dual dynamic integer programming (SDDiP) approach is proposed to deal with disruptions (e.g., political unrest, natural disasters, and pandemics), enhancing supply chain resiliency. To validate the proposed parallel SDDiP , various scenarios with different sizes are generated using the case study and compared to the SDDiP with Benders cuts and integrated stage-wise Lagrangian dual cut ( SWLDC ) (i.e., SDDiP-SWLDC ). According to the obtained results, the proposed parallel node strategy for accelerated SDDiP consistently outperforms the basic stochastic dual dynamic programming (SDDP) and demonstrated robust CPU scalability. Evaluation across various scenario sizes shows stochastic dual dynamic integer programming-mixed integer rounding cuts ( SDDiP-MIR ) achieving faster computation and a smaller 7% optimality gap compared to SDDiP-SWLDC and SDDiP in large-size instances, highlighting its superior performance in complex supply chain settings.}, archive = {J_COR}, author = {Mahsa Mohammadi and Babak Mohamadpour Tosarkani}, doi = {10.1016/j.cor.2025.107226}, journal = {Computers & Operations Research}, month = {1}, pages = {107226}, shortjournal = {Comput. Oper. Res.}, title = {Green horizons: Sustainable global logistics in dynamic supply chain management}, volume = {185}, year = {2026}, }

CSDA - 5

• (2026). Resampling NANCOVA: Nonparametric analysis of covariance in small samples. CSDA, 215, 108290. (www)

  @article{ , abstract = {Analysis of covariance is a crucial method for improving precision of statistical tests for factor effects in randomized experiments. However, existing solutions suffer from one or more of the following limitations: (i) they are not suitable for ordinal data (as endpoints or explanatory variables); (ii) they require semiparametric model assumptions; (iii) they are inapplicable to small data scenarios due to often poor type-I error control; or (iv) they provide only approximate testing procedures and (asymptotically) exact test are missing. A resampling approach to the NANCOVA framework is investigated. NANCOVA is a fully nonparametric model based on relative effects that allows for an arbitrary number of covariates and groups, where both outcome variable (endpoint) and covariates can be metric or ordinal. Novel NANCOVA tests and a nonparametric competitor test without covariate adjustment were evaluated in extensive simulations. Unlike approximate tests in the NANCOVA framework, the proposed resampling version showed good performance in small sample scenarios and maintained the nominal type-I error well. Resampling NANCOVA also provided consistently high power: up to 26 % higher than the test without covariate adjustment in a small sample scenario with 4 groups and two covariates. Moreover, it is shown that resampling NANCOVA provides an asymptotically exact testing procedure, which makes it the first one with good finite sample performance in the present NANCOVA framework. In summary, resampling NANCOVA can be considered a viable tool for analysis of covariance overcoming issues (i) - (iv).}, archive = {J_CSDA}, author = {Konstantin Emil Thiel and Paavo Sattler and Arne C. Bathke and Georg Zimmermann}, doi = {10.1016/j.csda.2025.108290}, journal = {Computational Statistics & Data Analysis}, month = {3}, pages = {108290}, shortjournal = {Comput. Stat. Data Anal.}, title = {Resampling NANCOVA: Nonparametric analysis of covariance in small samples}, volume = {215}, year = {2026}, }
• (2026). Bootstrap-based goodness-of-fit test for parametric families of conditional distributions. CSDA, 215, 108289. (www)

  @article{ , abstract = {A consistent goodness-of-fit test for distributional regression is introduced. The test statistic is based on a process that traces the difference between a nonparametric and a semi-parametric estimate of the marginal distribution function of Y . As its asymptotic null distribution is not distribution-free, a parametric bootstrap method is used to determine critical values. Empirical results suggest that, in certain scenarios, the test outperforms existing specification tests by achieving a higher power and thereby offering greater sensitivity to deviations from the assumed parametric distribution family. Notably, the proposed test does not involve any hyperparameters and can easily be applied to individual datasets using the gofreg-package in R.}, archive = {J_CSDA}, author = {Gitte Kremling and Gerhard Dikta}, doi = {10.1016/j.csda.2025.108289}, journal = {Computational Statistics & Data Analysis}, month = {3}, pages = {108289}, shortjournal = {Comput. Stat. Data Anal.}, title = {Bootstrap-based goodness-of-fit test for parametric families of conditional distributions}, volume = {215}, year = {2026}, }
• (2026). Fast autoregressive model for multivariate dependent outcomes with application to lipidomics analysis for alzheimer’s disease and APOE-ε4. CSDA, 215, 108280. (www)

  @article{ , abstract = {Association analysis of multivariate omics outcomes is challenging due to the high dimensionality and inter-correlation among outcome variables. In practice, the classic multi-univariate analysis approaches are commonly employed, utilizing linear regression models for each individual outcome followed by adjustments for multiplicity through control of the false discovery rate (FDR) or family-wise error rate (FWER). While straightforward, these multi-univariate methods overlook dependencies between outcome variables. This oversight leads to less accurate statistical inferences, characterized by lower power and an increased false discovery rate, ultimately resulting in reduced replicability across studies. Recently, advanced frequentist and Bayesian methods have been developed to account for these dependencies. However, these methods often pose significant computational challenges for researchers in the field. To bridge this gap, a computationally efficient autoregressive multivariate regression model is proposed that explicitly accounts for the dependence structure among outcome variables. Through extensive simulations, it is demonstrated that the approach provides more accurate multivariate inferences than traditional methods and remains robust even under model misspecification. Additionally, the proposed method is applied to investigate whether the associations between serum lipidomics outcomes and Alzheimer’s disease differentiate in ε 4 allele carriers and non-carriers of the apolipoprotein E (APOE) gene.}, archive = {J_CSDA}, author = {Hwiyoung Lee and Zhenyao Ye and Chixiang Chen and Peter Kochunov and L. Elliot Hong and Shuo Chen}, doi = {10.1016/j.csda.2025.108280}, journal = {Computational Statistics & Data Analysis}, month = {3}, pages = {108280}, shortjournal = {Comput. Stat. Data Anal.}, title = {Fast autoregressive model for multivariate dependent outcomes with application to lipidomics analysis for alzheimer’s disease and APOE-ε4}, volume = {215}, year = {2026}, }
• (2026). Change-point detection in regression models via the max-EM algorithm. CSDA, 215, 108278. (www)

  @article{ , abstract = {The problem of breakpoint detection is considered within a regression modeling framework. A novel method, the max-EM algorithm, is introduced, combining a constrained Hidden Markov Model with the Classification-EM algorithm. This algorithm has linear complexity and provides accurate detection of breakpoints and estimation of parameters. A theoretical result is derived, showing that the likelihood of the data, as a function of the regression parameters and the breakpoints location, increases at each step of the algorithm. Two initialization methods for the breakpoints location are also presented to address local maxima issues. Finally, a statistical test in the one breakpoint situation is developed. Simulation experiments based on linear, logistic, Poisson and Accelerated Failure Time regression models show that the final method that includes the initialization procedure and the max-EM algorithm has a strong performance both in terms of parameters estimation and breakpoints detection. The statistical test is also evaluated and exhibits a correct rejection rate under the null hypothesis and a strong power under various alternatives. Two real dataset are analyzed, the UCI bike sharing and the health disease data, where the interest of the method to detect heterogeneity in the distribution of the data is illustrated.}, archive = {J_CSDA}, author = {Modibo Diabaté and Grégory Nuel and Olivier Bouaziz}, doi = {10.1016/j.csda.2025.108278}, journal = {Computational Statistics & Data Analysis}, month = {3}, pages = {108278}, shortjournal = {Comput. Stat. Data Anal.}, title = {Change-point detection in regression models via the max-EM algorithm}, volume = {215}, year = {2026}, }
• (2026). Recursive nonparametric predictive for a discrete regression model. CSDA, 215, 108275. (www)

  @article{ , abstract = {A recursive algorithm is proposed to estimate a set of distribution functions indexed by a regressor variable. The procedure is fully nonparametric and has a Bayesian motivation and interpretation. Indeed, the recursive algorithm follows a certain Bayesian update, defined by the predictive distribution of a Dirichlet process mixture of linear regression models. Consistency of the algorithm is demonstrated under mild assumptions, and numerical accuracy in finite samples is shown via simulations and real data examples. The algorithm is very fast to implement, it is parallelizable, sequential, and requires limited computing power.}, archive = {J_CSDA}, author = {Lorenzo Cappello and Stephen G. Walker}, doi = {10.1016/j.csda.2025.108275}, journal = {Computational Statistics & Data Analysis}, month = {3}, pages = {108275}, shortjournal = {Comput. Stat. Data Anal.}, title = {Recursive nonparametric predictive for a discrete regression model}, volume = {215}, year = {2026}, }

CVIU - 18

• (2025). IP-CAM: Class activation mapping based on importance weights and principal-component weights for better and simpler visual explanations. CVIU, 261, 104523. (www)

  @article{ , abstract = {Visual explanations of deep neural networks (DNNs) have gained considerable importance in deep learning due to the lack of interpretability, which constrains human trust in DNNs. This paper proposes a new gradient-free class activation map (CAM) architecture called importance principal-component CAM (IP-CAM). The architecture not only improves the prediction accuracy of networks but also provides simpler and more reliable visual explanations. It adds importance weight layers before the classifier and assigns an importance weight to each activation map. After fine-tuning, it selects images with the highest prediction score for each class, performs principal component analysis (PCA) on activation maps of all channels, and regards the eigenvector of the first principal component as principal-component weights for that class. The final saliency map is obtained by linearly combining the activation maps, importance weights and principal-component weights. IP-CAM is evaluated on the ILSVRC 2012 dataset and RSD46-WHU dataset, whose results show that IP-CAM performs better than most previous CAM variants in recognition and localization tasks. Finally, the method is applied as a tool for interpretability, and the results illustrate that IP-CAM effectively unveils the decision-making process of DNNs through saliency maps.}, archive = {J_CVIU}, author = {Wenyi Zhang and Haoran Zhang and Xisheng Zhang and Xiaohua Shen and Lejun Zou}, doi = {10.1016/j.cviu.2025.104523}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104523}, shortjournal = {Comput. Vis. Image Understanding}, title = {IP-CAM: Class activation mapping based on importance weights and principal-component weights for better and simpler visual explanations}, volume = {261}, year = {2025}, }
• (2025). MSBATN: Multi-stage boundary-aware transformer network for action segmentation in untrimmed surgical videos. CVIU, 261, 104521. (www)

  @article{ , abstract = {Understanding actions within surgical workflows is critical for evaluating post-operative outcomes and enhancing surgical training and efficiency. Capturing and analysing long sequences of actions in surgical settings is challenging due to the inherent variability in individual surgeon approaches, which are shaped by their expertise and preferences. This variability complicates the identification and segmentation of distinct actions with ambiguous boundary start and end points. The traditional models, such as MS-TCN, which rely on large receptive fields, cause over-segmentation or under-segmentation, where distinct actions are incorrectly aligned. To address these challenges, we propose the Multi-Stage Boundary-Aware Transformer Network (MSBATN) with hierarchical sliding window attention to improve action segmentation. Our approach effectively manages the complexity of varying action durations and subtle transitions by accurately identifying start and end action boundaries in untrimmed surgical videos. MSBATN introduces a novel unified loss function that optimises action classification and boundary detection as interconnected tasks. Unlike conventional binary boundary detection methods, our innovative boundary weighing mechanism leverages contextual information to precisely identify action boundaries. Extensive experiments on three challenging surgical datasets demonstrate that MSBATN achieves state-of-the-art performance, with superior F1 scores at 25% and 50% thresholds and competitive results across other metrics.}, archive = {J_CVIU}, author = {Rezowan Shuvo and M.S. Mekala and Eyad Elyan}, doi = {10.1016/j.cviu.2025.104521}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104521}, shortjournal = {Comput. Vis. Image Understanding}, title = {MSBATN: Multi-stage boundary-aware transformer network for action segmentation in untrimmed surgical videos}, volume = {261}, year = {2025}, }
• (2025). SVFFNet: A scale-aware voxel flow fusion network for video prediction. CVIU, 261, 104520. (www)

  @article{ , abstract = {Video prediction is a challenging task due to the potential for various motion scales in the complex scene. The diversity of motion scales stems from the time-variant and object-dependent motion magnitudes, as well as the multiple image resolutions across datasets. However, the vast majority of frame forecasting networks do not distinguish between treatment of different motion scales. Therefore, their receptive field is normally insufficient to capture larger-scale motions. Those that do, often yield significant local distortions in the predicted images. The reasons lie in their fixed choice of scale factors and lack of cross-scale interaction between motion features. In this work, we propose a Scale-Aware Voxel Flow Fusion Network (SVFFNet) to address the motion scale inconsistency problem and fully integrate multi-scale feature. This network consists of a set of flow estimation blocks, each block containing a selector module and a fusion module. The selector module adaptively selects the appropriate scale-processing branch for the input frames, thus facilitating acquisition of more refined features for large-scale motion. The fusion module then combines these features with the original motion information via an attention mechanism, preserving the actually existing structural details. Experimental results on four widely used benchmark datasets demonstrate that our method outperforms previously published baselines for video prediction. The code is available at: https://github.com/zyaojlu/SVFFNet .}, archive = {J_CVIU}, author = {Yao Zhou and Jinpeng Wei and Xueyong Zhang and Yusong Zhai and Jian Wei}, doi = {10.1016/j.cviu.2025.104520}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104520}, shortjournal = {Comput. Vis. Image Understanding}, title = {SVFFNet: A scale-aware voxel flow fusion network for video prediction}, volume = {261}, year = {2025}, }
• (2025). Generalization-preserving adaptation of vision-language models for open-vocabulary segmentation. CVIU, 261, 104518. (www)

  @article{ , abstract = {Recent progress in large-scale Vision-Language Models (VLMs) has significantly advanced open-vocabulary segmentation. Previous works typically either generate class-agnostic masks and classify them with frozen VLMs, or align the mask generator features with VLM text features. These approaches face challenges of weak spatial discrimination ability of frozen VLMs and poor generalization due to unreliable vision-language alignment. This paper introduces a novel Generalization-Preserving Adaptation (GPA) of VLMs for open-vocabulary segmentation. GPA enhances the spatial discrimination capability of pre-trained VLMs through an efficient fine-tuning scheme, which incorporates a spatial adaptation module comprising spatial dependency modeling and low-rank feature modulation for preserving the feature space. Additionally, GPA proposes a context-aware feature aggregation module to extract mask features better aligned with the VLM features for mask classification. It performs decoupled context modeling that generates object-agnostic contextualized feature map and object-specific classification maps for accentuating discriminative and contextual clues. By maintaining the original VLM feature distribution for vision-language alignment, GPA effectively preserves the generalization capabilities of VLMs while enhancing segmentation performance. Extensive experiments on multiple open-vocabulary panoptic and semantic segmentation benchmarks demonstrate both superior effectiveness and generalization capabilities compared to previous works.}, archive = {J_CVIU}, author = {Zhen Chen and Hao Tang and Shiliang Zhang}, doi = {10.1016/j.cviu.2025.104518}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104518}, shortjournal = {Comput. Vis. Image Understanding}, title = {Generalization-preserving adaptation of vision-language models for open-vocabulary segmentation}, volume = {261}, year = {2025}, }
• (2025). Beyond geometry: The power of texture in interpretable 3D person ReID. CVIU, 261, 104517. (www)

  @article{ , abstract = {This paper presents FusionTexReIDNet, a robust framework for 3D person re-identification that uniquely leverages UVTexture to enhance both performance and explainability. Unlike existing 3D person ReID approaches that simply overlay textures on point clouds, our method exploits the full potential of UVTexture through its high resolution and normalized coordinate properties. The framework consists of two main streams: a UVTexture stream that processes appearance features and a 3D stream that handles geometric information. These streams are fused through an effective combination of KNN, attribute-based, and explainable re-ranking strategies. Our approach introduces explainability to 3D person ReID through the visualization of activation maps on UVTextures, providing insights into the model’s decision-making process by highlighting discriminative regions. By incorporating the Intersection-Alignment Score derived from activation maps and visible clothing masks, we further improve the ReID accuracy. Extensive experiments demonstrate that FusionTexReIDNet achieves state-of-the-art performance across various scenarios, with Rank-1 accuracies of 98.5% and 89.7% Rank-1 on benchmark datasets, while providing interpretable results through its explainable component.}, archive = {J_CVIU}, author = {Huy Nguyen and Kien Nguyen and Akila Pemasiri and Sridha Sridharan and Clinton Fookes}, doi = {10.1016/j.cviu.2025.104517}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104517}, shortjournal = {Comput. Vis. Image Understanding}, title = {Beyond geometry: The power of texture in interpretable 3D person ReID}, volume = {261}, year = {2025}, }
• (2025). Synergistic dual and efficient additive attention network for no-reference image quality assessment. CVIU, 261, 104516. (www)

  @article{ , abstract = {No-Reference Image Quality Assessment (NR-IQA) aims to evaluate the perceptual quality of images in alignment with human subjective judgments. However, most existing NR-IQA methods, while striving for high accuracy, often neglect computational complexity. To address this challenge, we propose a Synergistic Spatial and Channel and Efficient Additive Attention Network for NR-IQA. In our approach, we first employ a feature extraction module to derive features rich in both distortion and semantic information. Subsequently, we introduce a spatial-channel synergistic attention mechanism to enhance feature representations across spatial and channel dimensions. This attention module focuses on the most salient regions of the image and modulates feature responses accordingly, enabling the network to emphasize critical distortions and semantic features pertinent to perceptual quality assessment. Specifically, the spatial attention mechanism identifies significant regions that substantially contribute to quality perception, while the channel attention mechanism adjusts the importance of each feature channel, ensuring effective utilization of spatial and channel-specific information. Furthermore, to enhance the model’s robustness, we incorporate an Efficient Additive Attention mechanism alongside a Multi-scale Feed-forward Network, designed to reduce computational costs without compromising performance. Finally, a dual-branch structure for patch-weighted quality prediction is employed to derive the final quality score based on the weighted scores of individual patches. Extensive experimental evaluations on four widely used benchmark datasets demonstrate that the proposed method surpasses several state-of-the-art NR-IQA approaches in both performance and computational efficiency.}, archive = {J_CVIU}, author = {Zhou Fang and Baiming Feng and Ning Li}, doi = {10.1016/j.cviu.2025.104516}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104516}, shortjournal = {Comput. Vis. Image Understanding}, title = {Synergistic dual and efficient additive attention network for no-reference image quality assessment}, volume = {261}, year = {2025}, }
• (2025). Iterative caption generation with heuristic guidance for enhancing knowledge-based visual question answering. CVIU, 261, 104515. (www)

  @article{ , abstract = {The advent of large language models (LLMs) has significantly advanced Knowledge-based Visual Question Answering (KBVQA) by reducing the reliance on external knowledge bases. Traditional methods often generate captions in a single pass, which can struggle with complex questions due to difficulty in precisely identifying key visual components. This challenge undermines the reasoning capabilities of LLMs, which require accurate, semantically aligned captions to answer complex questions effectively. To address this limitation, we propose ICGHG I terative C aption G eneration with H euristic G uidance, a novel framework that refines captions iteratively. Our approach incorporates a dynamic loop where captions are continuously refined based on heuristic feedback from a set of candidate answers and the question itself, ensuring that the final caption provides accurate semantic alignment with both the visual content and the question. By leveraging this iterative process, ICGHG mitigates common issues such as hallucinations and improves the quality of the generated captions. Extensive experiments on OK-VQA, A-OKVQA, and FVQA datasets demonstrate that ICGHG significantly outperforms existing methods, achieving 57.5%, 60.2%, and 69.4% accuracy on their respective test sets, setting new benchmarks in KBVQA accuracy.}, archive = {J_CVIU}, author = {Fengyuan Liu and Zhongjian Hu and Peng Yang and Xingyu Liu}, doi = {10.1016/j.cviu.2025.104515}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104515}, shortjournal = {Comput. Vis. Image Understanding}, title = {Iterative caption generation with heuristic guidance for enhancing knowledge-based visual question answering}, volume = {261}, year = {2025}, }
• (2025). KD-mamba: Selective state space models with knowledge distillation for trajectory prediction. CVIU, 261, 104499. (www)

  @article{ , abstract = {Trajectory prediction is a key component of intelligent mobility systems and human–robot interaction. The inherently stochastic nature of human behavior, coupled with external environmental influences, poses significant challenges for long-term prediction. However, existing approaches struggle to effectively model spatial interactions and accurately predict long-term destinations, while their high computational demands limit real-world applicability. To address these limitations, this paper presents KD-Mamba, the Selective State Space Models with Knowledge Distillation for trajectory prediction. The model incorporates the U-CMamba module, which features a U-shaped encoder–decoder architecture. By integrating convolutional neural networks (CNN) with the Mamba mechanism, this module effectively captures local spatial interactions and global contextual information of human motion patterns. Subsequently, we introduce a Bi-Mamba module, which captures long-term dependencies in human movement, ensuring a more accurate representation of trajectory dynamics. Knowledge distillation strengthens both modules by facilitating knowledge transfer across diverse scenarios. Compared to transformer-based approaches, KD-Mamba reduces computational complexity from quadratic to linear. Extensive experimental results from two real-world trajectory datasets indicate that KD-Mamba outperforms the existing mainstream baselines. The proposed method provides insights into the application of trajectory prediction in human-in-the-loop assistive systems.}, archive = {J_CVIU}, author = {Shaokang Cheng and Sourav Das and Shiru Qu and Lamberto Ballan}, doi = {10.1016/j.cviu.2025.104499}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104499}, shortjournal = {Comput. Vis. Image Understanding}, title = {KD-mamba: Selective state space models with knowledge distillation for trajectory prediction}, volume = {261}, year = {2025}, }
• (2025). Gloss-free sign language translation: An unbiased evaluation of progress in the field. CVIU, 261, 104498. (www)

  @article{ , abstract = {Sign Language Translation (SLT) aims to automatically convert visual sign language videos into spoken language text and vice versa. While recent years have seen rapid progress, the true sources of performance improvements often remain unclear. Do reported performance gains come from methodological novelty, or from the choice of a different backbone, training optimizations, hyperparameter tuning, or even differences in the calculation of evaluation metrics? This paper presents a comprehensive study of recent gloss-free SLT models by re-implementing key contributions in a unified codebase. We ensure fair comparison by standardizing preprocessing, video encoders, and training setups across all methods. Our analysis shows that many of the performance gains reported in the literature often diminish when models are evaluated under consistent conditions, suggesting that implementation details and evaluation setups play a significant role in determining results. We make the codebase publicly available here 1 to support transparency and reproducibility in SLT research.}, archive = {J_CVIU}, author = {Ozge Mercanoglu Sincan and Jian He Low and Sobhan Asasi and Richard Bowden}, doi = {10.1016/j.cviu.2025.104498}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104498}, shortjournal = {Comput. Vis. Image Understanding}, title = {Gloss-free sign language translation: An unbiased evaluation of progress in the field}, volume = {261}, year = {2025}, }
• (2025). Two-stage attribute-guided dual attention network for fine-grained fashion retrieval. CVIU, 261, 104497. (www)

  @article{ , abstract = {Fine-grained clothing retrieval is essential for intelligent shopping and personalized recommendation systems. However, conventional methods often fail to capture subtle attribute variations. This paper proposes a novel two-stage attribute-guided dual attention network. The network combines global and local feature extraction with Attribute-aware Multi-Scale Spatial Attention (AMSA) and Attribute-guided Dynamic Channel Attention (ADCA). AMSA captures attribute-specific spatial details at multiple scales, while ADCA dynamically adjusts channel importance based on attribute embeddings, enabling precise attribute-level similarity modeling. A multi-level joint loss function further optimizes both global and local representations and enhances feature alignment. Experiments on FashionAI and the self-built FGDress dataset show that the proposed method achieves mAP scores of 66.01% and 73.98%, respectively, outperforming baseline approaches. Attribute-level analysis confirms robust recognition of both well-defined and challenging attributes. These results validate the practicality and generalizability of the proposed framework, with promising applications in personalized recommendation, fashion trend analysis, and design evaluation.}, archive = {J_CVIU}, author = {Bo Pan and Jun Xiang and Ning Zhang and Ruru Pan}, doi = {10.1016/j.cviu.2025.104497}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104497}, shortjournal = {Comput. Vis. Image Understanding}, title = {Two-stage attribute-guided dual attention network for fine-grained fashion retrieval}, volume = {261}, year = {2025}, }
• (2025). JSF: A joint spatial-frequency domain network for low-light image enhancement. CVIU, 261, 104496. (www)

  @article{ , abstract = {The enhancement of low-light images remains a prominent focus in the field of image processing. The degree of lightness significantly influences vision-based intelligent recognition and analysis. Departing from conventional methods, this paper proposes an innovative joint spatial-frequency domain network for low-light image enhancement, referred to as JSF. In the spatial domain, brightness is optimized through the amalgamation of global and local information. In the frequency domain, noise is reduced and details are amplified using Fourier Transformation to carry out amplitude and phase enhancement. Additionally, the enhanced results from the aforementioned domains are fused by linear and nonlinear stretching. To validate the effectiveness of JSF, this paper presents both qualitative and quantitative comparison results, demonstrating its superiority over several existing state-of-the-art methods.}, archive = {J_CVIU}, author = {Yahong Wu and Feng Liu and Rong Wang}, doi = {10.1016/j.cviu.2025.104496}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104496}, shortjournal = {Comput. Vis. Image Understanding}, title = {JSF: A joint spatial-frequency domain network for low-light image enhancement}, volume = {261}, year = {2025}, }
• (2025). FCNet: A feature complementary network for nighttime flare removal. CVIU, 261, 104495. (www)

  @article{ , abstract = {Nighttime image flare removal is a very challenging task due to the presence of various types of unfavorable degrading effects, including glare, shimmer, streak and saturated blobs. Most of the existing methods focus on the spatial domain and limited perception field, resulting in incomplete flare removal and severe artifacts. To address these challenges, we propose a two-stage feature complementary network for nighttime flare removal, which is used for flare perception and removal, respectively. In the first stage, a Spatial-Frequency Complementary Module (SFCM) is designed to perceive the flare region from different domains to get a mask of the flare. In the second stage, the flare mask and image are fed into the Spatial-Frequency Complementary Gating Module (SFCGM) to preserve the background information, while removing the flares from different angles and restoring the detailed features. Finally the flare and non-flare regions are modeled by the Flare Interactive Module (FIM) to refine the flare regions at a fine-grained level to suppress the artifact problem. Extensive experiments on Flare 7K++ validate the superiority of the proposed approach over state-of-the-arts, both qualitatively and quantitatively.}, archive = {J_CVIU}, author = {Kejing Qi and Bo Wang and Chongyi Li}, doi = {10.1016/j.cviu.2025.104495}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104495}, shortjournal = {Comput. Vis. Image Understanding}, title = {FCNet: A feature complementary network for nighttime flare removal}, volume = {261}, year = {2025}, }
• (2025). GRE-net: A forgery image detection framework based on gradient feature and reconstruction error. CVIU, 261, 104494. (www)

  @article{ , abstract = {With the continuous technological breakthroughs in Generative Adversarial Networks (GANs) and diffusion models, remarkable progress has been achieved in the field of image generation. These technologies enable the creation of highly realistic images, thereby intensifying the risk of spreading fake information. However, traditional image detectors face a growing challenge of inadequate generalization capabilities when confronted with images generated by models that were not included during the training phase. To tackle this challenge, we introduce a novel detection framework, named GRE-Net (Network integrating Gradient and Reconstruction Error), which extracts gradient feature through the DPG module and calculates the reconstruction error utilizing the DIRE method. By integrating these two aspects into a comprehensive feature representation, GRE-Net effectively detects the authenticity of images. Specifically, we devise a dual-branch model that leverages the proposed DPG (Discriminator of ProjectedGAN to extract Gradient) module to extract gradient feature from images and concurrently employs the DIRE (DIffusion Reconstruction Error) method to obtain the diffusion reconstruction error of images. By fusing the features extracted from these two modules as a universal representation, we describe the artifacts produced by generative models, crafting a comprehensive detector capable of identifying both GAN-generated and diffusion model-generated images. Notably, the DPG approach utilizes the discriminator of ProjectedGAN as an intermediary bridge, mapping all data into the gradient domain. This transformation process effectively captures the intrinsic feature differences during the image generation process. Subsequently, the gradient feature are fed into a classifier to achieve efficient discrimination between authentic and fake images. To validate the efficacy of our proposed detector, we conducted evaluations on a dataset comprising images generated by ten diverse diffusion models and GANs. Extensive experiments demonstrate that our detector exhibits stronger generalization capabilities and higher robustness, rendering it suitable for real-world generated image detection tasks.}, archive = {J_CVIU}, author = {Wenqing Wu and Xinyi Shi and Jinghai Ai and Xiaodong Wang}, doi = {10.1016/j.cviu.2025.104494}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104494}, shortjournal = {Comput. Vis. Image Understanding}, title = {GRE-net: A forgery image detection framework based on gradient feature and reconstruction error}, volume = {261}, year = {2025}, }
• (2025). Mitigating forgetting in the adaptation of CLIP for few-shot classification. CVIU, 261, 104493. (www)

  @article{ , abstract = {Adapter-style efficient transfer learning has demonstrated outstanding performance in fine-tuning vision-language models, especially in scenarios with limited data. However, existing methods fail to effectively balance the prior knowledge acquired during the pre-training process and the training samples. To address this problem, we propose a method called Mitigating Forgetting in the Adaptation (MiFA) of CLIP. MiFA first employs class prototypes to represent the most prominent features of a class, and these prototypes provide a robust initialization for the classifier. To overcome the forgetting of prior knowledge, MiFA then leverages a memory module that retains the initial parameters and the parameters of training history by creating a memory weight through momentum. The weight is used to initialize a new classification layer, which, along with the original layer, guides each other to balance prior knowledge and feature adaptation. Similarly, in the text processing branch, a parallel initialization strategy is adopted to ensure that the model’s performance is improved. Text features are employed to initialize a text classification layer, and CLIP logits help prevent excessive forgetting of useful text information. Extensive experiments have demonstrated the effectiveness of our method.}, archive = {J_CVIU}, author = {Jiale Cao and Yuanheng Liu and Zhong Ji and Jingren Liu and Aiping Yang and Yanwei Pang}, doi = {10.1016/j.cviu.2025.104493}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104493}, shortjournal = {Comput. Vis. Image Understanding}, title = {Mitigating forgetting in the adaptation of CLIP for few-shot classification}, volume = {261}, year = {2025}, }
• (2025). Joint multi-dimensional dynamic attention and transformer for general image restoration. CVIU, 261, 104491. (www)

  @article{ , abstract = {Outdoor images often suffer from severe degradation due to rain, haze, and noise, impairing image quality and challenging high-level tasks. Current image restoration methods struggle to handle complex degradation while maintaining efficiency. This paper introduces a novel image restoration architecture that combines multi-dimensional dynamic attention and self-attention within a U-Net framework. To leverage the global modeling capabilities of transformers and the local modeling capabilities of convolutions, we integrate sole CNNs in the encoder–decoder and sole transformers in the latent layer. Additionally, we design convolutional kernels with selected multi-dimensional dynamic attention to capture diverse degraded inputs efficiently. A transformer block with transposed self-attention further enhances global feature extraction while maintaining efficiency. Extensive experiments demonstrate that our method achieves a better balance between performance and computational complexity across five image restoration tasks: deraining, deblurring, denoising, dehazing, and enhancement, as well as superior performance for high-level vision tasks. The source code will be available at https://github.com/House-yuyu/MDDA-former .}, archive = {J_CVIU}, author = {Huan Zhang and Xu Zhang and Nian Cai and Jianglei Di and Yun Zhang}, doi = {10.1016/j.cviu.2025.104491}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104491}, shortjournal = {Comput. Vis. Image Understanding}, title = {Joint multi-dimensional dynamic attention and transformer for general image restoration}, volume = {261}, year = {2025}, }
• (2025). LAM-YOLO: Drones-based small object detection on lighting-occlusion attention mechanism YOLO. CVIU, 261, 104489. (www)

  @article{ , abstract = {Drone-based target detection presents inherent challenges, including the high density and overlap of targets in drone images, as well as the blurriness of targets under varying lighting conditions, which complicates accurate identification. Traditional methods often struggle to detect numerous small, densely packed targets against complex backgrounds. To address these challenges, we propose LAM-YOLO, an object detection model specifically designed for drone-based applications. First, we introduce a light-occlusion attention mechanism to enhance the visibility of small targets under diverse lighting conditions. Additionally, we incorporate Involution modules to improve feature layer interactions. Second, we employ an improved SIB-IoU as the regression loss function to accelerate model convergence and enhance localization accuracy. Finally, we implement a novel detection strategy by introducing two auxiliary detection heads to better identify smaller-scale targets. Our quantitative results demonstrate that LAM-YOLO outperforms methods such as Faster R-CNN, YOLOv11, and YOLOv12 in terms of mAP@0.5 and mAP@0.5:0.95 on the VisDrone2019 public dataset. Compared to the original YOLOv8, the average precision increases by 7.1%. Additionally, the proposed SIB-IoU loss function not only accelerates convergence speed during training but also improves average precision compared to the traditional loss function.}, archive = {J_CVIU}, author = {Yuchen Zheng and Yuxin Jing and Jufeng Zhao and Guangmang Cui}, doi = {10.1016/j.cviu.2025.104489}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104489}, shortjournal = {Comput. Vis. Image Understanding}, title = {LAM-YOLO: Drones-based small object detection on lighting-occlusion attention mechanism YOLO}, volume = {261}, year = {2025}, }
• (2025). Camera pose in SfT and NRSfM under isometric and weaker deformation models. CVIU, 261, 104488. (www)

  @article{ , abstract = {Camera pose is a very natural concept in 3D vision in the rigid setting. It is however much more difficult to work with in deformable settings. Consequently, numerous deformable reconstruction methods simply ignore camera pose. We analyse the concept of pose in deformable settings and prove that it is unconstrained with the existing formulations, properly justifying the existing pose-less methods reconstructing structure only. We explain this result intuitively by the impossibility to define an intrinsic coordinate frame to a general deforming object. The proposed analysis uses the isometric deformation model and extends to the weaker models including conformality and equiareality We propose a novel prior to rescue camera pose estimation in deformable settings, which attributes the deforming object’s dominant rigid-body motion to the camera. We show that adding this prior to any existing formulation fully constrains camera pose and leads to elegant two-step solution methods, involving deformable structure reconstruction using a base method in the first step, and absolute orientation or Procrustes analysis in the second step. We derive the proposed approach for the template-based and template-less settings, respectively implemented using Shape-from-Template (SfT) and Non-Rigid Structure-from-Motion (NRSfM) as base methods and validate them experimentally, showing that the computed pose is qualitatively and quantitatively plausible.}, archive = {J_CVIU}, author = {Adrien Bartoli and Agniva Sengupta}, doi = {10.1016/j.cviu.2025.104488}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104488}, shortjournal = {Comput. Vis. Image Understanding}, title = {Camera pose in SfT and NRSfM under isometric and weaker deformation models}, volume = {261}, year = {2025}, }
• (2025). Bi-granularity balance learning for long-tailed image classification. CVIU, 261, 104469. (www)

  @article{ , abstract = {In long-tailed datasets, the training of deep neural network-based models faces challenges, where the model may become biased towards the head classes with abundant training data, resulting in poor performance on tail classes with limited samples. Most current methods employ contrastive learning to learn more balanced representations by finding the class center. However, these methods use class centers to address local imbalance within a mini-batch, they overlook the global imbalance between batches throughout an epoch, caused by the long-tailed distribution of the dataset. In this paper, we propose bi-granularity balance learning to address the two-layer imbalance. We decouple the attraction–repulsion term in contrastive loss into two independent components: global and local balance. The global balance component focuses on capturing semantic information from different perspectives of the image and shifting learning attention from the head classes to the tail classes in the global perspective. The local balance component aims to learn inter-class separability from the local perspective. The proposed method efficiently learns the intra-class compactness and inter-class separability in long-tailed model training and improves the performance of the long-tailed model. Experimental results show that the proposed method achieves competitive performance on long-tailed benchmarks such as CIFAR-10/100-LT, TinyImageNet-LT, and iNaturalist 2018.}, archive = {J_CVIU}, author = {Ning Ren and Xiaosong Li and Yanxia Wu and Yan Fu}, doi = {10.1016/j.cviu.2025.104469}, journal = {Computer Vision and Image Understanding}, month = {11}, pages = {104469}, shortjournal = {Comput. Vis. Image Understanding}, title = {Bi-granularity balance learning for long-tailed image classification}, volume = {261}, year = {2025}, }

DISOPT - 4

• (2025). Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. DISOPT, 58, 100913. (www)

  @article{ , abstract = {We consider the task of allocating indivisible items to agents, when the agents’ preferences over the items are identical. The preferences are captured by means of a directed acyclic graph, with vertices representing items and an edge ( a , b ) , meaning that each of the agents prefers item a over item b . The dissatisfaction of an agent is measured by the number of items that the agent does not receive and for which it also does not receive any more preferred item. The aim is to allocate the items to the agents in a fair way, i.e., to minimize the maximum dissatisfaction among the agents. We study the status of computational complexity of that problem and establish the following dichotomy: the problem is NP -hard for the case of at least three agents, even on fairly restricted graphs, but polynomially solvable for two agents. We also provide several polynomial-time results with respect to different underlying graph structures, such as graphs of width at most two and tree-like structures such as stars and matchings. These findings are complemented with fixed parameter tractability results related to path modules and independent set modules. Techniques employed in the paper include bottleneck assignment problem, greedy algorithm, dynamic programming, maximum network flow, and integer linear programming.}, archive = {J_DISOPT}, author = {Nina Chiarelli and Clément Dallard and Andreas Darmann and Stefan Lendl and Martin Milanič and Peter Muršič and Ulrich Pferschy}, doi = {10.1016/j.disopt.2025.100913}, journal = {Discrete Optimization}, month = {11}, pages = {100913}, shortjournal = {Discret. Optim.}, title = {Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph}, volume = {58}, year = {2025}, }
• (2025). Computational aspects of lifted cover inequalities for knapsacks with few different weights. DISOPT, 58, 100912. (www)

  @article{ , abstract = {Cutting planes are frequently used for solving integer programs. A common strategy is to derive cutting planes from building blocks or a substructure of the integer program. In this paper, we focus on knapsack constraints that arise from single row relaxations. Among the most popular classes derived from knapsack constraints are lifted minimal cover inequalities. The separation problem for these inequalities is NP-hard though, and one usually separates them heuristically, therefore not fully exploiting their potential. For many benchmarking instances however, it turns out that many knapsack constraints only have few different coefficients. This motivates the concept of sparse knapsacks where the number of different coefficients is a small constant, independent of the number of variables present. For such knapsacks, we observe that there are only polynomially many different classes of structurally equivalent minimal covers. This opens the door to specialized techniques for using lifted minimal cover inequalities. In this article we will discuss two such techniques, which are based on specialized sorting methods. On the one hand, we present new separation routines that separate equivalence classes of inequalities rather than individual inequalities. On the other hand, we derive compact extended formulations that express all lifted minimal cover inequalities by means of a polynomial number of constraints. These extended formulations are based on tailored sorting networks that express our separation algorithm by linear inequalities. We conclude the article by a numerical investigation of the different techniques for popular benchmarking instances.}, archive = {J_DISOPT}, author = {Christopher Hojny and Cédric Roy}, doi = {10.1016/j.disopt.2025.100912}, journal = {Discrete Optimization}, month = {11}, pages = {100912}, shortjournal = {Discret. Optim.}, title = {Computational aspects of lifted cover inequalities for knapsacks with few different weights}, volume = {58}, year = {2025}, }
• (2025). An improved bound for the price of anarchy for related machine scheduling. DISOPT, 58, 100911. (www)

  @article{ , abstract = {In this paper, we introduce an improved upper bound for the efficiency of Nash equilibria in utilitarian scheduling games on related machines. The machines have varying speeds and adhere to the shortest processing time first policy. The goal of each job is to minimize its completion time, while the social objective is to minimize the sum of completion times. Our main finding establishes an upper bound of 2 − 1 / ( 4 m − 2 ) on the price of anarchy for the general case of m machines. We improve this bound to 3/2 for the case of two machines, and to 2 − 1 / ( 2 m ) for the general case of m machines when the machines have divisible speeds, i.e., if the speed of each machine is divisible by the speed of any slower machine.}, archive = {J_DISOPT}, author = {André Berger and Arman Rouhani and Marc Schröder}, doi = {10.1016/j.disopt.2025.100911}, journal = {Discrete Optimization}, month = {11}, pages = {100911}, shortjournal = {Discret. Optim.}, title = {An improved bound for the price of anarchy for related machine scheduling}, volume = {58}, year = {2025}, }
• (2025). On the circuit diameter conjecture for counterexamples to the hirsch conjecture. DISOPT, 58, 100910. (www)

  @article{ , abstract = {Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatorial diameters. The main open problem in this area is the circuit diameter conjecture, the analogue of the Hirsch conjecture in the circuit setting. A natural question is whether the well-known counterexamples to the Hirsch conjecture carry over. Previously, Stephen and Yusun showed that the Klee-Walkup counterexample to the unbounded Hirsch conjecture does not transfer to the circuit setting. Our main contribution is to show that the original counterexamples for other variants, using monotone walks or for bounded polytopes, also do not transfer. A challenge lies in the dependence of circuit diameters on the specific realization of a polyhedron. We discuss for which realizations, in addition to the original ones from the literature, our tools resolve this question. Our results rely on new observations on structural properties of these counterexamples. To analyze the bounded case, we exploit the geometry of certain 2-faces of the polytopes underlying all known bounded Hirsch counterexamples in Santos’ work. For Todd’s monotone Hirsch counterexample, we study linear programs on spindles and prove sufficient conditions for short monotone circuit walks to exist. We then enumerate all linear programs over Todd’s polytope and find four new orientations that contradict the monotone Hirsch conjecture, while the remaining 7107 satisfy the bound. The conclusion then follows by applying these sufficient conditions to Todd’s counterexample.}, archive = {J_DISOPT}, author = {Alexander E. Black and Steffen Borgwardt and Matthias Brugger}, doi = {10.1016/j.disopt.2025.100910}, journal = {Discrete Optimization}, month = {11}, pages = {100910}, shortjournal = {Discret. Optim.}, title = {On the circuit diameter conjecture for counterexamples to the hirsch conjecture}, volume = {58}, year = {2025}, }

DKE - 16

• (2026). Temporal knowledge graph recommendation with sequence-aware and path reasoning. DKE, 161, 102522. (www)

  @article{ , abstract = {Knowledge graph recommendation (KGRec) models not only alleviate the issues of data sparsity and the cold start problem encountered by traditional models but also enhance interpretability and credibility through the provision of explicit recommendation rationales. Nonetheless, existing KGRec models predominantly concentrate on extracting static structural features of user preferences from KG, often neglecting the dynamic temporal features, such as purchase time and click time. This oversight results in considerable limitations in recommendation performance. In response to this challenge, this paper introduces a novel temporal knowledge graph recommendation model (TKGRec), which fully utilizes both dynamic temporal feature and static structure feature for better recommendation. We specifically construct a temporal KG that encapsulates both static and dynamic user–item interactions. Based on the new environment, we propose a sequence-aware and path reasoning framework, in which the sequence-aware module employs a dual-attention mechanism to distill temporal features from interactions, whereas the path reasoning module utilizes reinforcement learning to extract path features. These two modules are seamlessly fused and iteratively refined to capture a more holistic understanding of user preferences. Experimental results on three real-world datasets demonstrate that the proposed model significantly outperforms existing state-of-the-art baseline models in terms of performance.}, archive = {J_DKE}, author = {Yuanming Zhang and Ziyou He and Yongbiao Lou and Haixia Long and Fei Gao}, doi = {10.1016/j.datak.2025.102522}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102522}, shortjournal = {Data Knowl. Eng.}, title = {Temporal knowledge graph recommendation with sequence-aware and path reasoning}, volume = {161}, year = {2026}, }
• (2026). Secure data storage in multi-cloud environments using lattice-based saber with diffie-hellman cryptography and authenticate based on PUF-ECC. DKE, 161, 102512. (www)

  @article{ , abstract = {Human life has become highly dependent on data in recent decades almost every facet of daily activities, leading to its storage in multi-cloud environments. To ensure data integrity, confidentiality, and privacy, it is essential to protect data from unauthorized access. This paper proposes a novel approach for securing data in multi-cloud environments for user authentication and data storage using Lattice-Based Saber Cryptography combined with PUF-ECC and the Enhanced Goose Optimization Algorithm (EGOA). The initial user authentication is achieved through the PUF-ECC digital signature algorithm, which verifies both the user's and the device's identity. Once authenticated, user data is securely transmitted to the cloud server based on Lattice-Based Saber post-quantum cryptography combined with the Diffie-Hellman key exchange protocol. The encrypted data is then stored across multiple cloud storage through a cloud controller using RAM-based chunking. For efficient data retrieval, the Enhanced Goose Optimization Algorithm (EGOA) is employed to extract encrypted data from clouds. Finally, the data is decrypted using the Lattice-Based Saber decryption algorithm and securely retrieved by the authenticated user. This method enhances both the security and efficiency of cloud data management and retrieval. The experiment is carried out with the proposed methodologies and also compared with the existing technologies. The proposed approach achieves encryption times of 9.68 ms, key generation times of 4.84 ms, and block creation times of 1.59 ms, while maintaining a 93.7 % confidentiality rate, a 98 % packet delivery ratio, a transmission delay of 0.026 ms, throughput of 407.33 MB/s, jitter of 3.26 ms, and an RTT of 0.17 ms, demonstrating its effectiveness in secure data storage and retrieval in multi-cloud environments.}, archive = {J_DKE}, author = {R. Iyswarya and R. Anitha}, doi = {10.1016/j.datak.2025.102512}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102512}, shortjournal = {Data Knowl. Eng.}, title = {Secure data storage in multi-cloud environments using lattice-based saber with diffie-hellman cryptography and authenticate based on PUF-ECC}, volume = {161}, year = {2026}, }
• (2026). ASF: A novel associative scoring function for embedded knowledge graph reasoning. DKE, 161, 102511. (www)

  @article{ , abstract = {One of the most important tools for knowledge management is the Knowledge Graph (KG), a multi-relational graph that depicts rich factual information across entities. A KG represents entities as nodes and relations as edges, with each edge represented by a triplet: (head entity, relation, tail entity). The Scoring Function (SF) in a KG quantifies the plausibility of these triplets and is often derived from KG embeddings. However, due to the distinct relational patterns across KGs, an SF that performs well on one KG might fail on another, making the design of optimal SFs a challenging task. This study introduces the concept of an Associative Scoring Function (ASF), which leverages Association Rule Mining (ARM) to discover and incorporate patterns and characteristics of symmetric, asymmetric, inverse, and other relational types within embedded KGs. The ARM technique in ASF uses the FP-Growth algorithm to extract meaningful associations, which is enhanced further through hyperparameter tuning. Extensive experiments on benchmark datasets demonstrate that ASF is KG-independent and performs better than state-of-the-art SFs. These results highlight ASF's potential to generalize across diverse KGs, offering a significant advancement in the KG link prediction task.}, archive = {J_DKE}, author = {MVPT Lakshika and HA Caldera}, doi = {10.1016/j.datak.2025.102511}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102511}, shortjournal = {Data Knowl. Eng.}, title = {ASF: A novel associative scoring function for embedded knowledge graph reasoning}, volume = {161}, year = {2026}, }
• (2026). A graph-based model for semantic textual similarity measurement. DKE, 161, 102509. (www)

  @article{ , abstract = {Measuring semantic similarity between sentence pairs is a fundamental problem in Natural Language Processing with applications in various domains, including machine translation, speech recognition, automatic question answering, and text summarization. Despite its significance, accurately assessing semantic similarity remains a challenging task, particularly for underrepresented languages such as Vietnamese. Existing methods have yet to fully leverage the unique linguistic characteristics of Vietnamese for semantic similarity measurement. To address this limitation, we propose GBNet-STS (Graph-Based Network for Semantic Textual Similarity), a novel framework for measuring the semantic similarity of Vietnamese sentence pairs. GBNet-STS integrates lexical-grammatical similarity scores and distributional semantic similarity scores within a multi-layered graph-based model. By capturing different semantic perspectives through multiple interconnected layers, our approach provides a more comprehensive and robust similarity estimation. Experimental results demonstrate that GBNet-STS outperforms traditional methods, achieving state-of-the-art performance in Vietnamese semantic similarity tasks.}, archive = {J_DKE}, author = {Van-Tan Bui and Quang-Minh Nguyen and Van-Vinh Nguyen and Duc-Toan Nguyen}, doi = {10.1016/j.datak.2025.102509}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102509}, shortjournal = {Data Knowl. Eng.}, title = {A graph-based model for semantic textual similarity measurement}, volume = {161}, year = {2026}, }
• (2026). Rule-guided process discovery. DKE, 161, 102508. (www)

  @article{ , abstract = {Event data extracted from information systems serves as the foundation for process mining, enabling the extraction of insights and identification of improvements. Process discovery focuses on deriving descriptive process models from event logs, which form the basis for conformance checking, performance analysis, and other applications. Traditional process discovery techniques predominantly rely on event logs, often overlooking supplementary information such as domain knowledge and process rules. These rules, which define relationships between activities, can be obtained through automated techniques like declarative process discovery or provided by domain experts based on process specifications. When used as an additional input alongside event logs, such rules have significant potential to guide process discovery. However, leveraging rules to discover high-quality imperative process models, such as BPMN models and Petri nets, remains an underexplored area in the literature. To address this gap, we propose an enhanced framework, IMr, which integrates discovered or user-defined rules into the process discovery workflow via a novel recursive approach. The IMr framework employs a divide-and-conquer strategy, using rules to guide the selection of process structures at each recursion step in combination with the input event log. We evaluate our approach on several real-world event logs and demonstrate that the discovered models better align with the provided rules without compromising their conformance to the event log. Additionally, we show that high-quality rules can improve model quality across well-known conformance metrics. This work highlights the importance of integrating domain knowledge into process discovery, enhancing the quality, interpretability, and applicability of the resulting process models.}, archive = {J_DKE}, author = {Ali Norouzifar and Marcus Dees and Wil van der Aalst}, doi = {10.1016/j.datak.2025.102508}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102508}, shortjournal = {Data Knowl. Eng.}, title = {Rule-guided process discovery}, volume = {161}, year = {2026}, }
• (2026). LQ-FJS: A logical query-digging fake-news judgment system with structured video-summarization engine using LLM. DKE, 161, 102507. (www)

  @article{ , abstract = {The proliferation of online social platforms can greatly benefit people by fostering remote relationships, but it also inevitably amplifies the impact of multimodal fake news on societal trust and ethics. Existing fake-news detection AI systems are still vulnerable to the inconspicuous and indiscernible multimodal misinformation, and often lacking interpretability and accuracy in cross-platform settings. Hence, we propose a new innovative logical query-digging fake-news judgment system (LQ-FJS) to tackle the above problem based on multimodal approach. The LQ-FJS verifies the truthfulness of claims made within multimedia news by converting video content into structured textual summaries. It then acts as an interpretable agent, explaining the reasons for identified fake news by the structured video-summarization engine (SVSE) to act as an interpretable detection intermediary agent. The SVSE generates condensed captions for raw video content, converting it into structured textual narratives. Then, LQ-FJS exploits these condensed captions to retrieve reliable information related to the video content from LLM. Thus, LQ-FJS cross-verifies external knowledge sources and internal LLM responses to determine whether contradictions exist with factual information through a multimodal inconsistency verification procedure. Our experiments demonstrate that the subtle summarization produced by SVSE can facilitate the generation of explanatory reports that mitigate large-scale trust deficits caused by opaque “black-box” models. Our experiments show that LQ-FJS improves F1 scores by 4.5% and 7.2% compared to state-of-the-art models (FactLLaMA 2023 and HiSS 2023), and increases 14% user trusts through interpretable conclusions.}, archive = {J_DKE}, author = {Jhing-Fa Wang and Din-Yuen Chan and Hsin-Chun Tsai and Bo-Xuan Fang}, doi = {10.1016/j.datak.2025.102507}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102507}, shortjournal = {Data Knowl. Eng.}, title = {LQ-FJS: A logical query-digging fake-news judgment system with structured video-summarization engine using LLM}, volume = {161}, year = {2026}, }
• (2026). ABBA: Index structure for sequential pattern-based aggregate queries. DKE, 161, 102506. (www)

  @article{ , abstract = {Pattern-based aggregate (PBA) queries constitute an important and widely used type of analytical queries in sequence OLAP (S-OLAP) systems. Unfortunately, finding accurate answers to PBA queries in the S-OLAP system is often very expensive both in terms of time and memory consumption. In this paper we propose an efficient and easily maintainable index structure called the ABBA Index, which addresses the problem of PBA query processing. Experiments conducted using the KDD Cup data and public transport passengers’ travel behavior data show that our index outperforms state-of-the art solutions while requiring much less memory. The ABBA Index can be easily extended to support pattern-based aggregate queries over hierarchy (PBA-H), a novel class of analytical queries which we introduce as the second main contribution of the paper. Sensitivity, scalability and complexity analysis of the ABBA Index is also provided.}, archive = {J_DKE}, author = {Witold Andrzejewski and Tadeusz Morzy and Maciej Zakrzewicz}, doi = {10.1016/j.datak.2025.102506}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102506}, shortjournal = {Data Knowl. Eng.}, title = {ABBA: Index structure for sequential pattern-based aggregate queries}, volume = {161}, year = {2026}, }
• (2026). Elevating human-machine collaboration in NLP for enhanced content creation and decision support. DKE, 161, 102505. (www)

  @article{ , abstract = {Human-machine collaboration in Natural Language Processing (NLP) is revolutionizing content creation and decision support by seamlessly combining the strengths of both entities for enhanced efficiency and quality. The lack of seamless integration between human creativity and machine efficiency in NLP hinders optimal content creation and decision support. The objective of this study is to explore and promote the integration of human-machine collaboration in NLP to enhance both content creation and decision support processes. Data Acquisition for NLP requests involves defining the task and target audience, identifying relevant data sources like text documents and web data, and incorporating human expertise for data curation through validation and annotation. Machine processing techniques like tokenization, stemming/lemmatization, and removal of stop words, as well as human input for tasks like data annotation and error correction, to improve data quality and relevance for NLP applications. The combination of automated processing and human feedback leads to more precise and dependable effects. Techniques such as sentiment analysis, topic modelling, and entity recognition are utilized to excerpt valued perceptions from the data and enhance collaboration between humans and machines. These techniques help to streamline the NLP process and ensure that the system is providing accurate and relevant information to users. The analysis of NLP models in machine processing involves training the models to perform specific tasks, such as summarization, sentiment analysis, information extraction, trend identification, and creative content generation. The results show that social media leads with 90% usage, pivotal for audience engagement, while blogs at 78% highlight their depth in content creation implementation using Python software. These trained models are then used to improve decision-making processes, generate creative content, and enhance the accuracy of search results. The future scope involves leveraging advanced NLP techniques to deepen the collaboration between humans and machines for more effective content creation and decision support.}, archive = {J_DKE}, author = {Priyanka V. Deshmukh and Aniket K. Shahade}, doi = {10.1016/j.datak.2025.102505}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102505}, shortjournal = {Data Knowl. Eng.}, title = {Elevating human-machine collaboration in NLP for enhanced content creation and decision support}, volume = {161}, year = {2026}, }
• (2026). ELEVATE-ID: Extending large language models for end-to-end entity linking evaluation in indonesian. DKE, 161, 102504. (www)

  @article{ , abstract = {Large Language Models (LLMs) have demonstrated remarkable performance across a wide range of natural language processing tasks. However, their effectiveness in low-resource languages remains underexplored, particularly in complex tasks such as end-to-end Entity Linking (EL), which requires both mention detection and disambiguation against a knowledge base (KB). In earlier work, we introduced IndEL — the first end-to-end EL benchmark dataset for the Indonesian language — covering both a general domain (news) and a specific domain (religious text from the Indonesian translation of the Quran), and evaluated four traditional end-to-end EL systems on this dataset. In this study, we propose ELEVATE-ID, a comprehensive evaluation framework for assessing LLM performance on end-to-end EL in Indonesian. The framework evaluates LLMs under both zero-shot and fine-tuned conditions, using multilingual and Indonesian monolingual models, with Wikidata as the target KB. Our experiments include performance benchmarking, generalization analysis across domains, and systematic error analysis. Results show that GPT-4 and GPT-3.5 achieve the highest accuracy in zero-shot and fine-tuned settings, respectively. However, even fine-tuned GPT-3.5 underperforms compared to DBpedia Spotlight — the weakest of the traditional model baselines — in the general domain. Interestingly, GPT-3.5 outperforms Babelfy in the specific domain. Generalization analysis indicates that fine-tuned GPT-3.5 adapts more effectively to cross-domain and mixed-domain scenarios. Error analysis uncovers persistent challenges that hinder LLM performance: difficulties with non-complete mentions, acronym disambiguation, and full-name recognition in formal contexts. These issues point to limitations in mention boundary detection and contextual grounding. Indonesian-pretrained LLMs, Komodo and Merak, reveal core weaknesses: template leakage and entity hallucination, respectively—underscoring architectural and training limitations in low-resource end-to-end EL. 1}, archive = {J_DKE}, author = {Ria Hari Gusmita and Asep Fajar Firmansyah and Hamada M. Zahera and Axel-Cyrille Ngonga Ngomo}, doi = {10.1016/j.datak.2025.102504}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102504}, shortjournal = {Data Knowl. Eng.}, title = {ELEVATE-ID: Extending large language models for end-to-end entity linking evaluation in indonesian}, volume = {161}, year = {2026}, }
• (2026). Time-aware complex question answering over temporal knowledge graph. DKE, 161, 102503. (www)

  @article{ , abstract = {Knowledge Graph Question Answering (KGQA) is a crucial topic in Knowledge Graphs (KGs), with the objective of retrieving the corresponding facts from KGs to answer given questions. In practical applications, facts in KGs usually have time constraints, thus, question answering on Temporal Knowledge Graphs (TKGs) has attracted extensive attention. Existing Temporal Knowledge Graph Question Answering (TKGQA) methods focus on dealing with complex questions involving multiple facts, and mainly face two challenges. First, these methods only consider matching questions with facts in TKGs to identify the answer, ignoring the temporal order between different facts, which makes it challenging to solve the questions involving temporal order. Second, they usually focus on the representation of the question text while neglecting the rich semantic information within the questions, which leads to certain limitations in understanding question. To address the above challenges, this research proposes a model named Time-Aware Complex Question Answering (TA-CQA). Specifically, we extend the Temporal Knowledge Graph Embedding (TKGE) model by incorporating temporal order information into the embedding vectors, ensuring that the model can distinguish the temporal order of different facts. To enhance the semantic representation of the question, we integrate question information using attention mechanism and learnable encoder. Different from the previous TKGQA methods, we propose time relevance measurement to further enhance the accuracy of answer prediction by better capturing the correlation between question information and time information. Multiple sets of experiments on CronQuestions and TimeQuestions demonstrate our model’s superior performance across all question types. In particular, for complex questions involving multiple facts, the hit@1 values are increased by 3.2% and 3.5% respectively.}, archive = {J_DKE}, author = {Luyi Bai and Tongyue Zhang and Guangchen Feng}, doi = {10.1016/j.datak.2025.102503}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102503}, shortjournal = {Data Knowl. Eng.}, title = {Time-aware complex question answering over temporal knowledge graph}, volume = {161}, year = {2026}, }
• (2026). Conceptual modeling of user perspectives — From data warehouses to alliance-driven data ecosystems. DKE, 161, 102502. (www)

  @article{ , abstract = {The increasing complexity of modern information systems has highlighted the need for advanced conceptual modeling techniques that incorporate multi-perspective and view-based approaches. This paper explores the role of multi-perspective modeling and view modeling in designing distributed, heterogeneous systems while addressing diverse user requirements and ensuring semantic consistency. These methods enable the representation of multiple viewpoints, traceability, and dynamic integration across different levels of abstraction. Key advancements in schema mapping, view maintenance, and semantic metadata management are examined, illustrating how they support query optimization, data quality, and interoperability. We discuss how data management architectures, such as data ecosystems, data warehouses, and data lakes, leverage these innovations to enable flexible and sustainable data sharing. By integrating user-centric and goal-oriented modeling frameworks, the alignment of technical design with organizational and social requirements is emphasized. Future challenges include the need for enhanced reasoning capabilities and collaborative tools to manage the growing complexity of interconnected systems while maintaining adaptability and trust.}, archive = {J_DKE}, author = {Sandra Geisler and Christoph Quix and István Koren and Matthias Jarke}, doi = {10.1016/j.datak.2025.102502}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102502}, shortjournal = {Data Knowl. Eng.}, title = {Conceptual modeling of user perspectives — From data warehouses to alliance-driven data ecosystems}, volume = {161}, year = {2026}, }
• (2026). Source-free domain adaptation with complex distribution considerations for time series data. DKE, 161, 102501. (www)

  @article{ , abstract = {Source-Free Domain Adaptation (SFDA) aims to adapt a pre-trained model from a labeled source domain to an unlabeled target domain without accessing source domain data, thereby protecting source domain privacy. Although SFDA has recently been applied to time series data, the inherent complex distribution characteristics including temporal variability and distributional diversity of such data remain underexplored. Time series data exhibit significant dynamic variability influenced by collection environments, leading to discrepancies between sequences. Additionally, multidimensional time series data face distributional diversity across dimensions. These complex characteristics increase the learning difficulty for source models and widen the adaptation gap between the source and target domains. To address these challenges, this paper proposes a novel SFDA method for time series data, named Adaptive Latent Subdomain feature extraction and joint Prediction (ALSP). The method divides the source domain, which has a complex distribution, into multiple latent subdomains with relatively simple distributions, thereby effectively capturing the features of different subdistributions. It extracts latent domain-specific and domain-invariant features to identify subdomain-specific characteristics. Furthermore, it combines domain-specific classifiers and a domain-invariant classifier to enhance model performance through multi-classifier joint prediction. During target domain adaptation, ALSP reduces domain dependence by extracting invariant features, thereby narrowing the distributional gap between the source and target domains. Simultaneously, it leverages prior knowledge from the source domain distribution to support the hypothesis space and dynamically adapt to the target domain. Experiments on three real-world datasets demonstrate that ALSP achieves superior performance in cross-domain time series classification tasks, significantly outperforming existing methods.}, archive = {J_DKE}, author = {Jing Shang and Zunming Chen and Zhiwen Xiao and Zhihui Wu and Yifei Zhang and Jibing Wang}, doi = {10.1016/j.datak.2025.102501}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102501}, shortjournal = {Data Knowl. Eng.}, title = {Source-free domain adaptation with complex distribution considerations for time series data}, volume = {161}, year = {2026}, }
• (2026). Conceptual modeling: A large language model assistant for characterizing research contributions. DKE, 161, 102497. (www)

  @article{ , abstract = {The body of conceptual modeling research publications is vast and diverse, making it challenging for a single researcher or research group to fully comprehend the field’s overall development. Although some approaches have been proposed to help organize these research contributions, it is still unrealistic to expect human experts to manually comprehend and characterize all of this research. However, as generative AI tools based on large language models, such as ChatGPT, become increasingly sophisticated, it may be possible to replace or augment tedious, manual work with semi-automated approaches. In this research, we present a customized version of ChatGPT that is tuned to the task of characterizing conceptual modeling research. Experiments with this AI tool demonstrate that it is feasible to create a usable knowledge survey for the continually evolving body of conceptual modeling research contributions.}, archive = {J_DKE}, author = {Stephen W. Liddle and Heinrich C. Mayr and Oscar Pastor and Veda C. Storey and Bernhard Thalheim}, doi = {10.1016/j.datak.2025.102497}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102497}, shortjournal = {Data Knowl. Eng.}, title = {Conceptual modeling: A large language model assistant for characterizing research contributions}, volume = {161}, year = {2026}, }
• (2026). Dynamic time warping for classifying long-term trends in time series. DKE, 161, 102495. (www)

  @article{ , abstract = {This paper explores the potential of dynamic time warping (DTW) for recognizing different segments in time series data characterized by their long-term trends and curvature. To perform classification, a set of reference data for each class is required, where each time series in the reference set represents a typical shape of that class. The classification process involves computing the DTW distance between a given time series and each reference time series, then assigning the time series to the class with the minimum distance. Experiments on both simulated and real-world time series data from two different use cases demonstrate that DTW can correctly classify the different segments. Additionally, the paper investigates whether incorrectly classified phases could indicate data security issues. Additional experiments are performed to assess the number of data points required to reliably classify a segment correctly. These experiments highlight the limitations and emphasize the importance of selecting good reference data.}, archive = {J_DKE}, author = {Anna-Christina Glock and Klaus Chmelina and Johannes Fürnkranz and Thomas Hütter}, doi = {10.1016/j.datak.2025.102495}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102495}, shortjournal = {Data Knowl. Eng.}, title = {Dynamic time warping for classifying long-term trends in time series}, volume = {161}, year = {2026}, }
• (2026). Semantic-aware query answering with large language models. DKE, 161, 102494. (www)

  @article{ , abstract = {In the modern data-driven world, answering queries over heterogeneous and semantically inconsistent data remains a significant challenge. Modern datasets originate from diverse sources, such as relational databases, semi-structured repositories, and unstructured documents, leading to substantial variability in schemas, terminologies, and data formats. Traditional systems, constrained by rigid syntactic matching and strict data binding, struggle to capture critical semantic connections and schema ambiguities, failing to meet the growing demand among data scientists for advanced forms of flexibility and context-awareness in query answering. In parallel, the advent of Large Language Models (LLMs) has introduced new capabilities in natural language interpretation, making them highly promising for addressing such challenges. However, LLMs alone lack the systematic rigor and explainability required for robust query processing and decision-making in high-stakes domains. In this paper, we propose Soft Query Answering (Soft QA), a novel hybrid approach that integrates LLMs as an intermediate semantic layer within the query processing pipeline. Soft QA enhances query answering adaptability and flexibility by injecting semantic understanding through context-aware, schema-informed prompts, and leverages LLMs to semantically link entities, resolve ambiguities, and deliver accurate query results in complex settings. We demonstrate its practical effectiveness through real-world examples, highlighting its ability to resolve semantic mismatches and improve query outcomes without requiring extensive data cleaning or restructuring.}, archive = {J_DKE}, author = {Paolo Atzeni and Teodoro Baldazzi and Luigi Bellomarini and Eleonora Laurenza and Emanuel Sallinger}, doi = {10.1016/j.datak.2025.102494}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102494}, shortjournal = {Data Knowl. Eng.}, title = {Semantic-aware query answering with large language models}, volume = {161}, year = {2026}, }
• (2026). An integrated requirements framework for analytical and AI projects. DKE, 161, 102493. (www)

  @article{ , abstract = {To this day, the requirements of data warehouses, user visualizations and ML projects have been tackled in an independent manner, ignoring the possible cross-requirements, collective constraints and dependencies between the outputs of the different systems that should be taken into account to ensure a successful analytical project. In this work, we take a holistic approach and propose a methodology that supports modeling and subsequent analysis while taking into account these three aspects. This methodology has several advantages, mainly that (i) it enables us to identify possible conflicts between actors on different tasks that are overlooked if the systems are treated in an isolated manner and (ii) this holistic view enables modeling multi-company systems, where the information or even the analytical results can be provided by third-parties, identifying key participants in federated environments. After presenting the required formalism to carry out this kind of analysis, we showcase it on a real-world running example of the tourism sector.}, archive = {J_DKE}, author = {Juan Trujillo and Ana Lavalle and Alejandro Reina-Reina and Jorge García-Carrasco and Alejandro Maté and Wolfgang Maaß}, doi = {10.1016/j.datak.2025.102493}, journal = {Data & Knowledge Engineering}, month = {1}, pages = {102493}, shortjournal = {Data Knowl. Eng.}, title = {An integrated requirements framework for analytical and AI projects}, volume = {161}, year = {2026}, }

DSS - 1

• (2025). AI art in the gig economy: Investigating the effects of non-copyrightability in online labor markets. DSS, 199, 114545. (www)

  @article{ , abstract = {As generative AI continues to transform industries, including the creative sector, it has become critical to understand how it interacts with legal frameworks. This study aims to investigate the effect of the landmark ruling issued by the U.S. District Court on August 18, 2023, which declared AI-generated art uncopyrightable to provide clarity to previously ambiguous legal standards on the AI-related services in online labor markets. Our findings reveal that prices for AI-related gigs on an online freelancer platform dropped by 32.97 % following the ruling, suggesting that the lack of copyright may have reduced the perceived value by limiting clients' residual rights. Furthermore, our research indicates that both freelancer experience and communication efficiency significantly moderate the relationship between AI art non-copyrightability and project pricing. In addition, the results show that large corporate clients were more affected by the ruling than individual clients. In contrast, prices for projects commissioned by small and mid-sized corporate clients did not change significantly. This suggests that large firms are more sensitive to intellectual property uncertainties because they rely heavily on formal rights to secure control and revenue from creative assets. This research contributes to a nuanced understanding of how legal frameworks for AI may shape the gig economy's AI art-related creative services, offering valuable guidelines for more informed decision-making by freelancers, clients, platform owners, and policymakers in this evolving landscape.}, archive = {J_DSS}, author = {Lan Li and Noelle Li Ying Cheah and Seung Hyun Kim}, doi = {10.1016/j.dss.2025.114545}, journal = {Decision Support Systems}, month = {12}, pages = {114545}, shortjournal = {Decis. Supp. Syst.}, title = {AI art in the gig economy: Investigating the effects of non-copyrightability in online labor markets}, volume = {199}, year = {2025}, }

EAAI - 270

• (2025). Teach sample-specific knowledge: Separated distillation based on samples. EAAI, 162, 112696. (www)

  @article{ , abstract = {Recent advancements in deep neural networks have revolutionized computer vision, enabling practical applications like classification and object detection. However, deploying these models on resource-constrained devices remains a critical challenge due to their high computational demands. Knowledge Distillation (KD) has emerged as an effective technique to address this issue by transferring knowledge from complex teacher models to lightweight student models, enhancing efficiency while maintaining high performance. Traditional logit-based KD methods use forward Kullback–Leibler divergence (FKLD) to transfer meaningful knowledge. However, FKLD typically exhibits a mode-averaging property, causing students to focus on non-target information, whether the teacher’s samples are correct or incorrect. Additionally, when handling uncertain samples, even teacher models may fail to classify them accurately, leading to incorrect predictions and confusing the students. To address these issues, we classify the dataset into two groups based on the teacher’s predictions: correct and incorrect samples. To ensure a more reliable transfer of knowledge from teacher to student for correct samples, we employ both forward Kullback–Leibler divergence (FKLD) and reverse Kullback–Leibler divergence (RKLD), which has mode-focusing properties. We also reduce temperature scaling for RKLD to enhance the focus on target information, ensuring that the student model prioritizes meaningful knowledge while minimizing the influence of non-target information. Conversely, for incorrect predictions, our method minimizes the teacher’s knowledge, encouraging students to rely more on the true labels by focusing on cross-entropy loss. Experimental results on both classification and object detection tasks demonstrate that our method, Teach Sample-Specific Knowledge (TSSK), outperforms state-of-the-art KD methods, making it ideal for deployment on-devices in real-world scenarios.}, archive = {J_EAAI}, author = {Seonghak Kim and Gyeongdo Ham and Suin Lee and Daeshik Kim}, doi = {10.1016/j.engappai.2025.112696}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112696}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Teach sample-specific knowledge: Separated distillation based on samples}, volume = {162}, year = {2025}, }
• (2025). A context-adaptive and dual-dimensional collaboration method for infrared-visible image registration and fusion. EAAI, 162, 112684. (www)

  @article{ , abstract = {Infrared and visible image registration and fusion are tightly coupled tasks. However, in unregistered scenarios, prioritizing registration accuracy can compromise the integrity of complementary information, whereas enforcing fusion quality may disrupt geometric consistency. To address this, we propose a Context-Adaptive and Dual-Dimensional Collaboration Method for Infrared-Visible Image Registration and Fusion. Firstly, we design an adaptive context-aware channel fusion convolution module that simultaneously serves feature extraction for both registration and fusion tasks, perceiving contextual feature relationships to coordinate corresponding regions across modalities while dynamically generating task-adaptive feature representations. Secondly, we design a dual-dimensional dynamic collaboration module leveraging interactive mapping across spatial and channel dimensions to effectively fuse complementary cross-modal features while preserving detail and texture information. Finally, the registered and fused images are reconstructed by the spatial transformer network and lightweight decoder. Extensive tests on multiple datasets show that our method exhibits excellent performance in visual effects, quantitative metrics, and generalization ability, making it suitable for application scenarios such as security monitoring, fault detection, and target recognition.}, archive = {J_EAAI}, author = {Minghao Jiang and Shaoshu Gao and Xiaodong Zhang and Xingli Wang and Qing Hu and Weiming Wang}, doi = {10.1016/j.engappai.2025.112684}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112684}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A context-adaptive and dual-dimensional collaboration method for infrared-visible image registration and fusion}, volume = {162}, year = {2025}, }
• (2025). A lightweight vision mamba coding UNet for medical image segmentation. EAAI, 162, 112676. (www)

  @article{ , abstract = {The segmentation of medical images is vital for advancing research in medicine and supporting precise clinical diagnoses. Over the past few years, neural network-based methods have become a major focus of research and have been broadly adopted in medical image segmentation. However, mainstream methods like Transformer have excessive computational cost requirements, which makes them impractical for mobile medical applications. Therefore, this paper proposes a Lightweight Vision Mamba Coding UNet (LVMC-UNet), which integrates the Rotation-based Vision Mamba module (RVM) and Correlation Space Fusion module (CSF) in a lightweight manner. The RVM module processes the input images in parallel and introduces rotary positional encoding (RPE) on the Vision Mamba architecture to address the limitation of the Mamba module’s insufficient ability to capture local details. The CSF module integrates multi-stage and multi-scale feature maps and introduces blueprint separable convolutions (BSConvs) to enhance intra-kernel correlation. Comprehensive experiments on three datasets demonstrate that LVMC-UNet outperforms current lightweight segmentation methods and strikes a balance between segmentation accuracy and computational requirements.}, archive = {J_EAAI}, author = {Yuanyuan Li and Yifei Duan and Guanqiu Qi and Baisen Cong and Li Zhang and Zhiqin Zhu}, doi = {10.1016/j.engappai.2025.112676}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112676}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A lightweight vision mamba coding UNet for medical image segmentation}, volume = {162}, year = {2025}, }
• (2025). A real-time design and implementation of intelligent drowsiness and fatigue recognition system for enhancing driver safety. EAAI, 162, 112665. (www)

  @article{ , abstract = {In recent years, the rise in personal vehicle usage for speed and convenience has increased road accidents, with driver fatigue as a major cause. Existing drowsiness detection systems suffer from high computational complexity and poor generalization across diverse conditions. To address these challenges, we propose an Intelligent Drowsiness and Fatigue Recognition (IDFR) System leveraging deep learning for real-time driver monitoring. Our system employs a customized Convolutional Neural Network (CNN) optimized for detecting eye states (open or closed) with high accuracy. A key feature is the use of the Eye Aspect Ratio (EAR) with a threshold of 0.2, empirically validated for precise drowsiness detection across varying lighting conditions and facial features. The system is trained on the Media Research Lab (MRL) Eye dataset, containing over 84,000 images, ensuring robust generalization across diverse demographics. The proposed IDFR system achieves 98.50 % accuracy, outperforming state-of-the-art deep learning models including Visual Geometry Group 16-layer network (VGG16), Visual Geometry Group 19-layer network (VGG19), Residual Network 152-layer (ResNet152), and Densely Connected Convolutional Network 201-layer (DenseNet201) in accuracy, precision, recall, and computational efficiency. By integrating transfer learning and fine-tuning techniques, we significantly reduce computational costs while maintaining high performance. The system was evaluated under challenging conditions, such as low lighting, high glare, and partial occlusion (e.g., sunglasses, shadows, and face coverings), ensuring robust detection accuracy. Our results demonstrate the IDFR system's potential for real-time in-vehicle deployment, providing immediate driver feedback and reducing accident risks. This work advances intelligent driver assistance technologies, enhancing road safety and future transportation systems.}, archive = {J_EAAI}, author = {Samy Abd El-Nabi and Khalil F. Ramadan and El-Sayed M. El-Rabaie and Ahmed Emam and Walid El-Shafai}, doi = {10.1016/j.engappai.2025.112665}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112665}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A real-time design and implementation of intelligent drowsiness and fatigue recognition system for enhancing driver safety}, volume = {162}, year = {2025}, }
• (2025). Coupled fault diagnosis for centrifugal pumps through boruta-shap feature selection and rime-enhanced stacked denoised autoencoder. EAAI, 162, 112659. (www)

  @article{ , abstract = {This study addresses the critical engineering challenges of diagnosing multi-condition cavitation and impeller erosion damage in deep sea centrifugal pumps, where traditional methods suffer from feature redundancy and poor generalization. An artificial intelligence (AI)-driven framework is proposed by integrating Boruta-Shap interpretable feature selection with a Rime-optimized Stacked Denoising Auto-Encoder (SDAE). Firstly, vibration signals undergo multi-domain feature extraction. The Boruta-Shap method quantifies feature interactions via Shapley values and shadow feature hypothesis testing, enabling physics-informed selection of cavitation energy indicators and impeller damage transient features, reducing feature dimensionality by approximately 70 %. Secondly, the Rime algorithm, inspired by ice-crystal growth dynamics, globally optimizes SDAE hyperparameters via balancing soft-rime exploration and hard-rime exploitation. Validated experimentally under variable conditions (0.8, 1.0 and 1.2 Q d ), the framework achieves 96 % testing accuracy, outperforming other diagnostic models, with reduced cross-condition misclassification. By bridging interpretable AI with multi-physics diagnostics, this work provides a replicable solution for predictive maintenance of energy infrastructure, advancing intelligent maintenance technologies for industrial systems facing complex hydrodynamic perturbations.}, archive = {J_EAAI}, author = {Kang Hu and Hui Sun and Wei Fan and Qiaorui Si and Yu Wu and Shouqi Yuan}, doi = {10.1016/j.engappai.2025.112659}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112659}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Coupled fault diagnosis for centrifugal pumps through boruta-shap feature selection and rime-enhanced stacked denoised autoencoder}, volume = {162}, year = {2025}, }
• (2025). Multimodal interval prediction of carbon dioxide emissions from heavy construction machinery: A missing-data robust inverted-transformer model considering sensors failure in complex construction environment. EAAI, 162, 112658. (www)

  @article{ , abstract = {Accurate forecasting of carbon dioxide (CO 2 ) emissions from heavy construction machinery in large-scale infrastructure projects presents a viable avenue for mitigating climate change. However, most current studies neglect the intricate operating conditions of such machinery. Moreover, in complex construction environments with high-frequency vibrations and heavy dust, sensor failures leading to random data loss significantly increase the difficulty of emission prediction. Especially when high-emission periods account for a small proportion, existing methods struggle to effectively capture CO 2 emission peaks. To address these challenges, this study proposes an improved Inverted-Transformer (iTransformer) multimodal interval prediction model for accurate CO 2 emission forecasting in heavy construction machinery under conditions of random sensor failures. The model incorporates a Mixture of Experts (MoE) mechanism within the iTransformer framework, which adaptively adjusts expert weights for missing modalities, thereby reducing prediction errors caused by random data loss. Additionally, to capture localized CO 2 emission peaks, this study introduces a Peak Capture Loss (PCL) function, which adjusts incremental emissions between adjacent time steps by supervising the differences between generated sequences, enabling the model to track abrupt emission variations. The Bootstrap method is also utilised to quantify and estimate uncertainty in the CO 2 emission Interval Prediction. Case studies reveal that the proposed model achieves high prediction accuracy (coefficient of determination ( R 2 ) = 0.99), especially across various data missing rates (5 %, 10 %, 15 %), with the average R 2 value increasing by approximately 6 %. This provides a novel approach for predicting emissions of heavy construction machinery in large-scale infrastructure projects.}, archive = {J_EAAI}, author = {Zhouquan Dong and Xiaoling Wang and Jun Zhang and Peng Yu and Zhijian Cai}, doi = {10.1016/j.engappai.2025.112658}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112658}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multimodal interval prediction of carbon dioxide emissions from heavy construction machinery: A missing-data robust inverted-transformer model considering sensors failure in complex construction environment}, volume = {162}, year = {2025}, }
• (2025). Enhancing wind power forecasting accuracy under extreme weather: Leveraging a dual-model approach with condition-based classification. EAAI, 162, 112656. (www)

  @article{ , abstract = {Accurate wind power forecasting is essential for grid stability, yet extreme weather events, exacerbated by climate change—pose challenges that current methods often overlook. In this study, we introduce a forecasting framework that accounts for extreme weather conditions to improve forecasting accuracy. First, we correct Numerical Weather Prediction (NWP) via temporal alignment and bias correction. Then, we address the differences in data distributions between typical and extreme weather conditions, while accounting for multivariate meteorological influences. We establish weather classification thresholds by integrating meteorological indicators (wind speed variation rate, precipitation, snowfall) with a data-driven sensitivity analysis, and optimize them via grid search to maximize the coefficient of determination ( R 2 ) while balancing false alarms and detection rates. Finally, due to the difference in distribution and data pattern, we implemented distinct forecasting models for each condition. A Convolutional Neural Network (CNN) models normal conditions by capturing temporal dependencies, while Light Gradient Boosting Machine (LightGBM) handles sparse extreme-weather samples. Compared to models that ignore extreme weather, our approach reduces Mean Absolute Error (MAE) by 21.13% and Root Mean Squared Error (RMSE) by 9.29%. Under extreme conditions, Mean Absolute Percentage Error (MAPE) is reduced by 32.76%, demonstrating enhanced robustness in handling extreme weather scenarios.}, archive = {J_EAAI}, author = {Weimin Yuan and Han Yang and Zhu Han and Yanru Zhang}, doi = {10.1016/j.engappai.2025.112656}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112656}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhancing wind power forecasting accuracy under extreme weather: Leveraging a dual-model approach with condition-based classification}, volume = {162}, year = {2025}, }
• (2025). Integrating multimodal biophysical features with hybrid deep learning for ribonucleic acid secondary structure prediction. EAAI, 162, 112648. (www)

  @article{ , abstract = {The secondary structure of ribonucleic acid (RNA) is pivotal for elucidating its functional roles. However, existing deep learning models predominantly rely on single-feature representations, which restricts their capacity to sufficiently capture the intricate information embedded in RNA sequences. To solve this problem, we propose a novel RNA secondary structure prediction method based on multimodal feature fusion and hybrid deep learning. By integrating multiple features of RNA are modeled to achieve the synergistic effect of the chemical microenvironment, local physical constraints and long-range interactions. We conceptualize RNA structure as an image and treat various RNA features as distinct channels of that image. To facilitate the transformation from RNA sequences to RNA images, we design a hybrid neural network architecture. Specifically, the sequence feature extraction module first extracts features directly from the RNA sequence. These features are then passed to the image feature extraction module, which focuses on capturing effective structural information from the multichannel RNA image, thereby enhancing the accuracy of RNA secondary-structure prediction. Experimental results indicate that our method achieves state-of-the-art performance compared with recent deep learning methods across several benchmark datasets and demonstrates potential in drug discovery applications.}, archive = {J_EAAI}, author = {Xiao Wang and Yongfeng Zhang and Lixiang Yang and Rong Wang}, doi = {10.1016/j.engappai.2025.112648}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112648}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Integrating multimodal biophysical features with hybrid deep learning for ribonucleic acid secondary structure prediction}, volume = {162}, year = {2025}, }
• (2025). Geometry-informed multimodal fusion network for enhancing high-density spatial transcriptomics from histology images. EAAI, 162, 112647. (www)

  @article{ , abstract = {Spatial transcriptomics (ST) is a revolutionary technology that combines spatial information with gene expression analysis, opening up new perspectives for studying the spatial distribution of genes within tissues and their regulatory mechanisms. However, it is limited by the sparsity of sequencing spots and the high cost of ST technology, which hinders its widespread application in biomedical research. An alternative and more cost-effective strategy is to leverage deep learning methods to infer high-density gene expression profiles from histological images. To this end, we developed the HisHRST (Histology-based High-Resolution Spatial Transcriptomics) method based on an offline pathological image foundation model, aiming to accurately generate high-density ST data from histological images using a geometry-guided multimodal fusion network with spatial coordinates. This method employs a multi-head attention mechanism to incorporate spatial location information, thereby enhancing feature representation. We systematically evaluated HisHRST on seven ST datasets and compared its performance with five existing methods. Experimental results demonstrate that HisHRST can accurately predict gene expression profiles for unmeasured spots, refine gene expression patterns, and effectively preserve the original spatial structure of gene expression. Furthermore, this method facilitates the identification of biologically meaningful pathways, thereby advancing the understanding of key biological processes. All code and public datasets used in this paper are available at https://github.com/wenwenmin/HisHRST and https://zenodo.org/records/15129356 .}, archive = {J_EAAI}, author = {Zhiceng Shi and Shuailin Xue and Wenwen Min}, doi = {10.1016/j.engappai.2025.112647}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112647}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Geometry-informed multimodal fusion network for enhancing high-density spatial transcriptomics from histology images}, volume = {162}, year = {2025}, }
• (2025). State-of-the-art of machine learning methods for fault detection and health monitoring of wind turbine system components: A comprehensive review. EAAI, 162, 112645. (www)

  @article{ , abstract = {As the world shifts from fossil fuels to sustainable energy sources, wind energy has become an increasingly important part of the global renewable energy mix. However, maintaining the efficient operation of wind turbines remains challenging. This review presents, discusses and extracts the major trends of advancements in artificial intelligence and their application in engineering solutions for diagnosing faults in wind turbine systems. It begins with an analysis of the benefits and limitations of different generator types used in wind power generation. Next, it identifies the most frequently failing components, including power converters, generators (with rotor), sensors, gearboxes and drivetrain. Furthermore, it provides an exhaustive overview of machine learning (ML) techniques, including advanced methodologies such as attention mechanisms and ensemble learning frameworks, for wind turbine fault detection and health monitoring. This review aims to show the current trends and future research directions of machine learning applications to improve the reliability, efficiency, and sustainability of wind turbine operations. It provides valuable insights for researchers, engineers, and decision-makers in the wind energy sector, helping them select suitable ML approaches and refine existing wind turbine operational strategies. It also enables us to measure the challenges that remain towards achieving highly efficient operation of wind turbines.}, archive = {J_EAAI}, author = {Abebe Wolie Yimam and Majid Vafaeipour and Maarten Messagie and Kinde Anlay Fante and Emiyamrew Minaye Molla and Tefera Mekonnen Azerefegn and Thierry Coosemans}, doi = {10.1016/j.engappai.2025.112645}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112645}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {State-of-the-art of machine learning methods for fault detection and health monitoring of wind turbine system components: A comprehensive review}, volume = {162}, year = {2025}, }
• (2025). Removal of cationic dyes from aqueous solutions using agricultural waste: Modeling the biosorption process with semantic immune plasma programming. EAAI, 162, 112640. (www)

  @article{ , abstract = {This study investigates the use of celery stalks, a low-cost agricultural waste, as biosorbent for removing crystal violet (CV), a toxic cationic dye, from aqueous solutions. The biosorption process was experimentally examined under varying conditions of potential of hydrogen (pH), contact time, biosorbent dose, initial dye concentration, and temperature. To model the relationship between these input parameters and biosorption performance, we employed symbolic regression using four automatic programming (AP) methods: Genetic Programming (GP), Artificial Bee Colony Programming (ABCP), Immune Plasma Programming (IPP), and a newly proposed semantic IPP (sIPP), which introduces a semantic-based crossover operator. The novelty of the study lies in combining agricultural waste-based biosorption with interpretable Artificial Intelligence (AI), enabling both accurate prediction and transparent understanding of the system. Experimental results revealed the presence of chemisorption in the spontaneous and endothermic biosorption process, with a maximum biosorption efficiency of 90% and a biosorption capacity of 6.9 mg/g. Among the symbolic models, sIPP achieved the highest test accuracy ( R Test 2 = 0 . 99 for capacity, 0.98 for efficiency), while also generating the simplest trees (approximate mean values: 91 and 99 nodes). This confirms sIPP’s strength in balancing predictive accuracy with model transparency. The proposed framework demonstrates strong potential for sustainable and explainable modeling in environmental engineering applications.}, archive = {J_EAAI}, author = {Nurşah Kütük and Sibel Arslan}, doi = {10.1016/j.engappai.2025.112640}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112640}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Removal of cationic dyes from aqueous solutions using agricultural waste: Modeling the biosorption process with semantic immune plasma programming}, volume = {162}, year = {2025}, }
• (2025). Graph-enhanced fault hierarchical perception for dissolved gas analysis in power transformer. EAAI, 162, 112639. (www)

  @article{ , abstract = {Dissolved Gas Analysis (DGA) is a widely used technique for diagnosing power transformer faults by monitoring the gas content in transformer oil to identify potential issues. However, existing research often treats dissolved gas samples as loosely connected independent entities, failing to explicitly model the relationships between them. Moreover, the similarity between faults caused by different factors can sometimes be higher than that between faults caused by the same factor, highlighting the need for hierarchical modeling of fault relationships to improve diagnostic performance. To address these challenges, we propose a graph-enhanced fault hierarchical perception model for DGA. In this work, a K -Nearest Neighbors ( K NN) graph is constructed by calculating the similarity between DGA samples in the transformer oil to capture potential associations between samples. To further enhance the learning of sample representations, we generate two augmented views by randomly perturbing node features and edges to capture information about different local structures in the graph. Additionally, we introduce a consistency constraint to ensure that the prediction results from the two augmented views remain consistent. Furthermore, we design a hierarchical perception-based ranking strategy that ranks fault similarities at a fine-grained level, effectively utilizing hierarchical fault information to optimize the model. Extensive experimental results demonstrate that the proposed model achieves high accuracy and strong generalization performance in fault-type prediction.}, archive = {J_EAAI}, author = {Yingyue Zhang and Huifang Ma and Yuwei Gao and Shengjiang Peng and Ruijia Zhang}, doi = {10.1016/j.engappai.2025.112639}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112639}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Graph-enhanced fault hierarchical perception for dissolved gas analysis in power transformer}, volume = {162}, year = {2025}, }
• (2025). Full autonomy in underwater robotics systems: A realistic prospect?. EAAI, 162, 112638. (www)

  @article{ , abstract = {Autonomous Underwater Systems (AUS) are transforming underwater exploration, environmental monitoring, and subsea operations by reducing reliance on human intervention. This review explores the advancements and challenges in achieving full operational autonomy in AUS, focusing on navigation, perception, communication, energy management, control systems, and decision-making frameworks. Current systems predominantly exhibit partial autonomy, performing pre-defined missions with limited adaptability. However, advancements in hybrid localisation techniques, multi-modal sensor fusion, and Artificial Intelligence (AI)-driven decision-making are pushing the boundaries of autonomy, enabling AUS to adapt dynamically to complex underwater environments. The integration of subsystems remains a central challenge. Navigation systems address positional drift through cooperative approaches, while perception systems enhance environmental understanding via sensor fusion. Communication technologies, although constrained by underwater limitations, are advancing through hybrid protocols that strike a balance between bandwidth and range. Energy management is evolving with innovations in battery technology, energy harvesting, and predictive resource allocation. Control systems, increasingly incorporating AI-based frameworks, translate mission commands into precise actions, bridging the gap between decision-making and physical execution. Decision-making frameworks synthesise inputs from all subsystems, enabling real-time prioritisation and adaptive behaviour. Despite significant progress, achieving full autonomy requires further innovation in subsystem integration, real-time processing, and environmental adaptability. This review emphasises the need for modular architectures and standardised protocols to ensure interoperability and scalability. The potential of fully autonomous underwater systems extends beyond technical achievements, offering profound implications for ocean exploration, resource sustainability, and environmental stewardship. The question posed – Full Autonomy in Underwater Systems: A Realistic Prospect? – is addressed with cautious optimism. While partial autonomy is well within reach, achieving full autonomy depends on sustained innovation across multiple domains. This manuscript provides a comprehensive roadmap for advancing AUS, laying the foundation for transformative advancements in one of Earth’s least understood frontiers.}, archive = {J_EAAI}, author = {Ali Rohan and Hamidreza Farhadi Tolie and Md Junayed Hasan and Somasundar Kannan}, doi = {10.1016/j.engappai.2025.112638}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112638}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Full autonomy in underwater robotics systems: A realistic prospect?}, volume = {162}, year = {2025}, }
• (2025). Design and implementation of deep learning-based framework for multi-class fault diagnosis in complex chemical process systems. EAAI, 162, 112630. (www)

  @article{ , abstract = {Fault diagnosis in modern chemical plants is increasingly challenging due to process complexity, nonlinearity, and high-risk operations, where undetected faults can cause severe safety and economic consequences. Conventional machine learning (ML) models suffer from reliance on handcrafted features, poor generalization in high-dimensional spaces, and limited labeled data, resulting in reduced diagnostic performance. To overcome these challenges, we propose a scalable deep learning (DL) framework for multi-class fault diagnosis in chemical processes. The framework employs convolutional neural networks (CNN), autoencoders (AE), and long short-term memory (LSTM) networks to automatically extract spatial and temporal features from multivariate process data. Validated on the Tennessee Eastman process (TEP) benchmark, CNN achieved the highest diagnostic performance, with 88 % accuracy, 91 % precision, and 89 % F1-score. AE also performed strongly, with 85 % accuracy and 82 % F1-score, while LSTM achieved 71 % accuracy and 75 % F1-score, all outperforming conventional machine learning models, which scored between 48 % and 52 % accuracy. Superior AUC scores (micro-average: 1.00; macro-average: 0.99) confirm the framework's robustness, including in detecting overlapping and rare faults. The proposed two-phase approach, offline training and real-time monitoring, offers a practical solution for improving fault diagnosis accuracy, adaptability, and early warning capabilities in industrial processes.}, archive = {J_EAAI}, author = {Remigius Nnadozie Ewuzie and Shivaneswar Gunasekaran and Zainal Ahmad and Norazwan Md Nor}, doi = {10.1016/j.engappai.2025.112630}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112630}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Design and implementation of deep learning-based framework for multi-class fault diagnosis in complex chemical process systems}, volume = {162}, year = {2025}, }
• (2025). A neural network approach on forecasting the engine emission using biodiesel fuel from fish oil based on injection pressure and engine operating parameters. EAAI, 162, 112628. (www)

  @article{ , abstract = {This study investigates the influence of injection pressure on the performance and emission characteristics of a diesel engine fueled with biodiesel derived from basa fish oil blended with conventional diesel (B10, B20, and B30). Experiments were performed at injection pressures ranging from 400 to 800 bar, with 600 bar as the baseline, on an engine operating at 1400 revolutions per minute (rpm). The results indicated that reducing the injection pressure to 500 bar increased emissions of carbon monoxide (CO), hydrocarbons (HC), and smoke, while nitrogen oxides (NOx) emissions decreased. At 500 bar compared to 600 bar, CO, HC, and smoke rose by up to 23.4 %, 10.0 %, and 32.0 %, respectively, whereas NOx decreased by up to 9.1 %. Conversely, at 700 bar, CO, HC, and smoke emissions decreased by up to 20.3 %, 6.7 %, and 28.4 %, while NOx increased by up to 12.7 %. Furthermore, an exhaust emission prediction model was developed using an Artificial Neural Network (ANN) based on injection pressure and engine operating parameters. The ANN model achieved high predictive accuracy, with the coefficient of determination (R 2 ) exceeding 0.995 and root mean square error (RMSE) values as low as 0.49975 % for smoke. These findings demonstrate that injection pressure significantly affects emission trade-offs in diesel engines operating with biodiesel blends. In addition, the ANN model proves to be a reliable tool for predicting and controlling engine emissions, supporting the potential of biodiesel as a sustainable alternative fuel.}, archive = {J_EAAI}, author = {Nguyen Van Tuan and Nguyen Xuan Khoa and Nguyen Tuan Nghia}, doi = {10.1016/j.engappai.2025.112628}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112628}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A neural network approach on forecasting the engine emission using biodiesel fuel from fish oil based on injection pressure and engine operating parameters}, volume = {162}, year = {2025}, }
• (2025). A fuzzy decision-making method for unloading command at crushing stations based on deep learning and dynamic coal flow features slicing. EAAI, 162, 112617. (www)

  @article{ , abstract = {The contemporary world hosts numerous open-pit coal mines, as mining efficiency increases, the unloading process of the crushing station still relies on manual command. Adversely affected by the harsh production environment and the high-intensity fatigue of operators, incorrect unloading commands can lead to issues, such as blockages at the receiver bin discharge outlet and coal swelling in the crushing chamber, resulting in production accidents. To address this issue, this study analyzes the dynamic characteristics of the coal flow in the receiver bin, in addition, monitors the bin status in real time through the camera, combining a lightweight selective kernel network (Li-SKNet) with the average classification confidence from a small segment of consecutive video frames to assess the suitability of unloading conditions. By introducing a convolutional kernel attention mechanism, the model achieved a classification accuracy of 99.8 %, subsequently, in order to adapt to the changes in the working conditions of the crushing station, a segmented fuzzy function is proposed to further optimize the model inference results. Finally, an intelligent unloading command system for the crushing station is established, which has been put into production and operated stably for six months. In comparison to traditional manual commanding methods for unloading, the system has approximately demonstrated a 15 % increase in production efficiency.}, archive = {J_EAAI}, author = {Tongyu Cui and Yongtai Pan and Yankun Bi and Zhen Liu and Jiacheng Huang and Bingjia Liu}, doi = {10.1016/j.engappai.2025.112617}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112617}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A fuzzy decision-making method for unloading command at crushing stations based on deep learning and dynamic coal flow features slicing}, volume = {162}, year = {2025}, }
• (2025). Predicting the cyclic behavior and strength-weakening effect of saturated clays using artificial neural network. EAAI, 162, 112616. (www)

  @article{ , abstract = {The cyclic behavior of soft cohesive soils under shear loads is characterized by progressively increasing strain and by the growth of the pore pressure that can lead to an effective stress reduction and, eventually, to the sudden failure of the soil, both risks with evident engineering safety implications. Although this problem has received much attention in research, most present approaches can only predict some parameters of the clay performance separately, commonly leading to highly complex approaches requiring extensive training and expertise. The present research uses an Artificial Neural Network (ANN) and machine learning to predict the cyclic behavior of the soft clays in the investigated site, considering for the first time all the relevant parameters that characterize the problem. The proposed ANN includes 9 inputs, two hidden layers with 10 neurons each, and five outputs. Nine inputs include the vertical effective consolidation pressure, parameters from the monotonic shear test, and defined input variables from the cyclic simple shear test. As outputs, the net considers five different results, including the various parameters of the shear strain response for each cycle, the maximum number of cycles, and the pore pressure increase. The resulting ANN shows predictions with high accuracy, with R = 0.995, and individual errors below 10 % in most cases. No prior training or experience is required to use the ANN, and it can be confidently used as an alternative to other analytical and numerical approaches for analyzing clay cyclic behavior, as long as the input values fall within the defined ranges.}, archive = {J_EAAI}, author = {M.A. Millán and R. Galindo and A. Viana da Fonseca and H. Patiño}, doi = {10.1016/j.engappai.2025.112616}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112616}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Predicting the cyclic behavior and strength-weakening effect of saturated clays using artificial neural network}, volume = {162}, year = {2025}, }
• (2025). Synergistic co-evolution with neural networks for evolutionary optimization. EAAI, 162, 112614. (www)

  @article{ , abstract = {Evolutionary computation (EC) algorithms, which simulate natural selection and genetic mechanisms, are widely applied to solve complex optimization and search problems. During the evolutionary process, EC algorithms inherently generate a wealth of evolutionary data. However, conventional EC algorithms often fail to effectively utilize this data, limiting their optimization effectiveness and overall performance. Neural networks, known for their powerful learning capabilities, excel in extracting features and recognizing patterns within large datasets. They can automatically identify complex relationships through their hierarchical architectures. Inspired by this, we propose a neural-synergized co-evolutionary optimization (NSCO) framework that integrates neural networks to learn from successfully evolved individuals during the EC process. This approach extracts valuable evolutionary knowledge to guide algorithms toward improved solutions and higher-quality data. Additionally, the enhanced data enables neural networks to derive richer evolutionary insights, creating a positive feedback loop that consistently improves performance. Notably, this framework operates without the need for additional expert knowledge, relying solely on the data generated by the algorithms themselves. To validate its effectiveness, we integrate this framework with 10 distinct EC algorithms and evaluate its performance using the CEC2014 benchmark suite. Results demonstrate significant enhancements in the algorithms’ performance.}, archive = {J_EAAI}, author = {Kun Bian and Juntao Zhang and Hong Han and You Zhou and Yifei Sun and Shi Cheng and Jun Zhou}, doi = {10.1016/j.engappai.2025.112614}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112614}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Synergistic co-evolution with neural networks for evolutionary optimization}, volume = {162}, year = {2025}, }
• (2025). Evaluation of environmental emergency treatment technologies using the interval pythagorean neutrosophic set. EAAI, 162, 112611. (www)

  @article{ , abstract = {At present, the problem of environmental pollution is severe both domestically and internationally, hindering social development. Therefore, strengthening environmental protection and improving the ability to manage environmental emergencies are urgently needed. Based on this situation, this paper proposes an evaluation model for environmental emergency treatment techniques (EETTs) using the interval Pythagorean neutrosophic (IPN) set for the first time. First, the IPN is introduced, and the operating rules and fractional/exact functions of IPN numbers are defined. Second, to apply IPN numbers to multi-attribute decision-making, two types of aggregation operators (IPN weighted arithmetic average (IPNWAA) operator and IPN weighted geometric average (IPNWGA) operator) are proposed. Finally, the evaluation index system and model for EETTs are constructed, and the rationality of the model is verified through an example involving computer data processing. According to the evaluation results, enterprises can identify their strengths and weaknesses in coping with environmental emergency treatment and take corresponding corrective measures in time to improve their emergency treatment capabilities. Therefore, this study has important scientific value and practical significance.}, archive = {J_EAAI}, author = {Changxing Fan}, doi = {10.1016/j.engappai.2025.112611}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112611}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Evaluation of environmental emergency treatment technologies using the interval pythagorean neutrosophic set}, volume = {162}, year = {2025}, }
• (2025). A dynamic consensus-based decentralized method for multiple unmanned aerial vehicles cooperative target allocation. EAAI, 162, 112609. (www)

  @article{ , abstract = {This paper investigates multiple unmanned aerial vehicles dynamic target allocation problem with capability-requirement matching constraints. The objective is to achieve conflict-free allocation through distributed collaboration under a dynamic environment. To address this problem, we propose a decentralized method named Dynamic Consensus-Based Group Algorithm (DCBGA). This algorithm utilizes a rule-based method known as State-Event-Condition-Action (SECA) as the decision-making framework. In addition, this algorithm consists of iterations between two phases: target selection and conflict resolution. In the target selection phase, each unmanned aerial vehicle (UAV) selects targets in a market-based method and follows the principle of “capability-requirement matching”. In the conflict resolution phase, a consensus-based mechanism is designed so that each UAV communicates with its neighbors to generate a conflict-free allocation result. In the simulation section, this paper performs convergence analysis, sensitivity analysis, and optimization comparisons. The simulation results confirm both the convergence and robustness of the DCBGA. Furthermore, the comparison results demonstrate that the proposed algorithm exhibits better optimization performance than other advanced algorithms.}, archive = {J_EAAI}, author = {Han Wang and Xiaolong Liang and Jiaqiang Zhang and Aiwu Yang}, doi = {10.1016/j.engappai.2025.112609}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112609}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A dynamic consensus-based decentralized method for multiple unmanned aerial vehicles cooperative target allocation}, volume = {162}, year = {2025}, }
• (2025). Biological visual-cognition-inspired deep network for short-term significant wave height prediction. EAAI, 162, 112607. (www)

  @article{ , abstract = {Accurate prediction of Significant Wave Height (SWH) is essential to optimize wave energy conversion efficiency. However, ocean waves' stochastic and nonlinear characteristics make traditional models face the challenges of insufficient accuracy and limited interpretability. In this paper, we propose a deep network based on a biological visual cognitive mechanism, which significantly improves the short-term SWH prediction performance inspired by the functional principles of the human visual system's hierarchical perception, hemispheric collaboration and attentional decision-making mechanism. The model consists of three components: (1) a visual-spatial pyramid component, which gradually extracts local to global features through a multi-scale convolutional kernel; (2) a brain analysis component, which combines gated recurrent unit (GRU) and convolutional neural network (CNN) to capture spatiotemporal dependencies and enhance the stability through residual connectivity, respectively; and (3) an attention-driven prediction component, which dynamically filters the key features to improve the prediction accuracy. Experiments based on two real-world buoy sites show that the proposed method reduces the mean absolute percentage error (MAPE) to 5.56 % and 6.30 %, respectively. The energy capture error (ΔP) is reduced to 10.93 % and 13.02 %, respectively, and remains robust under extreme sea states. This work can effectively improve the prediction accuracy and operational reliability of industrial ocean energy systems under complex ocean conditions.}, archive = {J_EAAI}, author = {Liao Fang and Weimin Wu and Feifei Cao and Zhenguan Cao and Guodong Fan and Lin Cui and Frede Blaabjerg}, doi = {10.1016/j.engappai.2025.112607}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112607}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Biological visual-cognition-inspired deep network for short-term significant wave height prediction}, volume = {162}, year = {2025}, }
• (2025). Event-based video interpolation via complementary motion information. EAAI, 162, 112606. (www)

  @article{ , abstract = {Video frame interpolation, the task of synthesizing intermediate frames to increase temporal resolution, often struggles with complex scenarios when constrained by the assumption of linear motion The advent of event cameras has led to significant progress in addressing this issue. Event cameras, with microsecond-level temporal resolution, bridge the gap between frames by providing accurate motion cues. However, current event-based video frame interpolation methods often overlook that event data primarily offers high-confidence features at scene edges during multi-modal feature fusion, which may limit the contribution of event signals to optical flow estimation. To address this, we propose a novel end-to-end learning framework that explicitly leverages the complementary characteristics of event signals and frames. Our method synergistically fuses dense contextual information from frames with sparse but precise edge motion from events via a proposed Edge Guided Attention (EGA) module. The EGA employs a coarse-to-fine strategy, where event-based optical flow directly refines the frame-based motion estimation at each level of a pyramidal architecture. Additionally, we introduce an event-based visibility map, co-learned within our event-processing network, to adaptively mitigate occlusions during the warping process. Extensive experiments conducted on a diverse suite of six benchmarks, including four synthetic and two real-world datasets validate the effectiveness of this novel approach. A dedicated discussion of the method’s trade-offs and potential limitations is presented in the Limitations section.}, archive = {J_EAAI}, author = {Yuhan Liu and Linghui Fu and Hao Chen and Zhen Yang and Youfu Li and Yongjian Deng}, doi = {10.1016/j.engappai.2025.112606}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112606}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Event-based video interpolation via complementary motion information}, volume = {162}, year = {2025}, }
• (2025). Real-time dynamic coordinated optimization control with near-global optimal learning for connected plug-in hybrid electric vehicles. EAAI, 162, 112602. (www)

  @article{ , abstract = {With the application of connected technologies, such as vehicle-to-vehicle and vehicle-to-cloud communication in connected vehicles to obtain various traffic information, it is crucial to balance the optimality and computational burden of the energy management strategy for further improving the fuel economy of the connected plug-in hybrid electric vehicle. Another key factor affecting the improvement of fuel economy and control performance in connected plug-in hybrid electric vehicles is the fluctuation in driving torque resulting from the different response characteristics of the engine and motor during mode switching of the powertrain for the power distribution of the energy management strategy. To address these challenges, this paper proposes a novel real-time dynamic coordinated optimization control scheme that incorporates energy management at the upper layer and adaptive coordination at the lower layer for the connected plug-in hybrid electric vehicle in a vehicle-following scenario. Based on the offline optimal control rules extracted by the extreme learning machine, which possesses good generalization capabilities, the upper-layer guided model predictive control for energy management is implemented by applying the particle swarm optimization algorithm within variable horizons across different road sections. The bottom-layer adaptive fixed-time control scheme, equipped with a coordinated mechanism, is designed to address transient response deviations in the upper-layer results. The effectiveness and advantages of the proposed hierarchical scheme are validated through both the co-simulation platform and a hardware-in-loop test.}, archive = {J_EAAI}, author = {Jiaqi Xue and Chao Yang and Jiayi Fang and Xiao Zhang and Muyao Wang}, doi = {10.1016/j.engappai.2025.112602}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112602}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Real-time dynamic coordinated optimization control with near-global optimal learning for connected plug-in hybrid electric vehicles}, volume = {162}, year = {2025}, }
• (2025). A multichannel framework for multitask learning fusion in modulation recognition tasks. EAAI, 162, 112601. (www)

  @article{ , abstract = {Automatic modulation recognition is an essential process linking signal detection to signal demodulation, and it is a promising technology for improving spectrum usage efficiency in cognitive radio. With the advent of fifth generation mobile communication technology, wireless communication systems have had massive data throughput. As a result, integrating artificial intelligence techniques with modulation recognition has emerged as a key focus area in the communication sector. To enhance the precision of signal modulation recognition, this study proposes a multitask learning fusion multichannel network modulation recognition framework—Multitask Residual Convolution Long Short Memory-Transformer Deep Neural Network. The primary task network is a two stream network composed of Convolutional Neural Network module, Long Short-Term Memory module and Transformer-Encoder module, allowing for the simultaneous extraction of both time and frequency features from the signal. The auxiliary task network is composed of residual convolution module paired with Transformer-Encoder module, designed for extracting the power spectral density characteristics of straightforward signals. Ultimately, the features derived from both the primary task network and the auxiliary task network are combined. The auxiliary network enhances the primary task network’s ability to characterize features, thereby boosting the neural network’s overall versatility and precision. The experimental findings indicate that the proposed model achieved peak recognition accuracies of 99.73%, 93.9%, and 94.1% on the three datasets, respectively. Moreover, the recognition accuracy of the proposed model is better than the baseline model in the low Signal-to-Noise Ratio environment (-18 decibel ∼ 0 decibel).}, archive = {J_EAAI}, author = {Wenshi Xiao and Zhongqiang Luo and Mengxuan Lan}, doi = {10.1016/j.engappai.2025.112601}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112601}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A multichannel framework for multitask learning fusion in modulation recognition tasks}, volume = {162}, year = {2025}, }
• (2025). Energy-efficiency prediction of fluid machinery based on knowledge-aided ensemble learning. EAAI, 162, 112600. (www)

  @article{ , abstract = {Fluid machinery is a type of high-energy-consumption equipment. Accurate prediction of energy efficiency enables the optimization of energy management and enhances equipment performance. However, factors such as equipment aging, sensor anomalies, and complex interferences pose challenges to accurately predicting energy efficiency solely through knowledge-based models or machine learning approaches. To address this issue, a fluid machinery energy efficiency prediction method based on knowledge-aided ensemble learning is proposed by integrating mechanistic knowledge and machine learning. During data repair, the physical characteristics of fluid machinery are used to identify condition anomalies, and a sliding window-based Local Outlier Factor (WLOF) algorithm is designed to identify other types of anomalies. Different types of anomalies are repaired using mechanistic knowledge and eXtreme Gradient Boosting (XGBoost), respectively. The preprocessed data is subsequently employed to train models for energy efficiency prediction. This method has been applied to predict the energy efficiency of fans in a large-scale steel plant. Compared with various energy efficiency prediction models, the application results show that the prediction based on Knowledge-WLOF-XGBoost exhibits higher accuracy and robustness than single physical models or machine learning models.}, archive = {J_EAAI}, author = {Weijian Kong and Rong Zhuo and Linfu Zheng}, doi = {10.1016/j.engappai.2025.112600}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112600}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Energy-efficiency prediction of fluid machinery based on knowledge-aided ensemble learning}, volume = {162}, year = {2025}, }
• (2025). Pretrained transformers for multimodal fake news detection: Explainability using SHapley additive exPlanations for contributions from text, image, and image captions. EAAI, 162, 112590. (www)

  @article{ , abstract = {The wide use of Online Social Networks (OSNs) for news consumption necessitates the identification and flagging of fake news to reduce its negative impacts. Existing research mostly emphasizes deep learning techniques that examine textual features or combinations of text and images for the detection of fake news. In this study, we propose two enhanced models for fake news detection. First, we present a multimodal framework that leverages Vision Transformer embeddings for image representation instead of traditional Convolutional Neural Network (CNN) features, which achieves significant improvements over baseline approaches. Second, we implemented an image caption-augmented multimodal model that integrates image captions as an additional modality alongside text and images. Caption embeddings act as semantic bridges that strengthen cross-modal alignment and contextual understanding. The experiments conducted on the FakeNewsNet and Fakeddit datasets show that the model incorporating image captions consistently surpasses the baseline BERT-VIT framework. It achieves improvements of up to +7.9% in accuracy, +11.5% in precision, and +5.3% in the F1-score, while still maintaining competitive levels of recall and Area Under the Curve (AUC). Statistical significance testing verifies the reliability of these enhancements. Additionally, a SHapley Additive exPlanations (SHAP)-based analysis highlights the contribution of each modality, which enhances the interpretability of the proposed framework.}, archive = {J_EAAI}, author = {Athira A.B. and S.D. Madhu Kumar and Anu Mary Chacko}, doi = {10.1016/j.engappai.2025.112590}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112590}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Pretrained transformers for multimodal fake news detection: Explainability using SHapley additive exPlanations for contributions from text, image, and image captions}, volume = {162}, year = {2025}, }
• (2025). Assessing the morphological quality of zizania latifolia shoot based on instance segmentation. EAAI, 162, 112589. (www)

  @article{ , abstract = {The breeding of Zizania latifolia primarily relies on the cross-regional introduction of varieties and manual selection, which involves the assessment of morphological quality. Traditional methods are time-consuming and labor-intensive. This paper proposed a morphological assessment method based on instance segmentation. Assessment indicators, including enlargement degree, color, straightness, and slenderness, were defined according to national grading standards and expert knowledge to provide a comprehensive assessment framework. For the segmentation task, the irregular contours, similar internal regions, and indistinct boundaries pose significant challenges. Additionally, classification heavily relies on the spatial relationships. To solve these problems, this study proposed a sub-stem segmentation algorithm, which based on You Only Look Once Version 8 (YOLOv8). The Linear Deformable Convolution (LDConv) module was employed to recognize irregular sub-stems through learnable offsets. Next, the Efficient Multi-Scale Attention (EMA) mechanism was added to refine image features by emphasizing the interactions between channels and spatial dimensions. We also employed the Wise Intersection over Union Version 3 (WIoU v3) loss function, which evaluated the anchor box quality based on outlier degree. The proposed model outperformed YOLOv8 and other state-of-the-art models on the Zizania latifolia dataset, achieving Precision, Recall, and mean Average Precision (mAP) values of 95.3 %, 93.9 %, and 97.7 %. Additionally, our model achieved 35.7 % mAP on the Microsoft Common Objects in COntext (MS COCO) dataset. Based on the segmentation results, we extracted phenotypic parameters, such as height, width, and two-dimensional area. We determined the top-10 individuals with superior morphological quality among 65 varieties, providing robust support for Zizania latifolia breeding.}, archive = {J_EAAI}, author = {Chenmin Yang and Shanyong Wang and Tingting Lou and Ruiqi Song and Huanliang Xu and Zhaoyu Zhai}, doi = {10.1016/j.engappai.2025.112589}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112589}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Assessing the morphological quality of zizania latifolia shoot based on instance segmentation}, volume = {162}, year = {2025}, }
• (2025). A combined adaptive gaussian short-term fourier transform and mamba framework for stock price prediction. EAAI, 162, 112588. (www)

  @article{ , abstract = {In financial investment, predicting stock prices precisely is challenging due to the inherent volatility and non-stationarity of market data. To address this, we propose a pioneering hybrid approach, introducing the Adaptive Gaussian Short-Time Fourier Transform (AG-STFT) in Mamba for the first time—it dynamically adjusts the window size based on frequency content to enhance the representation of non-stationary modes. We further present AGSMNet, a novel hybrid architecture fusing AG-STFT with the Mamba framework, which addresses the dual-domain modeling challenge (time + frequency) through an end-to-end deep learning solution leveraging both signal processing and structured state-space modeling techniques, enabling robust sequence modeling with enhanced temporal and spectral sensitivity. The AG-STFT dissects and represents temporal and spectral features of stock price movements, capturing dynamics often overlooked by traditional models, while Mamba — known for discerning complex patterns — enhances predictive capabilities. The model employs a Multiple Feature Extraction (MFE) module for shallow features and a Residual State-Space Group (RSSG) module for deep features, fed into a predictor module to predict next-day prices. Extensive experiments across ten major stock and index datasets demonstrate that AGSMNet consistently achieves the lowest MAE, MSE, and RMSE, and the highest R 2 values, outperforming leading models such as TimesNet, Autoformer, and MambaStock. These results confirm AGSMNet’s superior generalization, robustness across volatile markets, and practical effectiveness. It is applicable to non-stationary datasets, outperforms traditional, machine learning, and deep learning-based methods, and shows potential as a transformative tool for financial analysts and investors, with adaptability to other financial modeling areas promising advancements in predictive analytics.}, archive = {J_EAAI}, author = {Yuling Huang and Zhiyuan Pei and Jin Yan and Chujin Zhou and Xiaoping Lu}, doi = {10.1016/j.engappai.2025.112588}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112588}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A combined adaptive gaussian short-term fourier transform and mamba framework for stock price prediction}, volume = {162}, year = {2025}, }
• (2025). Driver risk classification for transportation safety: A machine learning approach using psychological, physiological, and demographic factors with driving simulator. EAAI, 162, 112585. (www)

  @article{ , abstract = {Driving behavior is a critical factor in ensuring road safety, particularly in commercial transportation sectors where hiring safe and reliable drivers is a priority. This study presents a machine learning-based framework for predicting driver behavior using multimodal assessments, including psychological, physiological, and demographic factors. We utilized a driving simulator equipped with biometric sensors to capture the physiological data of the driver, including heart rate, eye blink rate, pupil diameter, and point of gaze (POG), during driving sessions. The psychological attributes are collected through a self-report questionnaire. The questionnaire is structured to obtain information about nine psychological characteristics of the driver, including instrumental attitude, social anxiety, sensation seeking, premeditation, urgency, selfishness, aggressive mode, life satisfaction, and conscientiousness. In addition, some demographic attributes, such as age and gender, are also adopted to study their effect on driving behavior. Experiments were conducted on 80 participants, each driving for 10 min. Various machine learning models, along with a feature selection strategy, were used to find the relationship between the driver's modalities and his driving behavior. Results demonstrate that the k-nearest neighbors (KNN) model achieved the best performance, yielding an accuracy of 93.75 % and a False Negative Rate (FNR) of 0. Feature importance analysis revealed that gaze distraction, sensation seeking, conscientiousness, and gender are the best predictors of driving behavior. The findings suggest that our model can serve as a valuable decision-support tool for taxi companies and transportation agencies aiming to enhance driver selection processes by identifying drivers with lower accident risks.}, archive = {J_EAAI}, author = {Malek Masmoudi and Yasmin Shakrouf and Omar Hassan Omar and Amir Shikhli and Fatima Abdalla and Wadad Alketbi and Imad Alsyouf and Ali Cheaitou and Anwar Jarndal and Ali I. Siam}, doi = {10.1016/j.engappai.2025.112585}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112585}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Driver risk classification for transportation safety: A machine learning approach using psychological, physiological, and demographic factors with driving simulator}, volume = {162}, year = {2025}, }
• (2025). A credibility and consistency-oriented stochastic aggregation framework for heterogeneous multi-attribute large-scale group decision making with several attribute sets. EAAI, 162, 112584. (www)

  @article{ , abstract = {In large-scale group decision making, experts usually provide their individual preferences on attribute values, as well as attribute sets. The coexistence of large-scale heterogeneous information poses a significant challenge to the credibility and consistency on decision making. To this issue, the paper proposes a credibility and consistency-oriented stochastic aggregation framework, including four primarily research points. Firstly, a simplified transformation method is developed to convert heterogeneous attribute values into individual attribute superiority-probability-based pairwise comparison matrix (IA-SPMs), which saves transformation cost as well as provides abundant references for credibility analysis. Secondly, the deviation-based credibility measures and the credibility-based weighting methods are proposed. Thirdly, a cluster-based aggregation operator is introduced by considering group consistent preferences on attributes selection to get the collective SPM (C-SPM). Fourthly, the ranking probability matrix (RPM) and the possibility ranking result are calculated based on the C-SPM. Using experiment and application analyses we illustrate that the proposed methods can enhance the credibility of decision outcomes, as well as the stability of the results. This research can provide technical support for effective fusion of heterogeneous information from multiple sources in the artificial intelligence (AI) era, and has broad application potential in large-scale democratic decision making and pre-evaluation engineering projects.}, archive = {J_EAAI}, author = {Weiwei Li and Pingtao Yi and Danning Zhang}, doi = {10.1016/j.engappai.2025.112584}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112584}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A credibility and consistency-oriented stochastic aggregation framework for heterogeneous multi-attribute large-scale group decision making with several attribute sets}, volume = {162}, year = {2025}, }
• (2025). Probabilistic machine learning with a cascaded framework for robust failure mode classification and capacity estimation of rectangular concrete-filled steel tube columns under axial compression. EAAI, 162, 112581. (www)

  @article{ , abstract = {This study develops an advanced probabilistic machine learning (ML) framework to predict failure modes and axial load-bearing capacity of rectangular concrete-filled steel tube (CFST) columns, addressing critical challenges of class imbalance and prediction uncertainty. Leveraging a comprehensive dataset of 597 experimental samples, a rigorous feature selection procedure is conducted to optimize the ML applications. Three ML models are developed and evaluated: a deterministic approach (Random Forest) and two probabilistic models (Gaussian Process and Natural Gradient Boosting, NGBoost). To address the issue of class imbalance in failure mode classification, a hybrid resampling strategy combining the Synthetic Minority Over-sampling Technique and Tomek Links method (SMOTE-Tomek) is implemented. Furthermore, A novel classification-regression cascaded framework is proposed, where failure modes are first classified, followed by category-specific regression for capacity prediction. Results demonstrate that SMOTE-Tomek significantly improves minority failure mode classification, increasing the average F1-scores by 8.1 % (for flexural failure) and 118.2 % (for combined failure). The cascaded framework outperforms direct regression in estimating capacity, achieving a 56 % higher coefficient of determination (R 2 ) and 15–30 % lower error metrics on average. NGBoost excels in both probabilistic failure mode prediction and uncertainty-aware capacity estimation, enabling reliability-based design and risk-informed decision-making for CFST structures in engineering practice.}, archive = {J_EAAI}, author = {Xueqi Zhong and Dade Lai and Qiyao Yu and Feiyu Liao}, doi = {10.1016/j.engappai.2025.112581}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112581}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Probabilistic machine learning with a cascaded framework for robust failure mode classification and capacity estimation of rectangular concrete-filled steel tube columns under axial compression}, volume = {162}, year = {2025}, }
• (2025). Enhancing precision tomato harvesting with feature sharing and intersection screening. EAAI, 162, 112580. (www)

  @article{ , abstract = {Tomato is a significant economic crop cultivated extensively worldwide. Rapid and accurate localization of picking points is fundamental to automating the tomato harvesting process. To address this, we develop a lightweight dual-task network built upon the YOLOv10 (You Only Look Once) architecture. The backbone integrates the ADown module for efficient downsampling, and utilizes a Dysample-based cross-scale feature fusion module (CCFM) in the detection neck, while the segmentation neck employs Simulated Annealing Adaptive Concatenation (SAAC) for feature fusion. Furthermore, the conditionally restricted Hungarian algorithm is employed to match ripe tomatoes with their corresponding corollas. Two localization techniques are proposed: local skeleton line fitting and boundary intersection screening. In local skeleton line fitting, the corolla detection box is expanded, and the stem mask within this region is used to extract the skeleton line and find the intersection point. Boundary intersection screening determines whether to directly compute the midpoint of intersecting lines or use skeleton line fitting, based on the number of intersections between the stem mask and the corolla box. The detection Precision and Recall of the proposed model are 0.970 and 0.983, respectively, while the IoU (Intersection over Union) and MIoU (Mean Intersection over Union) for segmentation are 0.962 and 0.980. The localization precision for picking points is 0.922, with a recognition rate of 0.988. Achieving an average processing time of only 55.89 ms per image, the proposed artificial intelligence application exhibits excellent efficiency and accuracy in real-world conditions, offering a promising foundation for further development of automated tomato harvesting systems.}, archive = {J_EAAI}, author = {Xueke An and Bin Dai and Zhaolei Yang and Hassan H.A. Mostafa and Wang Fangyan and Yuliang Yun}, doi = {10.1016/j.engappai.2025.112580}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112580}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhancing precision tomato harvesting with feature sharing and intersection screening}, volume = {162}, year = {2025}, }
• (2025). Predicting the compression index of expansive soils with hybrid machine learning approaches. EAAI, 162, 112579. (www)

  @article{ , abstract = {Expansive soils pose significant challenges for geo-infrastructure design, construction, and maintenance because of their moisture-induced volume changes. Despite extensive research on swelling behavior, the compression index ( C c ), an important indicator of soil compressibility has received relatively limited attention. C c is conventionally obtained from time-consuming and costly consolidation tests, while empirical equations derived from general clays may not provide reliable estimates for expansive soils. To address this gap, seven machine learning models based on five algorithms were developed to estimate the C c of expansive soils using soil properties readily obtained from conventional laboratory tests. A comprehensive dataset comprising 238 expansive soil samples, compiled from 60 years of published literature across various regions of the world, is employed to train and validate the proposed models. Among them, Model 2 based on Newton-Raphson-Based Optimizer optimized Extreme Gradient Boosting (NRBO-XGBoost) achieved the best performance, with a coefficient of determination ( R 2 ) of 0.903 and a root mean square error (RMSE) of 0.029 on the test set. Sensitivity analysis showed that the plasticity index was the most influential factor (31.1 %), followed by liquid limit (29.4 %), initial void ratio (25.3 %), and dry density (14.1 %), highlighting its primary influence on soil compressibility. Additionally, a simplified equation derived from the Multilayer Perceptron (MLP) designated as Model 4 is validated through three case studies. The settlement predictions deviated by 5–14 % from field measurements, offering a practical tool without the need for machine learning techniques. The findings provide useful guidance for developing rational design strategies for geo-infrastructures affected by expansive soils.}, archive = {J_EAAI}, author = {Aolin Zhang and Sai K. Vanapalli}, doi = {10.1016/j.engappai.2025.112579}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112579}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Predicting the compression index of expansive soils with hybrid machine learning approaches}, volume = {162}, year = {2025}, }
• (2025). Model-based pre-compensator design for piezoelectric actuators based on physics guided neural network and physics-precision balanced training. EAAI, 162, 112576. (www)

  @article{ , abstract = {Designing model-based pre-compensators is crucial for achieving high-precision motion control in piezoelectric actuators (PEAs), which exhibit complex nonlinear behaviors. While data-based modeling methods offer a straightforward approach, they face challenges with poor extrapolation and high complexity. Incorporating the known physics of PEAs, which is more consistent with physical principles and computationally efficient, can help overcome these limitations. Based on the above knowledge, this paper embeds physical knowledge within a neural network, forming a novel Physics Guided Neural Network (PGNN) structure as a model-based PEA pre-compensator to achieve high motion precision. Training the PGNN is challenging due to potential competition between the physics component and the neural network. The flexible nature of the neural network can easily overshadow the physical information, leading to overfitting and rendering the PGNN model ineffective. To address this, a Physics-Precision Balanced Training (PPBT) method is proposed. In the PPBT method, the physical correctness and model precision of the PGNN are mathematically defined, and these two components are balanced through a nonlinear function within the training algorithm. Experimental results show that the proposed pre-compensator based on PGNN and PPBT outperforms physics-based approaches in precision and offers greater robustness than purely data-based methods. The peak-to-peak displacement error is reduced to less than 35 nm in open-loop control. Measured by Mean Absolute Error (MAE), this method reduces displacement errors by 89 % compared to no compensation, by 77 % compared to purely neural network-based compensation, and by 73 % compared to rate-dependent Prandtl-Ishlinskii operator-based compensation.}, archive = {J_EAAI}, author = {Qin Li and Zhiwei Ruan and Chenyang Ding}, doi = {10.1016/j.engappai.2025.112576}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112576}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Model-based pre-compensator design for piezoelectric actuators based on physics guided neural network and physics-precision balanced training}, volume = {162}, year = {2025}, }
• (2025). End-to-end burst signal demodulation via adaptive masked deep learning framework. EAAI, 162, 112569. (www)

  @article{ , abstract = {The bit error rate (BER) directly determines the quality of wireless communication transmission. Traditional demodulators are limited in operating on burst signals and exhibit poor BER performance in low signal-to-noise ratio (SNR) conditions. For real-world burst signals, symbol-by-symbol approaches fail to capture inter-symbol dependencies, and existing end-to-end frameworks cannot handle the variable output lengths required for burst signals. To address this issue, we propose an end-to-end demodulation framework based on deep learning (DL), in which detection, recognition, channel compensation, and demodulation stages were trained as a unified system, enabling the entire signal burst to be demodulated in a single operation during inference. The framework's generalization and robustness are enhanced by a proposed masking mechanism and a denoising autoencoder (DAE), respectively. The former dynamically adjusts the output bitstream length while preventing gradient flow from redundant components, and the latter compensates for channel fading effects. We further introduce a dedicated end-to-end training strategy to optimize the adaptation between these modules. Experimental results on real-world Frequency Shift Keying (FSK), Minimum Shift Keying (MSK), Phase-Shift Keying (PSK), and Quadrature Amplitude Modulation (QAM) signals demonstrate that the proposed framework achieves superior demodulation accuracy for long-sequence burst signals. Compared to existing methods, the proposed framework enables parallel demodulation, and dynamically adapts the output bit stream in terms of varying message types and lengths.}, archive = {J_EAAI}, author = {Mingdi Li and Wenzhe Fan and Yanbin Li and Chunlei Xie and Yanan Duan}, doi = {10.1016/j.engappai.2025.112569}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112569}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {End-to-end burst signal demodulation via adaptive masked deep learning framework}, volume = {162}, year = {2025}, }
• (2025). Dual-head detector with point-driven transformer and semantic-spatial gating for liquid crystal display defects. EAAI, 162, 112565. (www)

  @article{ , abstract = {The unique structure of liquid crystal displays (LCDs) leads to defects with specific characteristics, posing a significant challenge to defect detection. These defects mainly include global slender line defects, numerous small defects, and other defects exhibiting significant variations in scale and visual complexity. To simultaneously detect slender defects and numerous small defects, we propose a novel dual-head detector (DHDet) that combines the strengths of transformer-based and convolutional neural network (CNN)-based approaches. The transformer-based line head leverages its global context modeling capability and exploits shape priors by representing line defects using discrete points. Additionally, a slender-object query selection module is introduced to generate line proposals composed of discrete points. These proposals with spatial cues provide effective initialization for the inputs of the transformer decoder. The CNN-based box head focuses on detecting prevalent small defects and other multi-scale objects. To enhance the detection of complex and large defects, we design a semantic-modulated spatial-coordinated gating module. Through semantic guidance and spatial correlations, this module adaptively gates and weights global context from the line head’s queries to optimize top-level features for the box head. Experiments on an industrial LCD defect detection dataset and two defect datasets of manufacturing domain demonstrate our detector’s superior performance in complex defect detection tasks. Our method outperforms other state-of-the-art methods on the LCD defect dataset, achieving 67.4% mean average precision (mAP) and 88.3% mAP at an intersection over union threshold of 0.5 (mAP 50 ). The code is available at .}, archive = {J_EAAI}, author = {Chaofan Zhou and Meiqin Liu and Senlin Zhang and Shanling Dong and Ronghao Zheng and Shaoyi Du}, doi = {10.1016/j.engappai.2025.112565}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112565}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dual-head detector with point-driven transformer and semantic-spatial gating for liquid crystal display defects}, volume = {162}, year = {2025}, }
• (2025). An integrated machine learning framework for the early diagnosis of hypertension disease. EAAI, 162, 112564. (www)

  @article{ , abstract = {Hypertension is a type of disease that occurs after a serious increase in blood pressure. Due to the rapid increase in the disease, efforts for its early diagnosis are increasing day by day. The use of artificial intelligence (AI) and machine learning (ML) methods in disease detection is of great importance, especially in early diagnosis. In this study, a framework for the diagnosis of hypertension is developed. Behavioral Risk Factor Surveillance System (BRFSS) and Hypertension Risk Prediction (HRP) datasets with clinical and demographic information were used to diagnose hypertension. The problem of class imbalance in the datasets was solved by Random OverSampling method. In particular, the relationship between the attributes and the target variable was analyzed with Consistency-Based Filter, Recursive Feature Elimination with Cross-Validation (RFECV), Least Absolute Shrinkage and Selection Operator (LASSO), Information gain, Relief and Correlation-based feature selection methods and the features selected for the diagnosis of hypertension disease were taken into consideration. In the experiments, Extremely Randomized Trees (Extra Trees), Adaptive Boosting (Adaboost) and Extreme Gradient Boosting (XGBoost) machine learning methods were used in five fold cross-validation. In both datasets, the most successful results were obtained with the XGBoost algorithm. Then, for this algorithm, Random Search, Grid Search, Bayes Search and Genetic Algorithm were used for model hypertuning. For the BRFSS dataset with 87.96 % accuracy and for the HRP dataset with 97.67 % accuracy were obtained. The results are obtained with evaluation metrics that the medical world considers in evaluations, and the proposed framework for hypertension disease detection provides valuable insights for healthcare applications.}, archive = {J_EAAI}, author = {Ayşe Eldem}, doi = {10.1016/j.engappai.2025.112564}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112564}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An integrated machine learning framework for the early diagnosis of hypertension disease}, volume = {162}, year = {2025}, }
• (2025). An explainable deep learning approach for sleep staging in sleep apnea patients across all age subgroups from pulse oximetry signals. EAAI, 162, 112562. (www)

  @article{ , abstract = {Deep-learning (DL) approaches have been developed using pulse rate (PR) and blood oxygen saturation (SpO 2 ) recordings from pulse oximetry to streamline sleep staging, particularly for obstructive sleep apnea (OSA) patients. However, lack of interpretability and validation across patients from a wide range of ages (children, adolescents, adults, and elderly OSA individuals) are two major concerns. In this study, a DL model based on the U-Net framework (POxi-SleepNet) was tailored to accurately perform 4-class sleep staging (wake, light sleep, deep sleep, and rapid-eye movement sleep) in OSA patients across all age subgroups using PR and SpO 2 signals. An explainable artificial intelligence (XAI) methodology based on semantic segmentation via gradient-weighted class activation mapping (Seg-Grad-CAM) was also applied to quantitatively interpret the time and frequency characteristics of pulse oximetry recordings that influence sleep stage classification. Overnight PR and SpO 2 signals from 17303 sleep studies from six datasets encompassing children, adolescents, adults, and elderly OSA individuals were used. POxi-SleepNet showed high performance for sleep staging in the six databases, with accuracies between 81.5 % and 84.5 % and Cohen's kappa values from 0.726 to 0.779. It also demonstrated greater generalizability than previous studies. XAI analysis showed the key contributions of mean and variability in PR and SpO 2 amplitude, as well as changes in their spectral content across specific frequency bands (0.004–0.020 Hz, 0.020–0.100 Hz, and 0.180–0.400 Hz), for sleep stage classification. These findings indicate that POxi-SleepNet could effectively automate sleep staging and assist in diagnosing OSA across all age groups in clinical settings.}, archive = {J_EAAI}, author = {Fernando Vaquerizo-Villar and Gonzalo C. Gutiérrez-Tobal and Daniel Álvarez and Adrián Martín-Montero and David Gozal and Roberto Hornero}, doi = {10.1016/j.engappai.2025.112562}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112562}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An explainable deep learning approach for sleep staging in sleep apnea patients across all age subgroups from pulse oximetry signals}, volume = {162}, year = {2025}, }
• (2025). Transient electrodynamic simulation of laser beam reflection on inclined surfaces using a generative adversarial network-based deep learning model. EAAI, 162, 112561. (www)

  @article{ , abstract = {In laser-material interactions, the temporal dynamics of beam reflection are crucial as they affect both laser absorption and material response. Currently, electrodynamic simulation is the most accurate method for calculating transient laser reflection and absorption patterns, but it is computationally very expensive. In this study, we present the first transient electrodynamic simulation model based on a generative adversarial network, with the time information embedded as color in the input image. The model accurately predicts reflection patterns of a laser beam on inclined surfaces using an input image containing geometric and time information of the domain. The finite-difference time-domain method was used to generate 16 data by changing the surface inclination angle from 0 o to 75 o . The model was based on a generator made by stacking a deep residual network and a discriminator. Although trained on limited data, the model predicted transient beam reflection patterns without overfitting, and the average structural similarity index measure and R-squared accuracy were 96.7 % and 98.0 %, respectively. Another deep learning model was developed to predict the laser beam absorptance from a laser beam reflection image. The ground truth absorptance values were obtained from the Fresnel equations, and the average R-squared accuracy was 99.8 %. Robustness evaluation was additionally performed to examine if the model can be used to predict reflection patterns from angled and curved surfaces. Reasonably accurate results were obtained when the angle difference was not greater than 3° for angled surfaces and the normalized curvature was 0.032 or less for curved surfaces.}, archive = {J_EAAI}, author = {Myeonggyun Son and Hyungson Ki}, doi = {10.1016/j.engappai.2025.112561}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112561}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Transient electrodynamic simulation of laser beam reflection on inclined surfaces using a generative adversarial network-based deep learning model}, volume = {162}, year = {2025}, }
• (2025). Mechanical properties prediction of bi-metal foam sandwiches using machine learning methods and elastic deformation behaviour. EAAI, 162, 112560. (www)

  @article{ , abstract = {Metal foam sandwiches are a kind of ultra-lightweight material made from a porous metal core bonded to two face sheets. Friction stir welding (FSW) is utilised in welding bimetal foam sandwiches. It is worth mentioning that the exact relation between mechanical properties and process parameters is challenging to determine. The innovation lies in the non-destructive estimation of mechanical properties (Young's modulus, ultimate tensile strength and fracture strain) through elastic deformation data and the novel application of artificial intelligence techniques optimised by genetic algorithms, eliminating dependency on input process parameters. After proper network training, three methods are employed to estimate these mechanical properties: a decision tree, a feedforward neural network and long-short term memory. These are chosen to investigate the influence of both machine/deep learning methods in predicting the mechanical properties of the FSW final product. Moreover, a genetic algorithm is employed to find the optimal hyperparameters of the three investigated prediction models to reach the highest accuracy. The results prove the efficiency of the proposed feedforward neural network in the estimation of Young's modulus and ultimate tensile strength for the bi-metal foam sandwiches with lower mean absolute error (MAE) and higher correlation coefficient compared to the decision tree (63.9 % lower MAE and 25.50 % higher correlation coefficient) and long-short term memory (77.50 % lower MAE and 25.05 % higher correlation coefficient). In addition, the proposed decision tree model accurately predicts the fracture strain with R-square and root mean square error as 0.61429 and 1.3862 × 10 −5 , respectively.}, archive = {J_EAAI}, author = {Mohammad Reza Chalak Qazani and Mohsen Dorudgar and Mehdi Moayyedian and Abdel-Hamid I. Mourad and Moosa Sajed and S.M. Hossein Seyedkashi and Siamak Pedrammehr}, doi = {10.1016/j.engappai.2025.112560}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112560}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Mechanical properties prediction of bi-metal foam sandwiches using machine learning methods and elastic deformation behaviour}, volume = {162}, year = {2025}, }
• (2025). Multimodal unified generalization and translation network for intelligent fault diagnosis under dynamic environments. EAAI, 162, 112559. (www)

  @article{ , abstract = {Multimodal data fusion can generate reliable fault representations for intelligent fault diagnosis. However, simple data fusion strategies often introduce fault-irrelevant information, thereby reducing robustness against unknown domain shifts. Moreover, traditional methods generally lack adaptive mechanisms to address missing modalities, leading to considerable performance degradation under sensor failure conditions. To address these problems, this paper proposes a multimodal unified generalization and translation network. To learn invariant unified representations for resisting unknown data distribution shifts, information-enhanced concatenation first generates intra-domain and cross-domain representations. Subsequently, mutual information maximization is applied to remove fault-unrelated information from these representations. Finally, A hybrid ensemble diagnosis strategy fully leverages the interaction of multimodal information across different levels. In addition, semantic supervision investigates the relationships among different modalities and enables intermodal translation in the event of a sensor failure within the monitoring system. Extensive experimental results based on a public bearing dataset and a self-collected motor dataset indicate that the proposed method improves accuracy by 10.53 % and 8.47 % compared to the state-of-the-art methods, respectively. The code and datasets are available at https://github.com/CHAOZHAO-1/MUGTN .}, archive = {J_EAAI}, author = {Chao Zhao and Weiming Shen and Enrico Zio and Hui Ma}, doi = {10.1016/j.engappai.2025.112559}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112559}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multimodal unified generalization and translation network for intelligent fault diagnosis under dynamic environments}, volume = {162}, year = {2025}, }
• (2025). FabricMamba: A fabric surface defect detection system based on large kernel attention and visual state space. EAAI, 162, 112558. (www)

  @article{ , abstract = {In the textile manufacturing industry, fabric defect detection is essential for ensuring product quality. Traditional approaches based on Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs) often encounter scalability issues, particularly due to the high computational complexity of the self-attention mechanism in ViTs. To address these limitations, this study introduces FabricMamba, a real-time defect detection framework built on the You Only Look Once version 8 (YOLOv8) CNN architecture. The model enhances detection precision and efficiency for complex fabric defects in high-resolution images while minimizing computational cost. YOLOv8 was selected as the base model due to its strong balance between accuracy and inference speed, which is critical in fast-paced textile production settings. FabricMamba extends YOLOv8 with several innovations: the Parallel Large Separable Kernel Attention (P-LSKA) mechanism for multi-scale perception, the Visual State Space Module (MVSS) for long-range dependency modeling, the lightweight DySample module for reduced resource usage, and Programmable Gradient Information (PGI) to optimize training without increasing inference complexity. Extensive evaluations were conducted using a proprietary industrial fabric defect dataset and two public benchmarks, TILDA Textile Texture Database and FDDS Object Detection Dataset. FabricMamba achieved a mean Average Precision (mAP) of 90.0 %, 97.7 %, and 39.1 % on the respective datasets, outperforming the YOLOv8 baseline by 1.8 %, 2.3 %, and 2.0 %. Compared to Mamba-YOLO, FabricMamba reduced model size and computational requirements by 36.7 % and 33.1 %, respectively, with recall improving by 2.9 %, 1.4 %, and 4.0 %. These results confirm the model effectiveness and practical potential for industrial fabric inspection tasks.}, archive = {J_EAAI}, author = {Nengsheng Bao and Jiajun Lin and Yuchen Fan and Runxuan Bao and Alessandro Simeone}, doi = {10.1016/j.engappai.2025.112558}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112558}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {FabricMamba: A fabric surface defect detection system based on large kernel attention and visual state space}, volume = {162}, year = {2025}, }
• (2025). Optimizing performance metrics with new distance and similarity measures using control parameters of linear diophantine fuzzy sets. EAAI, 162, 112557. (www)

  @article{ , abstract = {The control parameters (CPs) of linear Diophantine fuzzy sets (LDFSs) provide an innovative approach for information analysis in the multi-criteria decision making (MCDM), machine learning (ML), and computational intelligence (CI). The CPs give freedom to the decision-makers in evaluating feasible alternatives in measuring performance metrics. Previous fuzzy MCDM methods often meet strict limitations in handling real-world uncertainty and dynamic MCDM. To overcome these limitations, this study extends the Preference Ranking Organization Method for Enrichment of Evaluations (PROMETHEE-II) method to linear Diophantine fuzzy sets (LDFSs) for more flexible and robust MCDM approach. The proposed MCDM approach primarily evaluates performance metrics criterion, utilizing LDFSs which are robust extension of fuzzy sets (FSs), intuitionistic fuzzy sets (IFSs) as well as interval-valued intuitionistic fuzzy sets (IVIFSs). It helps decision makers to address uncertain information with membership degree (MD), non-membership degree (NMD), and CPs. For this objective, new LDFS based distance measures (DMs) and similarity measures (SMs) are developed for the construction of LDFS PROMETHEE-II technique. The proposed MCDM approach provides a structured and comprehensive framework for optimizing investment performance metrics. Its robustness is validated through sensitivity and comparative analyses.}, archive = {J_EAAI}, author = {Masooma Raza Hashmi and Muhammad Riaz and Arshid Mahmood and Muhammad Ajmaeen and Muhammad Aslam}, doi = {10.1016/j.engappai.2025.112557}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112557}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Optimizing performance metrics with new distance and similarity measures using control parameters of linear diophantine fuzzy sets}, volume = {162}, year = {2025}, }
• (2025). A dynamic capsule network-based physical alert monitoring system for elderly people with disabilities. EAAI, 162, 112556. (www)

  @article{ , abstract = {Elderly disabled people have higher health risks due to reduced mobility, delayed emergency response, and poor real-time monitoring. Existing Internet of Things (IoT) based monitoring systems frequently have static thresholds, lack personalization, and struggle to capture complex physical and physiological fluctuations, resulting in false alerts and reduced reliability. We propose a Dynamic Capsule Network-Based Physical Alert Monitoring System (DyCN-PAM) for intelligent, real-time monitoring of elderly disabled people to overcome these constraints. Compiling accelerometer, gyroscope, and heart rate readings, and utilizing capsule routing to preserve spatiotemporal hierarchies, enables the system to detect falls, seizures, and fainting. Context-aware alerts utilize capsule confidence and heart rate baselines to distinguish between typical changes and catastrophic emergencies. The DyCN-PAM system outperforms benchmark models in terms of accuracy and robustness, achieving a 5.13 % increase in F1-score, a 28.6 % increase in precision, a 45.1 % reduction in false alarms, and a 26.3 % improvement in computational efficiency. The DyCN-PAM system enhances accuracy, precision, and efficiency, making it feasible to improve safety, independence, and quality of life for older individuals with disabilities. More real-world experiments are needed to prove its use.}, archive = {J_EAAI}, author = {Shujuan Feng and Hongying Zhu and Yangkai Wu and Ziheng Zeng and Ezzeddine Touti and Jinming Wang and Amar Jain}, doi = {10.1016/j.engappai.2025.112556}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112556}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A dynamic capsule network-based physical alert monitoring system for elderly people with disabilities}, volume = {162}, year = {2025}, }
• (2025). A multiple convolution and bilayer acceleration model for precise and efficient early urban fire detection in complex scenarios. EAAI, 162, 112555. (www)

  @article{ , abstract = {AI advancement enables earlier and more effective urban fire detection, crucial for slowing fire spread. However, hardware limitations make precise and efficient detection under limited resources a major challenge. Moreover, earlier detection of fire requires the identification of smoke, which further exacerbates the difficulty of detecting algorithms since smoke's inherent low-contrast visual properties produce feature blurring from the surrounding background. In this paper, we propose a novel multiple convolutions and bilayer accelerate (MCBA) model for effective early urban fire detection in terms of precision, lightweight and efficiency, which takes advantage of the mainstream You Only Look Once version 8 (YOLOv8) to training and testing the early fire detection model. In our MCBA model, three optimization techniques have been developed to balance lightweight and precision. First, it designs a new multi-convolution (MC) structure to reduce the size of the original backbone network by avoiding complex or skipping connections. Second, the model includes a novel design of a bilayer accelerate mechanism (BAM) at the neck to minimize the interference of redundant background information in multiple scenarios. Third, we provide a precision compensation strategy (PCS) at the neck to enhance the feature extraction and aggregation capabilities, enabling effective detection of small fire areas. The experiments demonstrate that our proposed MCBA model achieves higher performance in terms of precision and efficiency compared with 17 counterpart detection models. It exhibits superior performance with minimal parameter count and the lowest computational complexity among the compared methods. The model shows strong potential for deployment in early urban fire detection across a variety of real-world scenarios.}, archive = {J_EAAI}, author = {Pei Shi and Jun Lu and Yachen Xu and Quan Wang and Yonghong Zhang and Liang Kuang and Deji Chen and Guangyan Huang}, doi = {10.1016/j.engappai.2025.112555}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112555}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A multiple convolution and bilayer acceleration model for precise and efficient early urban fire detection in complex scenarios}, volume = {162}, year = {2025}, }
• (2025). Deep learning driven prediction of dynamic stress-strain response in limestone: Insights into transient mechanical behavior under complex loadings for shield tunneling. EAAI, 162, 112554. (www)

  @article{ , abstract = {The complex geological conditions pose a serious challenge to improving the rock-breaking efficiency of shield cutter machines in subway tunnel constructions. This study develops a three-axis thermal-hydraulic-mechanical (THM) coupled dynamic impact system, which is integrated with a scaled shield cutter model to generate a unique dataset of stress wave propagation under multi-field coupling. A bidirectional long short-term memory (LSTM) neural network with an attention mechanism is proposed to establish a nonlinear time mapping relationship between stress waves. The determination coefficient ( R 2 ) exceeds 0.97, the symmetric mean absolute percentage error ( sMAPE ) is less than 10 %, and the average relative uncertainty ( ARU ) is less than 4 %, confirming its high accuracy and reliability. Based on predictions and test results, the new quantitative laws for the transient dynamics of limestone are further revealed. The results reveal that loading conditions do not alter the correlation trend between loading rate and dynamic parameters but significantly influence the degree of the loading rate's effect. Axial pressure dominates energy absorption with an energy contribution rate of 60 %. Confining pressure amplified the sensitivity of loading rate by 170 %, while THM coupling suppressed the dynamic deformation modulus by over 30 %. The accurate prediction of the nonlinear response of stress waves in limestone by the LSTM neural network establishes the connection between transient dynamic observation and rock fragmentation physics mechanism, providing support for quantifying energy absorption and conversion in the rock fragmentation process, and providing key strategies for optimizing shield machine performance in extreme environments.}, archive = {J_EAAI}, author = {Baoping Zou and Kejian Xia and Jingyuan Ma and Xu Long}, doi = {10.1016/j.engappai.2025.112554}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112554}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Deep learning driven prediction of dynamic stress-strain response in limestone: Insights into transient mechanical behavior under complex loadings for shield tunneling}, volume = {162}, year = {2025}, }
• (2025). A continuous verification mechanism for ensuring client data forgetfulness in federated unlearning. EAAI, 162, 112553. (www)

  @article{ , abstract = {In Federated Learning (FL), it is sometimes necessary to unlearn client data through Federated Unlearning (FU) methods, which help protect user privacy and recover from data poisoning. One critical task is to check the consistency of FU methods and verify if certain clients’ data has been effectively unlearned. However, none of the current FU verification methods can be performed on clients who opt out of the FL process, failing to meet the universal demand in FL, such as the user’s “right to be forgotten” (RTBF). Specifically, after clients leave the FL cooperation, they can no longer verify whether the FL model unlearns their data as the FL continues training for several rounds. To address this, we introduce a continuous verification mechanism for FL clients called Backdoor Attack-based Forgetting Verification (BAFV). The BAFV method embeds a persistent mark for clients who propose to leave, allowing them to verify FU long after leaving the FL cooperation. Extensive experiments across diverse FU environments and datasets demonstrate that our method maintains the model’s accuracy and provides clients with a continuous verification mechanism to ensure their data is unlearned. Our combinatorial marking strategy and gradient-amplified persistence mechanism represent significant advancements beyond existing verification schemes. Our code of BAFV is publicly available at: https://github.com/FuduXing/newBAFV.git .}, archive = {J_EAAI}, author = {Fudu Xing and Jun Liu and Shanshan Chen and Tianlong Yu and Yang Yang}, doi = {10.1016/j.engappai.2025.112553}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112553}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A continuous verification mechanism for ensuring client data forgetfulness in federated unlearning}, volume = {162}, year = {2025}, }
• (2025). Trajectory planning of redundant parallel mechanism considering motion accuracy based on reinforcement learning. EAAI, 162, 112552. (www)

  @article{ , abstract = {The motion accuracy of the trajectory directly affects the reliability of parallel mechanisms in precision tasks such as micro-assembly. Thus, this paper investigates trajectory planning considering motion accuracy, and uses a (6+3)-degrees of freedom (DOF) kinematically redundant parallel mechanism (KRPM) as a case study. First, the kinematics of KRPM are analyzed, and an error model incorporating dimensional errors, driving input errors, and joint clearances is established. Then, based on the error model, the aggregate sensitivity index (ASI) and comprehensive error sensitivity (CES) are introduced to study the error properties of KRPM, along with a universal analysis process. Subsequently, reinforcement learning (RL) utilizing the twin delayed deep deterministic policy gradient (TD3) algorithm is employed to the trajectory planning of KRPM considering motion accuracy. Finally, numerical simulation is carried out based on three cases to verify the effectiveness of the proposed method, and experimental results further demonstrate its practical applicability.}, archive = {J_EAAI}, author = {Chen-dong Zeng and Zhi-cheng Qiu and Fen-hua Zhang and Xian-min Zhang}, doi = {10.1016/j.engappai.2025.112552}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112552}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Trajectory planning of redundant parallel mechanism considering motion accuracy based on reinforcement learning}, volume = {162}, year = {2025}, }
• (2025). Deep reinforcement learning-tuning hierarchical vehicle trajectory tracking framework based on improved kinematic model predictive control. EAAI, 162, 112551. (www)

  @article{ , abstract = {Trajectory tracking is crucial in vehicle control, as it ensures stable driving along a predefined path. This paper proposes a deep reinforcement learning (DRL)-tuning hierarchical trajectory tracking framework, aiming to improve the tracking accuracy of traditional kinematic model predictive control (MPC) methods in uncertain environments. The proposed hierarchical vehicle trajectory tracking framework consists of two layers: the upper layer serves as a compensation layer for the vehicle side-slip angle (VSA), designed using bidirectional long short-term memory (BiLSTM); while the lower layer is the trajectory tracking layer, in which the improved kinematic MPC is enhanced by integrating the twin delayed deep deterministic policy gradient (TD3) algorithm with an external attention (EA) mechanism. The contribution in artificial intelligence is improving the TD3 algorithm with the EA mechanism, enhancing its ability to capture contextual information and improve adaptability. The contribution in engineering applications is implementing the EA-TD3-tuned hierarchical kinematic MPC framework in the field of vehicle trajectory tracking. With 95 % confidence, compared to traditional kinematic MPC controller, the proposed hierarchical vehicle trajectory tracking framework reduces the average lateral error by 33 % (confidence interval, CI: [0.0616, 0.0850]), the average heading angle error by 34 % (CI: [0.01173, 0.0157]), the average yaw rate variation by 31 % (CI: [0.0244, 0.0346]), and the average front wheel steering angle variation by 28 % (CI: [0.0244, 0.0346]).}, archive = {J_EAAI}, author = {Jiankun Peng and Xingyan Liu and Changcheng Wu and Dawei Pi and Jiaxuan Zhou}, doi = {10.1016/j.engappai.2025.112551}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112551}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Deep reinforcement learning-tuning hierarchical vehicle trajectory tracking framework based on improved kinematic model predictive control}, volume = {162}, year = {2025}, }
• (2025). A novel decomposition-prediction hybrid model improved by dual-channel cross-attention mechanism for short-term wind speed prediction. EAAI, 162, 112550. (www)

  @article{ , abstract = {Accurate prediction of wind energy is crucial for ensuring the safe operation and stability of power systems. To improve the accuracy and robustness of wind speed (WS) forecasting, a novel hybrid method based on mixture of experts (MoE), Transformer, temporal convolution network (TCN), multi-head attention (MA) mechanism, and improved by dual-channel cross-attention mechanism (DCCAM) is proposed. The wind speed data is decomposed by MoE into seasonal and trend components. The trend features are directly captured through a multi-head attention mechanism. An innovative Transformer-TCN framework associated with DCCAM is designed to handle the seasonal component, wherein the Transformer-TCN can make full use of long dependency modeling of Transformer and the local feature extraction of TCN, and DCCAM enables the information interchange and feature fusion, therefore realizing complementary advantages. Based on the proposed model, a series of experiments are conducted on multiple datasets. Ablation experiments confirm the effectiveness of the model and the role of each module in performance improvement. Experiments on seasonal datasets, including spring, summer, autumn, and winter, show that the proposed model can effectively adapt to variations in amplitude and volatility of wind speed sequences under different climatic conditions. Comparative experiments with six advanced hybrid models including decomposition and prediction modules, further demonstrate the superiority and stability of the proposed model.}, archive = {J_EAAI}, author = {Donghan Geng and Haiteng Cui and Leisen Lv and Jiamin Guo}, doi = {10.1016/j.engappai.2025.112550}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112550}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel decomposition-prediction hybrid model improved by dual-channel cross-attention mechanism for short-term wind speed prediction}, volume = {162}, year = {2025}, }
• (2025). Analysing sustainable industrial wastewater treatment technologies using circular fermatean fuzzy multi-attribute group decision making with decision experts’ confidence levels. EAAI, 162, 112549. (www)

  @article{ , abstract = {The evaluation of sustainable industrial wastewater treatment techniques is vital for preserving environmental integrity and protecting public health. Industrial processes often generate wastewater containing toxic compounds like metal contaminants, toxic chemicals, and complex organic compounds, posing serious risks to ecosystems and human well-being. This study proposes a robust multi-attribute group decision-making framework to assess five treatment alternatives across twelve sub-criteria. The evaluation model employs circular Fermatean fuzzy numbers to capture uncertainty and imprecision in expert judgements. To enhance the accuracy of data aggregation, four novel Schweizer–Sklar weighted aggregation operators are introduced, integrating varying confidence levels. Criteria weights are determined through a hybrid approach combining the subjective Ranking Comparison (RANCOM) method and the objective Opinion Weight Criteria Method (OWCM), ensuring balanced prioritization. Alternatives are ranked using the Alternative Ranking Order Method Accounting for Two-Step Normalization (AROMAN), a novel technique for improved discrimination and consistency. Results reveal that the membrane bioreactor as the most sustainable treatment with score 0.821, outperforming activated sludge process, by 25.34%. The lowest-ranked option is chemical coagulation and flocculation, scoring 0.622. Sensitivity analysis, performed by varying three parameters, shows reasonable stability with an average correlation value of 0.71. Comparative analysis shows an average Spearman’s rank correlation of 0.86, confirming reliability. The study recommends prioritizing membrane bioreactor adoption in industrial treatment plants to enhance efficiency and water reuse. By promoting effective treatment solutions, the study contributes to reducing industrial pollution, enhancing water reuse, and advancing environmental sustainability.}, archive = {J_EAAI}, author = {Prayosi Chatterjee and Mijanur Rahaman Seikh}, doi = {10.1016/j.engappai.2025.112549}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112549}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Analysing sustainable industrial wastewater treatment technologies using circular fermatean fuzzy multi-attribute group decision making with decision experts’ confidence levels}, volume = {162}, year = {2025}, }
• (2025). A cost-effective nash-based allocation method for task distribution of multiple robots in distributed robotic networks. EAAI, 162, 112548. (www)

  @article{ , abstract = {Efficiency is paramount in distributed robotic networks (DRNs), where multiple autonomous robots collaborate to perform complex tasks. In this context, the identification of the most efficient path for robots, considering both distance and cost, plays a crucial role in the development of an effective matching algorithm for addressing multirobot task allocation (MRTA) challenges. The study introduces a new cost-efficient Nash-based game framework for task allocation in a distributed robotic network. The proposed model relies on a decentralized decision-making strategy, where each robot selects a single task that optimizes its execution time at a constant speed, thereby maximizing energy harvesting and minimizing energy consumption. In this context, each robot optimizes its choices for individual benefit while also considering the collective welfare, achieving the Nash equilibrium as a nearly optimal allocation strategy in DRNs. The proposed model is tested on various MRTA scenarios involving five robots, seven robots, ten robots, fifteen robots, and twenty robots with the same number of tasks. The proposed Nash-based decentralized model outperforms the Hungarian method by significantly reducing computational costs and complexity to O ( N ) , making it more efficient for large-scale problems.}, archive = {J_EAAI}, author = {Ali Hamidoğlu and Omer Melih Gul and Seifedine Nimer Kadry and Chiranjibe Jana and Ali Elghirani and Gokhan Koray Gultekin}, doi = {10.1016/j.engappai.2025.112548}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112548}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A cost-effective nash-based allocation method for task distribution of multiple robots in distributed robotic networks}, volume = {162}, year = {2025}, }
• (2025). A digital twin-assisted algorithm for diagnosis of permanent magnet synchronous generator interturn short circuit fault and converter open circuit fault in wind power systems using pearson correlation coefficient. EAAI, 162, 112547. (www)

  @article{ , abstract = {Interturn short-circuit faults (ISCFs) in permanent magnet synchronous generators (PMSGs) and open-circuit faults (OCFs) in the machine-side converters represent two critical reliability challenges in wind power systems. Conventional fault diagnosis approaches typically rely on dedicated models for each fault type for each fault type, leading to excessive system complexity and suboptimal computational efficiency. To overcome these limitations, this paper proposes a novel unified digital twin-assisted framework capable of simultaneous diagnosis of both PMSG ISCFs and converter OCFs within a single integrated architecture. The high-fidelity digital twin model based on one-dimensional convolutional neural networks is established to generate real-time reference value of current space vector (SV) for online fault detection, while Pearson correlation coefficient analysis enables accurate differentiation between ISCF and OCF. For ISCFs, the fault severity assessment is performed based on the deviation between reference and measured current SV, with the faulty phase identified using phase current root mean square (RMS) values. In the case of converter OCFs, the proposed method introduces a dual-stage identification process: single and dual insulated-gate bipolar transistor (IGBT) open faults are differentiated through severity estimation analysis, and the faulty IGBT is identified by evaluating the effective current interval ratio (ECIR) and normalized current average (NCA). The experimental results validate the effectiveness of the proposed method, and comparative analysis further demonstrates its superior performance in terms of parameter dependency and diagnostic efficacy.}, archive = {J_EAAI}, author = {Bin Sun and Ying Zhu and Zhinong Wei}, doi = {10.1016/j.engappai.2025.112547}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112547}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A digital twin-assisted algorithm for diagnosis of permanent magnet synchronous generator interturn short circuit fault and converter open circuit fault in wind power systems using pearson correlation coefficient}, volume = {162}, year = {2025}, }
• (2025). A lightweight self-attention metric network for bird species recognition in intelligent bird repellent equipment. EAAI, 162, 112546. (www)

  @article{ , abstract = {Bird damages to power transmission lines pose significant operational risks, and intelligent bird repellent equipment (IBRE) requires accurate species recognition for effective long-term repellent. We propose a novel lightweight self-attention metric network (LSAM-Net) for few-shot bird species recognition in the vicinity of power transmission lines, aiming to enhance the performance of IBRE. LSAM-Net integrates a simple attention mechanism (SimAM) to emphasize critical spatial and channel features, thereby enhancing the extraction of key semantic information from bird images. Additionally, a self-correlation representation (SCR) module is employed to capture local structural patterns, effectively mitigating the impact of pseudo-features and improving the network’s capacity to learn discriminative representations. To promote the utilization of local discriminative information in few-shot classification, LSAM-Net leverages earth mover’s distance (EMD) to compute structural similarity between images. For efficient deployment, we apply knowledge distillation to further reduce model complexity. Extensive experiments conducted on Bird-65, CUB200, 2011, miniImageNet, and Fewshot-CIFAR100 demonstrate that LSAM-Net achieves superior performance compared to state-of-the-art methods, while maintaining a compact architecture. On the Bird-65 and CUB200-2011 datasets, LSAM-Net requires only 4.75 and 1.18 giga floating-point operations (GFLOPs), and achieves inference speed improvements of 52.9 % and 48.9 %, respectively, over the self-attention metric network (SAM-Net). Further optimization with TensorRT yields additional reductions in inference time by 43.6 ms and 53.7 ms, respectively. These improvements significantly support species-specific repellent strategies, thereby enhancing the long-term effectiveness of IBRE systems.}, archive = {J_EAAI}, author = {Jiangjian Xie and Shanshan Xie and Baican Li and Yujie Zhong and Chunhe Hu and Junguo Zhang and Björn W. Schuller}, doi = {10.1016/j.engappai.2025.112546}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112546}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A lightweight self-attention metric network for bird species recognition in intelligent bird repellent equipment}, volume = {162}, year = {2025}, }
• (2025). A multimodal multi-scale fusion network for leak detection in marine piping systems. EAAI, 162, 112545. (www)

  @article{ , abstract = {Marine system monitoring data inherently exhibit multimodal characteristics, making artificial intelligence-driven correlation and fusion essential for improving fault feature recognition. However, existing intelligent diagnosis methods mostly focus on feature fusion within homogeneous data types, such as fusing multiple time-series signals or multiple image sets, while systematic exploration of joint representation learning across heterogeneous dimensions remains under-explored. This limitation constrains the recognition capability for complex failure modes. Meanwhile, the inherent differences in physical meanings and representations of multimodal data pose significant challenges in constructing effective correlations, often limiting the performance of mainstream machine learning based fault diagnosis approaches. The proposed method enhances the fault diagnosis capability of mainstream approaches through the fusion of multi-sensor data and visual data, with its core innovation residing in a multimodal fusion framework leveraging attention mechanisms to effectively integrate cross-dimensional representations of multivariate time-series data and imaging data. Compared to existing multimodal transformer techniques, this dual-strategy architecture enables the model to simultaneously capture shared systemic behaviors and modality-unique signatures, substantially elevating diagnosis precision. Experimental validation on real-world leak detection datasets demonstrates that the proposed model achieves F1-scores consistently surpassing 90 % across diverse marine monitoring scenarios, with quantitative evaluations further confirming its superior performance over conventional multivariate time-series diagnosis methods in establishing multimodal correlations, conclusively validating both technical excellence and engineering practicability.}, archive = {J_EAAI}, author = {Peng Zhang and Chaozhe Li and Shitao Peng and Bomu Tian and Si Luo and Yuewen Zhang and Taili Du}, doi = {10.1016/j.engappai.2025.112545}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112545}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A multimodal multi-scale fusion network for leak detection in marine piping systems}, volume = {162}, year = {2025}, }
• (2025). A unified rotating machinery health management framework leveraging large language models for diverse components, conditions, and tasks. EAAI, 162, 112544. (www)

  @article{ , abstract = {This study introduces the Rotating Machinery Large Language Model (RotLLM), a unified framework for rotating machinery health management that integrates deep learning with large language models (LLMs) to address diverse operational conditions, components, and health management tasks. RotLLM employs a novel Spectral Folding Network (SFN) to transform vibration spectrum into a unified feature space that preserves essential health state information. A dedicated projection layer then maps these features into the semantic domain of an LLM. The framework is trained using a three-stage strategy: first, pre-training the encoder on the Large-scale Multimodal Rotating Machinery (LMR) dataset, which comprises 237,298 vibration samples collected under hundreds of operating conditions; second, initializing the projection layer with textual health state labels; and finally, fine-tuning using parameter-efficient Low-Rank Adaptation (LoRA) with high-quality corpus for various health management tasks. Experimental evaluations demonstrate that RotLLM achieves state-of-the-art performance in fault classification, maintains strong robustness under noisy conditions, and delivers rapid multi-task inference with minimal computational overhead. The framework consistently outperforms conventional methods, enabling efficient, accurate, and context-aware health management for rotating machinery across diverse conditions and tasks. The dataset and source code are open-sourced ( https://github.com/SIA-IDE/RotLLM ), fostering collaboration, reproducibility, and broader adoption in industrial prognostics research.}, archive = {J_EAAI}, author = {Haotian Peng and Jie Gao and Jiawei Liu and Jinsong Du and Wei Wang}, doi = {10.1016/j.engappai.2025.112544}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112544}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A unified rotating machinery health management framework leveraging large language models for diverse components, conditions, and tasks}, volume = {162}, year = {2025}, }
• (2025). A hybrid neural network model for shale gas production prediction considering production plans and produced water. EAAI, 162, 112543. (www)

  @article{ , abstract = {Recurrent neural networks have been widely applied to shale gas production prediction. However, current literature has two major flaws. Firstly, the delay issue can be observed in single-step prediction. Secondly, models that can be directly applied to newly developed wells are underresearched. This study presents a hybrid neural network combining fully connected (Dense) layers and long short-term memory (LSTM) layers to solve the two problems. In the proposed Dense-LSTM model, parameters regarding produced water and production plans are fed into the Dense layers while historical data is fed into the LSTM layers. The bottom-hole total flow rate converted from ground gas and water rates using volume factors is also included as an auxiliary parameter. The production plans made from the feature engineering can preserve the key information from shut-in periods while keeping a continuous prediction. The performance of the proposed model is demonstrated through ablation experiments and the comparison with popular decline curve models. For long-term prediction with window size w = 14 days, the proposed model’s mean cumulative error is 40.26% of that of vanilla LSTM at the end of the 3-year-long prediction interval. For window size w ′ = 100 days, the proposed model’s mean cumulative error is 77.93% of that of vanilla LSTM and 29.71% of that of the classic Arps model. The workflow of this study also sheds light on the construction of a universal prediction model for shale gas wells from different gas fields.}, archive = {J_EAAI}, author = {Yilun Dong and Youzhi Hao and Detang Lu}, doi = {10.1016/j.engappai.2025.112543}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112543}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A hybrid neural network model for shale gas production prediction considering production plans and produced water}, volume = {162}, year = {2025}, }
• (2025). A novel multi-source heterogeneous data fusion based fault diagnosis framework for manufacturing processes. EAAI, 162, 112542. (www)

  @article{ , abstract = {Fault diagnosis technologies are important means to ensure the production operation safety and product quality stability for manufacturing processes. After a fault occurs in the manufacturing processes, it may be characterized by high-frequency and high-dimensional structured time series data anomalies such as sensor data, or by unstructured data anomalies such as images. Traditionally, single structured sensor data is often used for constructing diagnosis models, the fault characteristics may not be adequately characterized, thus affecting the diagnosis performance. Therefore, in this paper, in order to make full use of multi-source data and obtain more comprehensive and accurate diagnosis results, a new multi-source heterogeneous data fusion based fault diagnosis framework is designed for manufacturing processes. Specifically, to solve the problem that the important information is ignored during data level fusion of multi-source data, an adaptive weight multi-source data fusion method is proposed. Furthermore, in response to the problem of feature redundancy in feature level fusion of heterogeneous data, a feature differentiation extraction and heterogeneous feature fusion method is proposed, of which a feature source discriminator is constructed for enhancing the complementarity of the extracted heterogeneous features, and feature concatenation is performed to improve the feature expression ability. Finally, the effectiveness and feasibility of the proposed framework is verified on actual datasets from the hot rolling process and the Tennessee Eastman process. Experimental results show that the proposed framework is both effective and feasible in fault diagnosis with multi-source heterogeneous data.}, archive = {J_EAAI}, author = {Liang Ma and Qikai Yang and Orestes Llanes-Santiago and Kaixiang Peng}, doi = {10.1016/j.engappai.2025.112542}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112542}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel multi-source heterogeneous data fusion based fault diagnosis framework for manufacturing processes}, volume = {162}, year = {2025}, }
• (2025). Reducing modal differences in zero-shot anomaly detection based on vision-language generation model. EAAI, 162, 112541. (www)

  @article{ , abstract = {Zero-shot anomaly detection methods based on vision-language model rely on alignment between image and text. These methods ignore the inherent differences between different modalities, which is unfavorable for improving the alignment between modalities. This paper reduces modal differences between image and text by using guiding vision feature and text feature from the pre-trained vision-language generation model. The vision perception text embedding is constructed by adding guiding vision feature to the weight shared text prompt. The text perception vision embedding is extracted by a vision text fusion module. The fusion module is designed to promote the visual modality to perceive the textual information locally. Anomaly regions are detected by cosine similarity between cross-modal perception embeddings. Zero-shot anomaly detection performance is evaluated on five publicly available industrial anomaly detection datasets, and a real-world dataset about automotive plastic parts. Experimental results show that the proposed method achieves highly competitive anomaly detection performance on multiple evaluation metrics.}, archive = {J_EAAI}, author = {Yanan Song and Weiming Shen and Baisong Pan and Quanhui Wu and Dawei Gu}, doi = {10.1016/j.engappai.2025.112541}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112541}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Reducing modal differences in zero-shot anomaly detection based on vision-language generation model}, volume = {162}, year = {2025}, }
• (2025). A novel short-term prediction method for distributed photovoltaic power generation considering extreme weather. EAAI, 162, 112540. (www)

  @article{ , abstract = {Distributed photovoltaic power plants are often impacted by various factors such as weather conditions and geographical locations, making it challenging to fully capture the spatial correlation characteristics among multiple photovoltaic plants. Furthermore, the failure to consider meteorological factors that influence photovoltaic output results in larger prediction errors during extreme weather events. To reduce prediction errors, this paper proposes a short-term photovoltaic forecasting method that considers meteorological factors, explores spatial correlations among photovoltaic plants, and captures temporal characteristics. Firstly, a Graph Attention Network is established to obtain spatial correlations between different plants while a Convolutional Neural Network is employed to extract feature information of meteorological factors. Then, the feature information from these two sources is integrated and input into a Long Short-Term Memory network, which is enhanced based on Spiking Neural P Systems to extract temporal characteristics of photovoltaic output and complete the prediction task. Finally, real-world power station datasets are utilized for validation and comparison with several typical photovoltaic prediction models. The results clearly show that the application of artificial intelligence in this proposed method can effectively improve the accuracy of distributed photovoltaic power forecasting, demonstrating the great potential of AI in the field of photovoltaic power prediction.}, archive = {J_EAAI}, author = {Xin Guan and Xiao Han and Jun Wang and Tao Wang}, doi = {10.1016/j.engappai.2025.112540}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112540}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel short-term prediction method for distributed photovoltaic power generation considering extreme weather}, volume = {162}, year = {2025}, }
• (2025). An innovative method of multi-view face frontalization based on receptive field-enhanced conditional generative adversarial network. EAAI, 162, 112539. (www)

  @article{ , abstract = {A series of theoretical and experimental investigations based on deep learning were conducted to enhance the accuracy and generalizability of face frontalization models. A series of theoretical investigations and experimental verifications based on deep learning are conducted to further enhance the face frontalization model's accuracy and generalizability. To address inadequate local feature extraction and the low realism in synthesized images, a receptive field-enhanced conditional generative adversarial network (RFC-GAN) is proposed to achieve multi-view face frontalization. RFC-GAN model integrates a novel configuration of multi-scale dilated convolutions in a multi-branch generator architecture to significantly expand the receptive field and improve feature extraction. The unique integration enhances the realism and detail of the generated images. Unlike conventional approaches that focus primarily on pixel-level accuracy, RFC-GAN introduces a perceptual loss component to enhance semantic content and structural integrity at the feature level. RFC-GAN has been experimentally validated on the Karolinska Directed Emotional Faces (KDEF) and Carnegie Mellon University Multiple Pose, Illumination, and Expression Face Database (CMU Multi-PIE). The generated facial expression images from RFC-GAN exhibit a higher degree of detailed texture reproduction in critical facial features such as the eyes, nose, and mouth. On the two datasets, the Peak Signal-to-Noise Ratio (PSNR) reaches 31.5185 for KDEF and 26.1851 for Multi-PIE, the Structural Similarity Index (SSIM) reaches 0.3604 for KDEF and 0.3965 for Multi-PIE, and the Learned Perceptual Image Patch Similarity (LPIPS) reaches 0.117 for KDEF and 0.408 for Multi-PIE, respectively. Compared to existing state-of-the-art methods, RFC-GAN exhibits marked improvements in these metrics, especially in detailed texture reproduction of critical facial features such as the eyes, nose, and mouth, establishing new benchmarks in face frontalization.}, archive = {J_EAAI}, author = {Yancong Zhou and Dongdong Wang}, doi = {10.1016/j.engappai.2025.112539}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112539}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An innovative method of multi-view face frontalization based on receptive field-enhanced conditional generative adversarial network}, volume = {162}, year = {2025}, }
• (2025). Enhanced air pollution spatiotemporal forecast model using frequency domain convolution and attention mechanism. EAAI, 162, 112538. (www)

  @article{ , abstract = {Accurate forecasting of air pollution, which is crucial for public health and environmental management, often faces challenges in effectively capturing the complex and intertwined spatiotemporal dynamics of pollutants. Existing models frequently struggle to simultaneously account for broad periodic spatiotemporal dependencies as well as fine-grained local temporal patterns. This paper presents a novel deep learning architecture, the Fourier Convolutional Graph Transformer (FCGformer), specifically designed to overcome these limitations. FCGformer distinctively features a dual-module approach: a Global Module that constructs an integrated spatiotemporal graph and leverages Fourier transforms with frequency domain convolution to extract long-range dependencies and crucial periodicities; and a Local Module that employs inverse temporal embedding and self-attention to meticulously capture nuanced, short-term temporal variations. The key contribution of this work lies in the synergistic integration that enables FCGformer to effectively model complex pollutant behaviors, providing a more comprehensive understanding of both global contexts and local details. Extensive experiments demonstrate that FCGformer significantly outperforms state-of-the-art benchmark models in prediction accuracy, offering a promising advancement for improved air quality management.}, archive = {J_EAAI}, author = {Haiwei Yang and Ru Yang and Ling Ding and Shiqiang Du and Maozhen Li and Bo Zhang}, doi = {10.1016/j.engappai.2025.112538}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112538}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhanced air pollution spatiotemporal forecast model using frequency domain convolution and attention mechanism}, volume = {162}, year = {2025}, }
• (2025). Gate-guided spatial-channel reconstruction network: An efficient lightweight framework for steel surface defect detection. EAAI, 162, 112537. (www)

  @article{ , abstract = {To address the limitations in You Only Look Once version 8 (YOLOv8) for steel surface defect detection, including insufficient generalization of image enhancement, constrained feature representation capability in core modules, and poor adaptability of the loss function to scale variations and sample imbalance, this paper proposes the Gate-guided Spatial-channel Reconstruction Network, an efficient and lightweight improved network. Contrast-Limited Adaptive Histogram Equalization (CLAHE) is introduced to enhance local image details and contrast while reducing noise impact. The Gating Block and the Spatial-channel Reconstruction Block are designed to replace the original C2f (cross-stage partial bottleneck with two convolutions) module in YOLOv8, thereby enhancing feature representation capability and efficiency. The loss function is optimized using Wise-IoU (WIoU) and Slide Loss (SlideLoss) to improve convergence and robustness. The proposed network was evaluated on the Northeastern University Surface Defect Detection (NEU-DET) dataset (200 × 200 pixels) and the Chinese Academy of Sciences Defect Detection (GC10-DET) dataset (2048 × 1000 pixels). It demonstrated high detection accuracy, achieving the mean Average Precision at 50 % (mAP50) of 84.7 % and 79.4 %, respectively. Furthermore, the network maintains low complexity with only 3.6 million parameters and achieves a high detection speed of up to 154 frames per second (FPS). The Gate-guided Spatial-channel Reconstruction Network effectively detects surface defects on hot-rolled steel, achieving state-of-the-art detection accuracy. It successfully meets the requirements for precise and real-time steel surface defect detection under resource-constrained industrial conditions.}, archive = {J_EAAI}, author = {Wei Zhang}, doi = {10.1016/j.engappai.2025.112537}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112537}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Gate-guided spatial-channel reconstruction network: An efficient lightweight framework for steel surface defect detection}, volume = {162}, year = {2025}, }
• (2025). Tensor product-fault diagnosis-transformer based wind turbine blade fault prediction method. EAAI, 162, 112535. (www)

  @article{ , abstract = {With the continuous iterative updating of wind turbine (WT) blade fault diagnosis (FD) technology, intelligent prediction methods based on supervisory control and data acquisition (SCADA) systems have gradually become advanced mainstream technology in the industry. However, despite the many advantages of SCADA data in fault prediction, its high-dimensional characteristics and highly unstable nature still pose significant challenges for practical applications. Accordingly, this study proposes an innovative WT blade fault prediction method based on tensor product dimensionality reduction and FD-Transformer (TP-FD-Transformer) methodology, which aims to effectively solve the problem of timely and accurate prediction of WT blade faults. The TP-FD-Transformer method combines the quantum dimensionality reduction technique with the FD-Transformer model to form a new framework for data processing and analysis. The TP-FD-Transformer method adopts the tensor product-relative position matrix composite dimensionality reduction technique, which effectively reduces the dimensionality and complexity of SCADA data while preserving its features. After data processing is completed, the TP-FD-Transformer method utilizes the FD-Transformer model for deep learning training. The FD-Transformer model has been improved for complex time series data and can effectively capture potential features in the data. The experiments under the open dataset show that the TP-FD-Transformer method demonstrates excellent prediction ability in the field of WT blade FD, with an accuracy rate of 93.65 %. The research findings verify that TP-FD-Transformer method provides a feasible solution for the intelligent diagnosis of WT blade faults, with broad application prospects and significant practical significance.}, archive = {J_EAAI}, author = {Linfei Yin and Yuhan Liu and Nannan Wang}, doi = {10.1016/j.engappai.2025.112535}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112535}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Tensor product-fault diagnosis-transformer based wind turbine blade fault prediction method}, volume = {162}, year = {2025}, }
• (2025). Hybrid physics-based and data-driven method for the rotor angle prediction. EAAI, 162, 112533. (www)

  @article{ , abstract = {Deep learning methods are widely employed for transient stability analysis in power systems. However, the prediction performance can be adversely affected by undesirable factors in the measured data. To alleviate the effect of the undesirable factors, a hybrid physics-based and data-driven prediction network of the rotor angle trajectory is proposed in this paper. The prediction model embeds the rotor equation to form a dynamic learning model that conforms to the actual physical law. The physical consistency of the prediction results is guaranteed. Meanwhile, a dynamic error derivative integral network incorporating the Runge–Kutta method is proposed to correct the final results. The accuracy of the prediction can be improved. Finally, it is tested in the IEEE 39-bus system and the East China Power Grid system. The test results show that the model significantly outperforms other comparative models. And the dependence on the quality of measured data can be alleviated effectively.}, archive = {J_EAAI}, author = {Lingzhe Zhang and Dong Huang and Huaiyuan Wang}, doi = {10.1016/j.engappai.2025.112533}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112533}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hybrid physics-based and data-driven method for the rotor angle prediction}, volume = {162}, year = {2025}, }
• (2025). Physics-informed machine learning for near real-time stress prediction on a structural component: Application for landing gears. EAAI, 162, 112532. (www)

  @article{ , abstract = {Lightweight design constitutes a pivotal research and development objective for next-generation landing gear systems. Nevertheless, achieving reduced weight while maintaining structural safety and reliability presents considerable challenges. The establishment of a digital twin (DT) for structural health monitoring (SHM) offers a promising approach to address these concerns across the design, testing, and operational lifecycle of landing gears. In this study, we develop a physics-informed neural network (PINN) model for near real-time stress prediction on the drag strut of a nose landing gear (NLG), specifically for an A320-type aircraft, serving as a foundational component of a DT system. The proposed PINN framework directly outputs displacement fields while deriving stresses as secondary quantities, effectively incorporating the fundamental equations of linear elasticity into the loss function. Displacement boundary conditions, informed by finite element method (FEM) simulations, are integrated as penalty terms to enhance trainability and physical consistency. The training dataset is constructed using load cases statistically representative of actual landing gear operations, with high-fidelity FEM providing corresponding displacement and stress references. The model demonstrates strong predictive accuracy, with relative errors between 5% and 7% compared to FEM results, and significantly outperforms both pure stress-output PINNs and conventional deep neural networks (DNNs). Moreover, the trained PINN achieves inference times within seconds under time-varying loads, highlighting its capability for near real-time stress monitoring. This work underscores the potential of physics-informed machine learning for enhancing DT-enabled SHM systems in safety-critical aerospace structures.}, archive = {J_EAAI}, author = {Zixuan Zhu and Yifan Zhao and Agusmian Partogi Ompusunggu}, doi = {10.1016/j.engappai.2025.112532}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112532}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Physics-informed machine learning for near real-time stress prediction on a structural component: Application for landing gears}, volume = {162}, year = {2025}, }
• (2025). Enhanced forest fire detection via dynamic multiscale fusion and contextual partial cross features. EAAI, 162, 112531. (www)

  @article{ , abstract = {Timely and accurate detection of forest fires, particularly in the early stages when smoke and small flames are present, is crucial for minimizing ecological damage and improving the effectiveness of emergency response. However, existing methods face challenges such as missing edge information, ineffective multi-scale feature fusion, and low accuracy when identifying small or distant targets in complex forest conditions. To address these issues, a novel detection framework is proposed, called the Dynamic Contextual Shallow Network (DCSNet). This framework enhances detection performance and real-time efficiency. The proposed method incorporates three key components: (1) the Contextual Partial Cross Feature Network (CPCFNet), which employs a reparameterized non-local attention mechanism and partial channel separation to strengthen contextual representation; (2) the Dynamic Multiscale Fusion Pyramid Network (DMFPN), which uses dynamic sampling and deformable convolution to fuse multi-scale features adaptively; and (3) the Shallow Feature Detection Layer (SFDL), which refines shallow features to improve the detection of small smoke and flame targets. Experimental evaluations on visible-light and infrared remote sensing datasets collected by unmanned aerial vehicles (UAVs) demonstrate the effectiveness of DCSNet. Specifically, DCSNet achieves an average mean average precision (mAP) at 50 % intersection over union (IoU) of 76.0 %, a frame rate of 283 frames per second (FPS), and an F1-score of 71.9 % on the visible-light dataset. On the infrared dataset, the framework achieves an mAP@50 of 77.5 %, an mAP@50:95 of 45.5 %, and an F1 score of 72.9 %. These results suggest that DCSNet provides high accuracy and robustness in the real-time detection of forest fires under diverse environmental conditions. The code and datasets are available at https://github.com/Lili-wang-del/DCSNet .}, archive = {J_EAAI}, author = {Lili Wang and Lei Guo and Haiyan Li and Bingbing He and Jundong Yang and Yaqun Huang}, doi = {10.1016/j.engappai.2025.112531}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112531}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhanced forest fire detection via dynamic multiscale fusion and contextual partial cross features}, volume = {162}, year = {2025}, }
• (2025). Enhanced targeted attacks on graph neural networks via average gradient and perturbation optimization. EAAI, 162, 112530. (www)

  @article{ , abstract = {Graph Neural Networks (GNNs) are vulnerable to adversarial attacks that cause performance degradation by adding small perturbations to the graph. Gradient-based attacks are among the most widely used methods and have demonstrated strong performance across various attack scenarios. However, most gradient attacks use greedy strategies to generate perturbations, which tend to fall into local optima, leading to underperformance of the attack. To address the above problem, we propose an attack (Average Gradient and Perturbation Optimization Attack, AGPOA) on GNNs, which consists of an average gradient calculation and a perturbation optimization module. In the average gradient calculation module, we compute the average of the gradient information over all moments to guide the attack to generate perturbed edges, which stabilizes the direction of the attack update and gets rid of undesirable local maxima. We use a perturbation optimization module to limit the attack budget and further improve performance. Furthermore, we demonstrate the theoretical superiority of AGPOA over traditional gradient-based attack methods through attack loss variance. The experimental results show that AGPOA improves the misclassification rate by 2%–8% compared to other state-of-the-art models in the node classification task.}, archive = {J_EAAI}, author = {Yang Chen and Bin Zhou and Haixing Zhao and Padarti Vijaya Kumar}, doi = {10.1016/j.engappai.2025.112530}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112530}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhanced targeted attacks on graph neural networks via average gradient and perturbation optimization}, volume = {162}, year = {2025}, }
• (2025). Model-free safe deep reinforcement learning for grid-to-vehicle management considering grid constraints and transformer thermal stress. EAAI, 162, 112529. (www)

  @article{ , abstract = {The increasing penetration of Electric Vehicles (EVs) presents challenges to the distribution grid, due to more volatile power profiles and higher peak demand. One key research question is how to accommodate EVs with limited-capacity grid equipment, such as transformers and lines. However, uncertainties from the EV side and the complexity of grid equipment models challenge the performance of the control strategies implemented. Moreover, the thermal loading of the transformer is often neglected. In this work, we propose a fully model-free, safe Deep Reinforcement Learning (DRL)- based grid-to-vehicle management strategy to avoid electric and thermal overloading of the transformer and power grid constraint violation. The management strategy is based on Projection-based Constraint Policy Optimization (PCPO) and takes only the observable information from the grid and vehicles. The target is to maximize energy delivery to the EV fleet while considering safe constraints, such as transformer thermal loading, voltage magnitude limits, and line loading limits. We compared the proposed strategy with conventional DRL and other safe DRL methods and investigated its robustness against higher ambient temperatures. The results show that the proposed strategy can deliver 92 % energy and reduce violations of the grid and transformers, while the other benchmarks deliver less than 80 %. The robustness test demonstrates that the proposed strategy is effective in various temperature. Moreover, the proposed strategy can effectively reduce at most 90 % of the transformer aging incurred by the thermal stress, compared with the uncontrolled charging.}, archive = {J_EAAI}, author = {Zhewei Zhang and Rémy Rigo-Mariani and Nouredine Hadjsaid and Yan Xu}, doi = {10.1016/j.engappai.2025.112529}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112529}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Model-free safe deep reinforcement learning for grid-to-vehicle management considering grid constraints and transformer thermal stress}, volume = {162}, year = {2025}, }
• (2025). Probability forecasting for multivariate urban water demand using temporal convolutional network based on quantile regression and parzen window. EAAI, 162, 112528. (www)

  @article{ , abstract = {Probability prediction can provide more abundant information about uncertainties in future water demand, which is gaining increasing attention in building economical and reliable water resource management plans. However, most existing literature on water demand prediction focus on provide deterministic point prediction results. To overcome this problem, a novel hybrid probability forecasting model based on quantile regression temporal convolutional network and Parzen window is proposed for the probability density forecast of multivariate urban water demand. Firstly, to address the complex coupling relationship between water demand and multiple influencing factors, a random forest-based feature selection method is employed to eliminate the redundant variables. Then, a discrete wavelet transform is deployed to decompose the original series into a variety of characteristic subseries to reduce fluctuations of the original water demand series. Secondly, a quantile regression-based temporal convolutional neural network is employed to obtain the conditional quantiles of future water demand. Moreover, a probability density prediction method based on Parzen window estimation is developed to further obtain the distribution information of prediction uncertainty. Finally, a real-world multivariate dataset from a water plant in Suzhou, China, is used for comparison experiments with state-of-the-art models. The comparison results show that the proposed model has achieved an average improvement of 15.4 % and 53.3 % in interval prediction and probability density prediction, respectively. It shows that the proposed model is a reliable prediction model that can assist policymakers to optimize the management of urban water demand.}, archive = {J_EAAI}, author = {Jun Guo and Qingya Meng and Baigang Du and Hui Sun}, doi = {10.1016/j.engappai.2025.112528}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112528}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Probability forecasting for multivariate urban water demand using temporal convolutional network based on quantile regression and parzen window}, volume = {162}, year = {2025}, }
• (2025). Complex T-spherical fuzzy yager prioritized weighted aggregation for prioritizing waste management strategies: A case study from delhi. EAAI, 162, 112527. (www)

  @article{ , abstract = {Efficient waste management is crucial for addressing urban challenges in densely populated areas like Delhi. This study is motivated by a key research gap: the need for an advanced Multi-Criteria Decision-Making (MCDM) framework capable of handling both two-dimensional uncertainty and the prioritized nature of criteria in such complex problems. Our primary contribution is a novel framework integrating the flexibility of Complex T-Spherical Fuzzy Sets (CT-SFS) with Yager’s prioritized aggregation. Unlike traditional T-SFS, which are limited to a one-dimensional representation, CT-SFS incorporates both amplitude and phase information for Membership Degree (MD), Neutral Degree (ND), and Non-membership Degree (NMD), offering a nuanced model for expert evaluations. The framework introduces two innovative operators: the Complex T-Spherical Fuzzy Yager Prioritized Weighted Average (CT-SFYPWA) and the Complex T-Spherical Fuzzy Yager Prioritized Weighted Geometric (CT-SFYPWG). These operators uniquely incorporate Yager’s prioritized aggregation, allowing decision-makers to assign hierarchical importance to critical criteria, which is vital for effective resource allocation in urban waste management. The framework’s practical value is demonstrated through a detailed case study prioritizing waste management strategies in Delhi. Rigorous numerical analysis, sensitivity tests, and comparative evaluations confirm the framework’s robustness, adaptability, and distinct advantages over existing methods. Applying this framework to Delhi, we found that a holistic, integrated waste management system is the most promising strategy, outperforming capital-intensive projects like Waste-to-Energy. Our work offers a powerful, structured methodology for cities to make more nuanced, forward-looking decisions and advances MCDM theory by integrating prioritized aggregation within the CT-SFS environment.}, archive = {J_EAAI}, author = {Fathima Banu M. and S. Solaiappan and Subramanian Petchimuthu and Abrar Hussain}, doi = {10.1016/j.engappai.2025.112527}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112527}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Complex T-spherical fuzzy yager prioritized weighted aggregation for prioritizing waste management strategies: A case study from delhi}, volume = {162}, year = {2025}, }
• (2025). Critical nodes detection for complex networks via knowledge-guided evolutionary framework. EAAI, 162, 112526. (www)

  @article{ , abstract = {The Critical Node Problem (CNP) focuses on identifying critical nodes within complex networks. These nodes play a crucial role in maintaining connectivity, and their removal impacts network performance. Among CNP variants, CNP-1a — which minimizes pairwise connectivity after removing a limited number of nodes — has attracted significant research attention due to its NP-hard nature and applications in diverse fields like epidemic control and infrastructure resilience. While state-of-the-art methods leverage memetic algorithms and variable populations, they fundamentally rely on random initialization that often converges to local optima. This limitation arises because traditional methods fail to capture higher-order topological dependencies. To address this gap, we propose K2GA, a knowledge-guided genetic algorithm initialized by a graph attention network (GAT). The GAT embeds networks into low-dimensional spaces, assigning topology-aware attention weights to nodes that guide population initialization. K2GA then employs a hybrid genetic algorithm with a local search process to identify an optimal set of critical nodes. The local search process utilizes a cut node-based greedy strategy. Experiments on 26 real-world networks demonstrate that K2GA outperforms state-of-the-art methods in terms of the best, median, and average objective values, establishing new upper bounds for minimization in eight cases. This work pioneers a GAT-guided evolutionary search framework, offering a novel paradigm for solving CNP.}, archive = {J_EAAI}, author = {Chanjuan Liu and Shike Ge and Zhihan Chen and Wenbin Pei and Enqiang Zhu and Hisao Ishibuchi}, doi = {10.1016/j.engappai.2025.112526}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112526}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Critical nodes detection for complex networks via knowledge-guided evolutionary framework}, volume = {162}, year = {2025}, }
• (2025). An efficient framework for general long-horizon time series forecasting with mamba and diffusion probabilistic models. EAAI, 162, 112525. (www)

  @article{ , abstract = {Time series forecasting plays an essential role in supporting critical decision-making processes in risk management and resource allocation in various fields, including finance, transportation, industrial systems, etc. Conventional models can effectively capture volatility and, are proficient in handling specific patterns, such as the AutoRegressive Integrated Moving Average model (ARIMA) and the Generalized AutoRegressive Conditional Heteroskedasticity model (GARCH). Nonetheless, these models meet many challenges, such as high dimensionality, non-stationarity, and nonlinearity inherent in real-world data. Although deep learning methodologies can provide better performance, they may still suffer from long-term errors and heightened computational expenses. A novel framework named Mamba Diffusion Probabilistic Models (MambaDiffTS) is proposed, which integrates Mamba’s state space model with a frequency-aware diffusion process grounded in Denoising Diffusion Probabilistic Models (DDPM). Mamba’s selective state transitions enable linear-time modeling of long-range dependencies; at the same time, frequency-aware spectral decomposition isolates trends and seasonality through Fourier regularization. Furthermore, the implementation of spectral energy-guided noise scheduling preserves temporal fidelity. Extensive experiments on diverse benchmarks-financial volatility, industrial IoT sensor data, and climate modeling-demonstrate MambaDiffTS’s superiority. Notably, on stock forecasting tasks, MambaDiffTS reduces Mean Squared Error (MSE) by approximately 18.6% compared to the best-performing baseline, and substantially outperforms diffusion models, all while maintaining linear computational complexity. The proposed MambaDiffTS facilitates scalable forecasting over extended horizons.}, archive = {J_EAAI}, author = {Wenjing Wang and Qilei Li and Ziwu Jiang and Deqian Fu and David Camacho}, doi = {10.1016/j.engappai.2025.112525}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112525}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An efficient framework for general long-horizon time series forecasting with mamba and diffusion probabilistic models}, volume = {162}, year = {2025}, }
• (2025). Selecting after sales provider of complex product based on game and matching framework. EAAI, 162, 112524. (www)

  @article{ , abstract = {As a strategic enabler of high-end manufacturing, the high-quality evolution of complex equipment is indispensable for any nation aspiring to industrial leadership. After sales service (AS) long relegated to a support function, which has emerged as a decisive determinant of product life-cycle value and, consequently, of this transformative journey. This study therefore investigates the technological innovation of AS for complex products through a Stackelberg game that captures the collaborative dynamics between an original equipment manufacturer (OEM) and an after-sales service provider (ASP). We derive the necessary and sufficient conditions under which an ASP finds participation economically viable, then embed these conditions into a multi-criteria matching framework that links ASP capabilities with spare-part requirements. Leveraging an entropy weighted DEMATEL (Decision-making Trial and Evaluation Laboratory) hybrid and we first quantify the causal salience of matching attributes and build a parsimonious evaluation index system. Next, by explicitly encoding bilateral attribute preferences, we formulate a two-sided matching model that identifies the Pareto-optimal ASP portfolio for any given product architecture. Finally, backward induction over the integrated game-matching structure yields a prescriptive tool that not only screens ASPs but also prescribes contractual levers to sustain long-term co-innovation. The proposed framework thus unifies strategic participation incentives with operational compatibility, offering OEMs a rigorous, implementable roadmap for selecting and governing after-sales partners in the era of servitized, high-stakes manufacturing.}, archive = {J_EAAI}, author = {Xin Huang and Xiaoyan Qi and Xiaojuan Xu}, doi = {10.1016/j.engappai.2025.112524}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112524}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Selecting after sales provider of complex product based on game and matching framework}, volume = {162}, year = {2025}, }
• (2025). PLDs-CNN-ridge-ELM: Interpretable lightweight waste classification framework. EAAI, 162, 112522. (www)

  @article{ , abstract = {The accelerating global population growth and expanding economic activities have resulted in a notable increase in waste generation, necessitating accurate and efficient waste classification systems for sustainable waste management. This research presents a novel two-stage waste classification model leveraging a Lightweight Parallel Depth-wise Separable Convolutional Neural Network (PLDs-CNN), combined with a Ridge Regression Extreme Learning Machine (Ridge-ELM) classifier, using waste images as input. The proposed system efficiently classifies waste into four primary categories (hazardous, household, recyclable, and residual) in the first stage and further refines the classification into twelve subcategories in the second stage. Featuring a lightweight architecture of nine layers and about 1.09 million parameters, the PLDs-CNN model achieves high accuracy with substantially reduced computational overhead, outperforming many deeper networks. In the four-class classification stage, the system achieves an average accuracy of 99 %, with precision, recall, F1-score, and receiver operating characteristics (ROC)-area under the curve (AUC) values of 97.25 ± 0.02 %, 96 ± 0.03 %, 96.5 ± 0.01 %, and 99.28 %, respectively. In the twelve-class classification, the model continues to deliver superior results, with 96 % accuracy and equally strong precision, recall, and F1-score metrics. The system is supported by a real-time hardware architecture, featuring a user-centric Graphical User Interface (GUI), a webcam-enabled conveyor belt sorting mechanism, and a 2-axis pan-tilt system for automated waste sorting. Additionally, the model's interpretability is significantly improved through the integration of Shapley Additive Explanations (SHAP), which provides important perspectives into the decision-making process, increasing transparency and trustworthiness in real-world applications. The proposed framework not only surpasses conventional methods in both accuracy and computational efficiency but also emphasizes sustainability by facilitating cost-effective and scalable waste management solutions aimed at promoting recycling and resource reuse.}, archive = {J_EAAI}, author = {Mansura Naznine and Md. Nahiduzzaman and Md. Jawadul Karim and Md. Faysal Ahamed and Abdus Salam and Mohamed Arselene Ayari and Amith Khandakar and Azad Ashraf and Mominul Ahsan and Julfikar Haider}, doi = {10.1016/j.engappai.2025.112522}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112522}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {PLDs-CNN-ridge-ELM: Interpretable lightweight waste classification framework}, volume = {162}, year = {2025}, }
• (2025). Interpretable interval prediction of dam displacement based on variational autoencoder and improved temporal fusion transformer considering solar radiation effects. EAAI, 162, 112520. (www)

  @article{ , abstract = {Ensuring the safety of dams is critical to maintaining national economic development and social stability, requiring the implementation of accurate displacement prediction methods for early detection of structural anomalies and effective risk mitigation. However, existing statistical models primarily focus on point predictions, failing to quantify the uncertainty in displacement variations, and often neglect the critical environmental factor of solar radiation. To address these limitations, this study proposes a novel interpretable interval prediction framework that integrates solar radiation factors into an advanced hydrostatic-temperature-time (AHTT) model. A variational autoencoder (VAE) is employed to extract robust latent features from a large volume of measured temperature data, effectively reducing temperature-related noise. Subsequently, an improved temporal fusion transformer method is introduced to probabilistic dam displacement prediction. This method uses an enhanced quantile loss function based on the Huber loss to generate both point and interval predictions that dynamically reflect the prediction uncertainty. In addition, an interpretable multi-head attention module is incorporated to quantify the contribution of each environmental factor. Hyperparameter tuning of the improved temporal fusion transformer is further optimized using Bayesian optimization based on the tree-structured Parzen estimator (TPE), which improves prediction accuracy. Engineering case studies validate that the proposed model not only achieves the highest point prediction accuracy, but also provides narrower prediction intervals with the best coverage width criterion. Ablation experiments and interpretability analyses further confirm the significant impact of solar radiation on dam displacement, providing valuable insights for the development of dam displacement prediction models and risk-informed decision making.}, archive = {J_EAAI}, author = {Taiqi Lu and Hao Gu and Chongshi Gu and Chenfei Shao and Yiming Wang and Dongyang Yuan}, doi = {10.1016/j.engappai.2025.112520}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112520}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Interpretable interval prediction of dam displacement based on variational autoencoder and improved temporal fusion transformer considering solar radiation effects}, volume = {162}, year = {2025}, }
• (2025). An undersampling method for software defect prediction based on hilbert curve mapping distance. EAAI, 162, 112519. (www)

  @article{ , abstract = {The class imbalance problem presents a significant challenge in software defect prediction. The undersampling method enhances prediction performance by eliminating non-defective instances, thereby enabling the model to focus more on defective instances. However, the effective selection of representative non-defective instances while preserving the overall data distribution remains a critical challenge. Inspired by the space-filling property of Hilbert curves, we propose the H ilbert C urve M apping D istance U ndersampling (HCMDU) method for software defect prediction. This method first maps instances to Hamming space to ensure that similar instances are positioned closer together in the space. Instance circular domains are then partitioned based on the Hamming distance between them, which facilitates the exploration of instance variability within a localized region. Finally, the Hilbert curve mapping distance is employed to further uncover the data distribution pattern within the instance circular domains. The experimental results demonstrate that HCMDU delivers outstanding performance across 16 randomly selected software defect datasets in both Random Forest (RF) and Classification and Regression Trees (CART). Moreover, the results are further corroborated by the Friedman ranking and Nemenyi post-hoc test, which indicate that HCMDU significantly improves the performance of software defect prediction.}, archive = {J_EAAI}, author = {Yu Tang and Ye Du and Ang Li and Ming-song Yang and Yan Xia}, doi = {10.1016/j.engappai.2025.112519}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112519}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An undersampling method for software defect prediction based on hilbert curve mapping distance}, volume = {162}, year = {2025}, }
• (2025). Unsupervised fault diagnosis method for rolling bearings based on federated universal domain adaptation. EAAI, 162, 112518. (www)

  @article{ , abstract = {To address the issues of low diagnostic model accuracy caused by non-sharing of rolling bearing private data, distribution differences, and label space discrepancies across multiple clients, as well as the challenges that certain clients face in obtaining labeled data, an unsupervised fault diagnosis method is proposed for rolling bearings based on federated universal domain adaptation (FUDA). First, privacy protection during the transmission process in federated learning is ensured by implementing random mapping at local clients. Second, the central server employs the proposed mixed radial basis kernel-maximum mean discrepancy (MR-MMD) method to further mitigate distributional disparities between the feature spaces of source and target clients. This achieves unsupervised features alignment between these features. Third, margin vectors are introduced to tackle label space disparities between source and target clients, enabling effective separation of unknown class samples in the dataset of the target client. Finally, a dynamic weighted loss fusion strategy is designed to adaptively optimize the weight ratios of different losses. This enhancement facilitates the learning efficiency of the model. Experimental validation on two datasets demonstrates that the proposed approach can achieve average accuracies of 95.6 % and 87.7 % for the respective datasets. Compared with other methods, it represents improvements of 6.5 % and 8.1 %, while training time is reduced by at least 27 %. These results validate the effectiveness of the proposed method.}, archive = {J_EAAI}, author = {Shouqiang Kang and Yulin Sun and Xinrui Li and Yujing Wang and Qingyan Wang and Xintao Liang}, doi = {10.1016/j.engappai.2025.112518}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112518}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Unsupervised fault diagnosis method for rolling bearings based on federated universal domain adaptation}, volume = {162}, year = {2025}, }
• (2025). A multi-scale feature extraction and fusion framework based on wavelet Kolmogorov–Arnold networks and parallel bi-directional gated recurrent units for electric load forecasting. EAAI, 162, 112517. (www)

  @article{ , abstract = {Short-term electric load forecasting remains challenged by the dual requirements of accuracy and robustness due to the combined effects of strong seasonality, multi-scale spikes, and stochastic disturbances. To address this, we propose a novel multi-scale forecasting framework, NP-WavKAN-Fusion, which integrates Neural Prophet for data decomposition and a Wavelet-based Kolmogorov–Arnold Network (WavKAN) with learnable wavelet kernels for multi-scale encoding. This fusion model utilizes a Bi-directional Gated Recurrent Unit (BiGRU) to capture long-term temporal dependencies and an adaptive feature fusion gate (AFF) to dynamically re-weight static and dynamic features for final load predictions. Extensive experiments on two public datasets from Australia and Morocco show that NP-WavKAN-Fusion consistently outperforms traditional models, reducing the mean absolute error by at least 30 %. For multi-step forecasting tasks, NP-WavKAN-Fusion maintains error inflation within 15 %, demonstrating superior performance compared to state-of-the-art long-sequence models such as Informer and PatchTST. The Diebold–Mariano test confirms that NP-WavKAN-Fusion yields statistically significant improvements, with 19 out of 20 comparisons showing lower errors. Ablation studies show that removing either the Neural Prophet component or the AFF significantly increases the forecasting error, validating the necessity of our layered denoising and fusion strategies. The proposed NP-WavKAN-Fusion framework demonstrates strong potential for real-world applications in electric load forecasting, offering robust performance under various temporal and non-stationary conditions.}, archive = {J_EAAI}, author = {Chunliang Mai and Lixin Zhang and Xuewei Chao and Xue Hu and Omar Behar}, doi = {10.1016/j.engappai.2025.112517}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112517}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A multi-scale feature extraction and fusion framework based on wavelet Kolmogorov–Arnold networks and parallel bi-directional gated recurrent units for electric load forecasting}, volume = {162}, year = {2025}, }
• (2025). Resilient kernel-based unsupervised multi-view feature selection via compact binary hashing. EAAI, 162, 112515. (www)

  @article{ , abstract = {Multi-view feature selection across diverse views identifying a compact subset of the most informative feature across various data views without relying on labeled information. While most of the solutions are limited to linear multi-view data or utilize weakly-supervised single-label learning to assist in feature selection, leading to the loss of valuable semantic information, especially when dealing with complex real-world multi-view datasets. To overcome these limitations, we introduce a novel Resilient Kernel-based Unsupervised Multi-view Feature Selection via compact Binary Hashing (RKUMBH), which aims to search a robust and consistent graph representation across views, leveraging binary hashing codes to guide feature selection. Specifically, we first standardize the dimensionality of multi-view data by using non-linear kernel mapping. Then, we explore consistent graph structures across different views by fusing individual similarity graph of each view under a self-representation guidance. Moreover, the low-rank constraints are used to preserve the primary structures and patterns embedding within the data, and an unsupervised hashing feature selection framework is conducted to generate reliable hashing codes across views. Additionally, we design a customized iterative optimization method to solve the unified model. Extensive experiments on six public multi-view datasets demonstrate that our proposed method obtains state-of-the-art results compared to existing works for both clustering and feature selection tasks.}, archive = {J_EAAI}, author = {Rongyao Hu and Mengmeng Zhan and Jiangzhang Gan and Li Li and Fei Ye and Tong Liu}, doi = {10.1016/j.engappai.2025.112515}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112515}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Resilient kernel-based unsupervised multi-view feature selection via compact binary hashing}, volume = {162}, year = {2025}, }
• (2025). Uncovering the geometry-dependent optical asymmetry of gold nanorods helical assemblies using artificial neural networks. EAAI, 162, 112513. (www)

  @article{ , abstract = {The optical asymmetry of gold nanorods (Au-NRs) helical assemblies is well-documented with a wide range of applications. Nevertheless, the geometry-dependent optical asymmetry within these assemblies has not been adequately explored and quantified. The present study proposes a novel approach to predict the optical asymmetry of Au-NRs helical assemblies based on geometric characteristics using artificial neural networks (ANN). The performance of the ANN termed 3 N H L 50 N N was significantly enhanced through the optimization of the hidden layer and node, resulting in an R 2 of the outcomes exceeding 0.998 and a reduction in computational time exceeding 99.99 %. In instances where the specific geometric characteristics are needed to attain a desired optical asymmetry, a retrieval of geometric characteristics of Au-NRs helical assemblies was additionally investigated using a traversing mechanism featured particle swarm optimization (PSO) algorithm. The results of the retrieval were obtained within 6 s and demonstrate a high degree of accuracy and reliability. The combination of the 3 N H L 50 N N and the PSO algorithm is capable of accurately predicting the optical asymmetry of Au-NRs helical assemblies and the retrieval of the geometry characteristics, thereby enabling the quantitative understanding of their overall geometry-dependent optical asymmetry.}, archive = {J_EAAI}, author = {Yang Liu and Yongguang Chen and Xiyang Wei and Jianhua Shang and Lina Zhao}, doi = {10.1016/j.engappai.2025.112513}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112513}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Uncovering the geometry-dependent optical asymmetry of gold nanorods helical assemblies using artificial neural networks}, volume = {162}, year = {2025}, }
• (2025). Detecting worker loss of balance events from point cloud sequence using unsupervised motion-pose learning. EAAI, 162, 112512. (www)

  @article{ , abstract = {Workers' loss of balance (LB), such as slip and trip, may lead to severe injuries and even fatalities. Existing methods for detecting LB typically rely on wearable sensors and focus on specific body parts. This study introduces a novel, non-contact approach utilizing light detection and ranging (LiDAR) technology to detect LB events. By capturing full-body point cloud data, the proposed method extracts both static pose and dynamic motion features across multiple body sections and detects LB events through unsupervised learning. The high-dimensional point cloud sequence is transformed into interpretable gait features, enabling effective unsupervised learning through sequence reconstruction. A two-stream network and fusion strategy are also developed to combine pose and motion features for final LB detection. Experiments with various LB events demonstrate the method's effectiveness, achieving an F1 score of 0.98 and a recall of 0.98. Our analysis reveals that integrating features from multiple body parts and the fusion of pose and motion information significantly enhances detection performance. This study offers a promising alternative to traditional methods, providing effective, non-intrusive monitoring of worker safety in dynamic construction environments.}, archive = {J_EAAI}, author = {Mingyu Zhang and Lei Wang and Yinong Hu and Shuai Han and Jiawen Zhang and Heng Li}, doi = {10.1016/j.engappai.2025.112512}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112512}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Detecting worker loss of balance events from point cloud sequence using unsupervised motion-pose learning}, volume = {162}, year = {2025}, }
• (2025). Human motion prediction using mixture-of-branch graph convolutional network. EAAI, 162, 112511. (www)

  @article{ , abstract = {Using the same spatio-temporal feature extraction network to predict multiple types of human motions pose a challenge for the prediction model to achieve optimal performance. To address this issue and achieve differentiated training, we propose a novel Mixture-of-Branch Graph Convolutional Network model which simultaneously inserts human motion sequences into a multi-branch human motion prediction module and a branch weight allocation module. When generating the final prediction sequence, weights are assigned to the prediction results of each branch. Mixture-of-Branch Graph Convolutional Network employs loss values to control competition rather than cooperation among branches, effectively addressing the issue of mutual influence between sequences during network training. To the best of our knowledge, this marks the inaugural utilization of a Mixture-of-Branch network in the realm of human motion prediction. To optimize the efficiency of the multi-branch model and reduce prediction complexity, we introduce a spatio-temporal feature extraction method for the human skeleton that accommodates Euclidean geometric transformations. This method liberates the Mixture-of-Branch Graph Convolutional Network from the constraints of additional branches, allowing it to handle similar motion sequences under varying degrees of translation or rotation, where feature matrices may exhibit significant differences. The proposal of Mixture-of-Branch Graph Convolutional Network and its related experiments represent our contribution to the Artificial Intelligence field, with significant potential value in engineering applications as well. Mixture-of-Branch Graph Convolutional Network is tested on the Human3.6M, Carnegie Mellon University Motion Capture, and Three-Dimensional Human Pose in the Wild datasets, achieving high performance. Particularly noteworthy is the 7% overall performance improvement in Mean Per Joints Position Error prediction on the Carnegie Mellon University Motion Capture dataset.}, archive = {J_EAAI}, author = {Xianshan Li and Ang Gao and Xingxing Ning and Fengda Zhao}, doi = {10.1016/j.engappai.2025.112511}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112511}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Human motion prediction using mixture-of-branch graph convolutional network}, volume = {162}, year = {2025}, }
• (2025). A hybrid multivariate normal boundary intersection approach with post-optimization assisted by mixture design of experiments. EAAI, 162, 112510. (www)

  @article{ , abstract = {This article presents a hybrid multiobjective optimization approach for identifying Pareto-optimal solutions by combining evaluation metrics. Using response surface models built from rotated factor scores, the algorithm analyzes the influence of weights on solutions through performance metrics, applying a weighted combination as a post-optimization strategy. The methodology introduces innovations such as the combination of independent functions, polynomial analysis to discover intermediate weights, and the use of prediction-based metrics. To illustrate application of the methodology, a case study was conducted on the turning process of tempered cylindrical steel bars, evaluating dimensions of reliability, quality, and economic performance. The best solution obtained included the following input variables: a cutting speed of 147.792 m per minute, a feed rate of 0.156 mm per revolution, and a depth of cut of 0.247 mm. The resulting output variables included a mean tool life of 46.316 min, mean time to failure of 47.164 min, a wear rate of 0.006 mm per minute, an average surface roughness of 0.746 μm, a total surface roughness of 3.406 μm, a process cost of 3.721 dollars, a return on investment of 0.187, and overall equipment effectiveness of 0.387. Comparisons were made with other optimization methods, revealing satisfactory performance based on key metrics. The methodology was also tested on benchmark functions to assess its robustness and adaptability to different scenarios. In addition, the method was implemented in an online quality monitoring system using the Random Forest machine learning algorithm, and results indicate that optimal conditions can be identified quickly and effectively.}, archive = {J_EAAI}, author = {Matheus Costa Pereira and Caio Tertuliano Ribeiro and Ronã Rinston Amaury Mendes and Paulo Henrique da Silva Campos and Anderson Paulo de Paiva}, doi = {10.1016/j.engappai.2025.112510}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112510}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A hybrid multivariate normal boundary intersection approach with post-optimization assisted by mixture design of experiments}, volume = {162}, year = {2025}, }
• (2025). Inverse design of particle shapes with target sphericity and packing fraction using variational autoencoders. EAAI, 162, 112509. (www)

  @article{ , abstract = {Sphericity and packing fraction are fundamental properties governing the behavior of granular materials in many engineering applications. Conventional methods for designing particles with these target properties usually suffer from limited accuracy, diversity, and interpretability due to complex relationships between particle shape and properties. To address this, we propose an inverse design framework based on deep learning. First, a rotation- and reflection-invariant variational autoencoder (VAE) parameterizes two-dimensional convex particle shapes into a low-dimensional latent space, enabling accurate reconstruction and capturing geometric interpretations such as sphericity and symmetry. Second, a conditional variational autoencoder (CVAE) facilitates inverse design by generating particle shapes corresponding to target sphericity or packing fraction, and also enables the coupling control of both properties. Trained on a dataset of over 1600 convex shapes, the framework demonstrates robustness and universality. The rotation- and reflection-invariant architecture consistently maps different orientations of the same shape to a unified representation, which enhances interpretability. The main contribution in artificial intelligence lies in developing invariant generative models that learn shape representations and enable property-driven shape generation. The engineering contribution is providing a precise and efficient tool for the inverse design of particle shapes with target properties, supporting the optimization of granular materials in engineering applications.}, archive = {J_EAAI}, author = {Yutong Qian and Shuixiang Li}, doi = {10.1016/j.engappai.2025.112509}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112509}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Inverse design of particle shapes with target sphericity and packing fraction using variational autoencoders}, volume = {162}, year = {2025}, }
• (2025). Three-way dynamic clustering algorithms based on generalized neighborhood relations in incomplete hybrid information systems with applications in medical decision-making. EAAI, 162, 112508. (www)

  @article{ , abstract = {In addressing clinical challenges related to chronic diseases, the effective use of medical data in decision-making is often hindered by issues such as incompleteness, heterogeneity, and the need for continuous updates. To cope with these challenges, this study introduces a three-way dynamic clustering strategy built upon generalized neighborhood relations, aiming to enhance clustering robustness, strengthen the model’s ability to manage uncertainty, and support adaptability to dynamically evolving data. First, generalized neighborhood relations are constructed in incomplete hybrid information systems. An evaluation function is defined from two perspectives: the number of similar attributes between objects and the distance between objects, thereby optimizing similarity measurement and accurately characterizing the data structure. Second, three-way decision rules are introduced to effectively handle uncertainty in objects while maintaining classification accuracy, thereby improving the interpretability and adaptability of the clustering model. Furthermore, to accommodate the dynamic nature of medical data, a dynamic incremental clustering method based on neighborhood information is proposed to ensure that newly added patient data can be efficiently integrated into existing clusters, enhancing model real-time performance and computational efficiency. Experiments conducted on real clinical data from Chronic kidney disease (CKD) patients validate the proposed method. The results demonstrate that, compared to existing clustering algorithms, the proposed method outperforms in terms of F1-score and Rand Index evaluation metrics. It also exhibits higher applicability in patient classification, core and boundary domain partitioning, and dynamic data processing, providing effective support for precision stratified management of chronic disease patients and intelligent medical decision-making.}, archive = {J_EAAI}, author = {Haoran Sun and Bingzhen Sun and Xixuan Zhao and Qiang Bao and Xiaoli Chu}, doi = {10.1016/j.engappai.2025.112508}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112508}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Three-way dynamic clustering algorithms based on generalized neighborhood relations in incomplete hybrid information systems with applications in medical decision-making}, volume = {162}, year = {2025}, }
• (2025). A three-stage segmentation framework for lung cancer lesion isolation in three-dimensional positron emission tomography images. EAAI, 162, 112507. (www)

  @article{ , abstract = {Background Positron emission tomography (PET) is a critical functional medical imaging modality for the early detection and diagnosis of cancers. PET imaging faces several challenges that hinder accurate interpretation including its inherently low spatial resolution, substantial variability in cancer lesions’ appearance, and difficulties distinguishing between the image background and benign lesions. Methods We propose a novel three-stage image segmentation framework to enhance the accuracy of lung cancer lesion identification and extraction from three-dimensional (3D) PET images. The first stage conducts a coarse segmentation using an encoder-decoder structure network to roughly position lesions. The second stage employs a multi-layer feature extraction network to learn the detailed characteristics of coarse segmentation results, mitigating false positives caused by localization inaccuracy. The last stage further refines the extracted features via dividing a sub-region of the lesion into foreground and background branches, reducing false positives caused by over-segmentation of edges. A novel lesion count loss function is introduced to guide the model to generate predictions during the training, ensuring that the predicted lesion counts align with the ground truth labels. Results The proposed method was evaluated on clinical 3D PET image datasets. Experimental results demonstrated a Dice Similarity Coefficient (DSC) of 85.35 %, Accuracy of 83.97 %, and Recall of 86.83 %. Compared to existing models applied to the same datasets, our method consistently achieved superior performance. Conclusion The proposed method significantly improves the segmentation performance of lung cancer lesions, implying that our method holds substantial potential for broader clinical application, even in low-resolution images.}, archive = {J_EAAI}, author = {Yusheng Wu and Qiang Lin and Jingjun Wei and Yongchun Cao and Zhengxing Man and Xiaodi Huang}, doi = {10.1016/j.engappai.2025.112507}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112507}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A three-stage segmentation framework for lung cancer lesion isolation in three-dimensional positron emission tomography images}, volume = {162}, year = {2025}, }
• (2025). Self-supervised visual assessment of railway track curvature via homography learning based on projective curvilinear geometry model. EAAI, 162, 112506. (www)

  @article{ , abstract = {Railway track curvature monitoring is crucial for ensuring operational safety and passenger comfort. As a robust complement to the single-point physical sensor approaches, vision-based methods have recently gained increasing adoption. However, existing approaches frequently neglect the systematic exploitation of railway ego-vision geometry in two critical aspects: (1) the rail-camera kinematic coupling that relates the rail appearance in camera’s view and the track curvature during curvilinear motion, and (2) the potential of self-supervised learning to overcome annotation scarcity in this domain. This geometric oversight limits their accuracy in real-world dynamic scenarios. To address these gaps, this study proposes a novel vision-based framework that systematically exploits the railway ego vision geometry. Our methodology comprises two key innovations: First, a projective curvilinear geometry model that mathematically relates the ground-planes-induced homography to actual track curvature, thereby establishing a mapping from curvature and its variation to rail imaging curves. Second, a self-supervised curvature prediction network trained using automatically generated labels from our geometric model, eliminating the need for manual curve annotations. The self-supervision is achieved through a cyclic consistency mechanism between predicted curvatures and reprojected image features. Experimental validation using real-world railway footage demonstrates significant improvements: Our method reduces the average root mean squared error by 23.31% compared to state-of-the-art vision-based curvature estimation methods. These results underscore the effectiveness of geometry-aware computer vision for railway geometry monitoring}, archive = {J_EAAI}, author = {Peng Tang and Zhibin Yu}, doi = {10.1016/j.engappai.2025.112506}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112506}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Self-supervised visual assessment of railway track curvature via homography learning based on projective curvilinear geometry model}, volume = {162}, year = {2025}, }
• (2025). Saliency and correlation learning for co-salient object detection. EAAI, 162, 112504. (www)

  @article{ , abstract = {Co-Salient object detection aims to identify common salient objects across a given group of images. However, accurately locating co-salient objects remains challenging due to the complexity of capturing the correlation representation of each group of images. To tackle this problem, we propose a saliency and correlation learning method for co-salient object detection. This method employs a saliency learning network and a correlation learning network to generate precise co-saliency maps of a group of images. Within the saliency learning network, a saliency feature grafting module is designed to refine object edges and achieve accurate detection of salient objects. Furthermore, the correlation learning network incorporates two modules, which are designed for extracting saliency correlation representation and deriving consensus correlation representation within a group of images, respectively. Guided by prior information obtained from saliency learning of images, our method significantly improves performance in co-salient object detection through correlation representation learning. Extensive experiments on all the latest benchmarks demonstrate that our method outperforms 11 state-of-the-art models, achieving a new level of technical excellence, with an average Structural Similarity Measure score of 0.845.}, archive = {J_EAAI}, author = {Ying Tong and Xiangfeng Luo and Liyan Ma and Shaorong Xie}, doi = {10.1016/j.engappai.2025.112504}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112504}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Saliency and correlation learning for co-salient object detection}, volume = {162}, year = {2025}, }
• (2025). Automated monitoring of mycobacterium population growth in time-lapse microscopy with deep learning pseudo-supervised algorithm. EAAI, 162, 112503. (www)

  @article{ , abstract = {The understanding of bacteria evolution through time and the analysis of their interaction with the medium is a main step in biomedical research. Bacteria cause in humans different infectious diseases, such as tuberculosis. Tuberculosis is one of the leading causes of death worldwide, caused by Mycobacterium tuberculosis ( Mtb ). Observation of Mycobacteria under a microscope provides essential information for disease-fighting. Nevertheless, Mtb presents a very particular cell division pattern characterized by a high entanglement in which the frontier between dividing cells are almost indistinguishable to the human eye, which makes the manual analysis of cultures a very challenging task, resulting in extremely long processing times. In this paper, we propose a novel approach to automatically detect bacterial cells and infer the growth rate and growth speed over a time-lapse microscopy (TLM) sequence. This method leverages a semi-supervised Deep Learning approach with a lightweight U-Net for efficient and fast processing. To reduce efforts of database construction, we deploy and exploit a mix of manually and synthetically annotated databases of two different classes of Mycobacterium , i.e. Mtb and Mycobacterium smegmatis ( Msm ). The experiments demonstrated the efficiency of the detection of both bacterial reproduction rate and bacterial death in Mycobacterium species, with the Phase-contrast (PhC) microscopy channels as a unique input. Reaching a segmentation accuracy of 96.3%, recall of 78.2%, and precision of 85.5% on Mtb detection for the model trained with a mix of manually and synthetically annotated databases. The experiments validate as well the synthetic label generation technique, which provides more conscience and accurate results than the manually segmented techniques. The mask generation workflow opens new opportunities for the microbial AI development field. The system implemented may change the paradigm in preclinical anti-mycobacteria drug development for since enables the adoption of TLM, a technology that provides extremely valuable information on drug efficacy but is seldom leveraged due to the complex image processing it involves.}, archive = {J_EAAI}, author = {Lara Visuña and Javier Garcia-Blas and Santiago Ferrer-Bazaga and Patricio Lopez-Exposito and Jesus Carretero}, doi = {10.1016/j.engappai.2025.112503}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112503}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Automated monitoring of mycobacterium population growth in time-lapse microscopy with deep learning pseudo-supervised algorithm}, volume = {162}, year = {2025}, }
• (2025). Reducing the estimation bias and variance in reinforcement learning via maxmean and aitken value iteration. EAAI, 162, 112502. (www)

  @article{ , abstract = {The value-based reinforcement leaning methods suffer from overestimation bias, because of the existence of max operator, resulting in suboptimal policies. Meanwhile, variance in value estimation will cause the instability of networks. Many algorithms have been presented to solve the mentioned, but these lack the theoretical analysis about the degree of estimation bias, and the trade-off between the estimation bias and variance. Motivated by the above, in this paper, we propose a novel method based on Maxmean and Aitken value iteration, named MMAVI. The Maxmean operation allows the average of multiple state–action values (Q values) to be used as the estimated target value to mitigate the bias and variance. The Aitken value iteration is used to update Q values and improve the convergence rate. Based on the proposed method, combined with Q-learning and deep Q-network, we design two novel algorithms to adapt to different environments. To understand the effect of MMAVI, we analyze it both theoretically and empirically. In theory, we derive the closed-form expressions of reducing bias and variance, and prove that the convergence rate of our proposed method is faster than the traditional methods with Bellman equation. In addition, the convergence of our algorithms is proved in a tabular setting. Finally, we demonstrate that our proposed algorithms outperform the state-of-the-art algorithms in several environments.}, archive = {J_EAAI}, author = {Fanghui Huang and Wenqi Han and Xiang Li and Xinyang Deng and Wen Jiang}, doi = {10.1016/j.engappai.2025.112502}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112502}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Reducing the estimation bias and variance in reinforcement learning via maxmean and aitken value iteration}, volume = {162}, year = {2025}, }
• (2025). Hybrid reinforcement learning in parameterized action space via fluctuates constraint. EAAI, 162, 112499. (www)

  @article{ , abstract = {Parameterized actions in Reinforcement Learning (RL) are composed of discrete-continuous hybrid action parameters, which are widely employed in game scenarios. However, previous works have often concentrated on the network structure of RL algorithms to solve hybrid actions, neglecting the impact of fluctuations in action parameters for agent move trajectory. Due to the coupling between discrete and continuous actions, instability in discrete actions influences the selection of corresponding continuous parameters, resulting in the agent deviating from the optimal move path. In this paper, we propose a parameterized RL approach based on parameter fluctuation restriction (PFR) to address this problem, called CP-DQN. Our method effectively mitigated value fluctuation in action parameters by constraining the action parameter between adjacent time steps. Additionally, we have incorporated a supervision module to optimize the entire training process. To quantify the superiority of our approach in minimizing trajectory deviations for agents, we propose an indicator to measure the influence of parameter fluctuations on performance in hybrid action space. Our method is evaluated in three environments with hybrid action spaces, and the experiments demonstrate the superiority of our method compared to existing approaches.}, archive = {J_EAAI}, author = {Chengcheng Yan and Shujie Chen and Jiawei Xu and Xuejie Wang and Zheng Peng}, doi = {10.1016/j.engappai.2025.112499}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112499}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hybrid reinforcement learning in parameterized action space via fluctuates constraint}, volume = {162}, year = {2025}, }
• (2025). MAVREN: A multilayered adaptive framework for deploying vision-language models on resource-constrained unmanned aerial vehicles for autonomous search and rescue. EAAI, 162, 112498. (www)

  @article{ , abstract = {Unmanned Aerial Vehicles (UAVs) have become indispensable in autonomous search and rescue (SAR) missions, where the ability to interpret complex visual scenes in real time is critical. When equipped with artificial intelligence (AI)-empowered Vision-Language Models (VLMs), UAVs can provide rich contextual insights, interpret their findings, and even suggest next steps, but their deployment on resource-constrained UAV platforms is vastly limited by high computational demands, energy constraints, and strict latency requirements. This paper introduces MAVREN, a m ultilayered a daptive scheduler for V LM execution in re source-constrained UAV n etworks for autonomous SAR operations. Evaluations conducted on NVIDIA Jetson Orin NX using state-of-the-art VLMs such as Large Language and Vision Assistant (LLaVA) 1.6 and Vision-Language Alignment (VILA) 7B demonstrate that MAVREN achieves up to 26.11% higher throughput , 23% lower energy consumption , 13.51% reduced latency , and a 7% gain in detection accuracy compared to baseline schedulers across indoor, outdoor, and multi-UAV SAR scenarios. This is achieved through the integration of a visual encoder for lightweight feature extraction, a block floating-point quantizer for precision-efficient representation, a bit-wise computation engine for fast arithmetic execution, and a branch-and-bound optimizer for dynamic central processing unit (CPU) scheduling. These tightly coupled components allow MAVREN to optimize the energy–latency–accuracy trade-off, making it a deployable solution for vision-language reasoning in real-world SAR missions. Our findings demonstrate MAVREN’s capability to deliver rapid, energy-efficient inference, advancing the deployment of computationally intensive VLMs on resource-constrained UAV platforms.}, archive = {J_EAAI}, author = {Md Tahmid Rashid and Md Jawad Siddique and Abdus Shaqur}, doi = {10.1016/j.engappai.2025.112498}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112498}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {MAVREN: A multilayered adaptive framework for deploying vision-language models on resource-constrained unmanned aerial vehicles for autonomous search and rescue}, volume = {162}, year = {2025}, }
• (2025). Rapid prediction of structural deflection based on explainable machine learning. EAAI, 162, 112497. (www)

  @article{ , abstract = {High-pressure arched air-rib membrane structures (HP-ARMS) exhibit lightweight portability and modular installation. This study proposes an explainable machine learning (ML) framework for the prediction of blast-induced HP-ARMS deflection. Firstly, compare the simulation results with the experimental data to verify the numerical method accuracy. Subsequently, a database containing 500 samples was established through numerical modeling. The input features include 6 structural parameters (air-rib pressure (X1), air-rib diameter (X2), air-rib thickness (X3), air-rib width (X4), air-rib height (X5), and air-rib bottom consolidation method (X6)) and 4 external load parameters (soil cover depth (X7), lateral explosion distance (X8), explosion equivalent (X9), and charge burial depth (X10)). Use Six ML algorithms—Light Gradient Boosting Machine (LightGBM), Random Forest (RF), Adaptive Boosting (AdaBoost), K-Nearest Neighbors (KNN), Convolutional Neural Network (CNN), and Gradient Boosting (GB)— and use four evaluation metrics to assess the accuracy of the ML model. Finally, the SHapley Additive exPlans (SHAP) method was used for interpretable analysis. The results showed that the LightGBM model had the best prediction performance. Compared with LightGBM, the Random-LightGBM (R-LightGBM) model significantly improved performance after hyperparameter optimization, with Root Mean Square Error (RMSE) reduced by 2.75 %, Mean Absolute Percentage Error (MAPE) reduced by 8.16 %, Mean Absolute Error (MAE) reduced by 5.88 %, and R-Squared (R 2 ) increased by 0.01. The SHAP method indicates that the explosion equivalent (X9) and charge burial depth (X10) are the most important parameters.}, archive = {J_EAAI}, author = {Yongtao Mi and Yushuai Zhang and Yicun Chen and Chenxi Sun and Huiqi Ren}, doi = {10.1016/j.engappai.2025.112497}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112497}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Rapid prediction of structural deflection based on explainable machine learning}, volume = {162}, year = {2025}, }
• (2025). A latent-coupled neural network for multiphysics long-term forecasting in reactor transients using sparse observations. EAAI, 162, 112496. (www)

  @article{ , abstract = {Complex dynamical systems in safety-critical applications like nuclear reactors involve strongly coupled physical fields evolving over space and time. Accurate prediction of these fields is vital for safety monitoring but is challenged by limited sensor placement and unobservable variables ( e.g. , xenon and iodine concentrations). This paper proposes the S parse observation to H igh-dimensional coupled physical field P rediction Network (SHPNet), a deep learning framework that predicts and reconstructs multiple physical fields directly from sparse observations.SHPNet combines a three-branch autoencoder to extract shared latent representations with a neural operator that models temporal dynamics in latent space, enabling efficient long-term forecasting. Evaluated on H ua-long P ressurized R eactor (HPR1000) under varying power and burnup conditions, SHPNet outperforms traditional frameworks and end-to-end model , achieving higher accuracy, robustness to observation sparsity, and effective reconstruction of unobservable fields. These results demonstrate SHPNet’s potential as a practical tool for real-time monitoring of complex coupled systems.}, archive = {J_EAAI}, author = {Yu-Yan Xu and Jun Luo and Deng Pan and Wei Lu and Ting Liu and Guanghui Yuan and Minxiao Zhong and Qing Li and Helin Gong}, doi = {10.1016/j.engappai.2025.112496}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112496}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A latent-coupled neural network for multiphysics long-term forecasting in reactor transients using sparse observations}, volume = {162}, year = {2025}, }
• (2025). ESIGCF: Extremely simplified but intent-enhanced graph collaborative filtering for recommendation. EAAI, 162, 112495. (www)

  @article{ , abstract = {Graph convolutional networks (GCNs) and graph contrastive learning (GCL) have substantially advanced recommender systems by modeling high-order user–item interactions and leveraging self-supervised signals. However, many existing methods overemphasize user–user or item–item similarities and rely on complex intent modeling, leading to increased complexity and limited exposure to diverse items. To address these challenges, we propose ESIGCF ( E xtremely S implified but I ntent-enhanced G raph C ollaborative F iltering) — a lightweight yet effective recommendation framework. ESIGCF explicitly defines user intent as the inner product between user and item embedding vectors and comprises two primary modules: (i) an intent-enhanced GCN that uses hybrid normalization (combining mean- and symmetric-normalization) to capture fine-grained user–item preferences without additional intent parameters, and (ii) an intent-aware GCL that aligns user–item pairs and positive and generated negative items. Negative samples are generated via a non-linear activation of item embedding interactions, promoting exposure to varied candidates without data augmentation. Experiments on three public datasets (Alibaba-iFashion, Yelp2018, Amazon-Book) show that ESIGCF consistently outperforms state-of-the-art baselines. For instance, on Alibaba-iFashion, ESIGCF achieves Recall@20 of 0.1273 versus 0.1059 for the best intent-enhanced baseline (a 20.2% relative improvement). Comprehensive experiments confirm that ESIGCF effectively captures latent user intent, mitigates popularity bias, and enhances recommendation performance with reduced complexity. Our code is available at https://github.com/Yangzhi22/ESIGCF .}, archive = {J_EAAI}, author = {Zhi Yang and Ruizhang Huang and Yanping Chen and Chuan Lin and Yongbin Qin}, doi = {10.1016/j.engappai.2025.112495}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112495}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {ESIGCF: Extremely simplified but intent-enhanced graph collaborative filtering for recommendation}, volume = {162}, year = {2025}, }
• (2025). Fusing spatial–temporal information into deep learning via wind propagation theory to enhance wind power prediction. EAAI, 162, 112494. (www)

  @article{ , abstract = {Accurately predicting wind power poses significant challenges because of the inherent randomness and intermittency of wind speed, thereby impeding effective wind power scheduling. This study proposes an improved deep learning model which leverages wind propagation theory to uncover spatial–temporal relationships among wind turbines to enhance the performance of wind power prediction. In addition, comprehensive theoretical and empirical analyses are conducted to justify the effectiveness of leveraging wind propagation theory for capturing spatio-temporal relationships among wind turbines. Moreover, spatio-temporal dependencies are modeled through a dual mechanism: multi-channel independent modeling for per-turbine temporal dynamics and wind propagation-based matrix computations for inter-turbine spatial relationships, which together significantly reduce computational complexity while preserving predictive performance. Data from 134 wind turbines and six comparison models were employed to validate the robustness and effectiveness of the proposed model. Empirical results indicate that the proposed model outperforms the baseline models, achieving an average improvement of 6.19% in Root Mean Square Error and 7.05% in Mean Absolute Error.}, archive = {J_EAAI}, author = {Maolin He and Jujie Wang}, doi = {10.1016/j.engappai.2025.112494}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112494}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Fusing spatial–temporal information into deep learning via wind propagation theory to enhance wind power prediction}, volume = {162}, year = {2025}, }
• (2025). LIP-MC: Multi-constraint label independent prediction in label distribution learning. EAAI, 162, 112493. (www)

  @article{ , abstract = {Label distribution learning can resolve label ambiguity precisely by determining how well each label describes an instance. Traditional label distribution learning algorithms frequently attempt to model the complex relationships between all labels. This not only adds complexity to the model but may also reduce prediction accuracy due to label conflicts. In this paper, we propose a novel label distribution learning algorithm based on Multi-Constraint Label Independent Prediction (LIP-MC), intended to promote the rationality and accuracy of prediction results by simplifying the prediction process and combining multiple constraints. Specifically, label independent prediction values are generated for each label through sparsity constraints and weight coefficient matrices. Subsequently, a novel transformation model is designed to combine all separate label predictions and produce the final label distribution. Furthermore, smoothness constraints and logarithmic similarity constraints were introduced to enhance the model’s performance and generalization ability. On fourteen real datasets, the experiment was carried out, and the comparison results against seven advanced algorithms under seven evaluation metrics confirmed that the proposed algorithm is superior.}, archive = {J_EAAI}, author = {Gui-Lin Li and Ruili Wu and Xiaorui Qian and Qiang Zhu and Heng-Ru Zhang}, doi = {10.1016/j.engappai.2025.112493}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112493}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {LIP-MC: Multi-constraint label independent prediction in label distribution learning}, volume = {162}, year = {2025}, }
• (2025). Physics-informed dynamic bayesian networks for time-dependent reliability prediction of subsea wellhead sealing system with multi-states. EAAI, 162, 112492. (www)

  @article{ , abstract = {The Subsea Wellhead Sealing System (SWSS) is crucial for the safety of deepwater operating, yet its reliability assessment faces challenges from harsh environments and multi-factor interactions. This study developed a data-driven, physics-informed reliability assessment method combining Finite Element Analysis (FEA) and Dynamic Bayesian Networks (DBN). An FEA model is established based on metal sealing theory, and a data-driven reliability model is subsequently constructed through sampling analysis, with a numerical-to-state conversion method bridging FEA and DBN. The FEA-DBN approach offers two key advantages: eliminating expert scoring subjectivity through physics-based modeling and effectively capturing multi-factor interactions and time-dependent behaviors. Results show this method can precisely quantify the evolution of SWSS reliability throughout its service lifecycle, with the probability of failure increasing from 0.64 % to 3.38 % over a 30-year service life. Case studies demonstrate its effectiveness for deep-sea equipment assessment, particularly in operating environments where real-time monitoring proves challenging, thereby demonstrating significant engineering application value.}, archive = {J_EAAI}, author = {Shengnan Wu and Han Gong and Long Yu and Aibo Zhang and Laibin Zhang and Yiliu Liu}, doi = {10.1016/j.engappai.2025.112492}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112492}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Physics-informed dynamic bayesian networks for time-dependent reliability prediction of subsea wellhead sealing system with multi-states}, volume = {162}, year = {2025}, }
• (2025). Constructing a robust short-text clustering model for contrastive learning based on optimized adaptive optimal transport for pseudo-label generation. EAAI, 162, 112491. (www)

  @article{ , abstract = {Short-text data often suffers from noise and class imbalances, posing challenges for effective clustering. To address these issues, we propose a Short-Text Clustering Model based on Pseudo-Labels and Contrastive Learning (SCPCL). The model comprises two key components: (1) a pseudo-label acquisition module, which introduces the optimal transport theory into short-text clustering and adopts a dynamically adjusted prior distribution to enhance the clustering of minority classes; and (2) a contrastive learning module combining a supervised clustering network, an instance contrastive head, and an anchor network. These components ensure intraclass compactness, interclass separability, and robustness to noise. Experiments on six benchmark datasets showed that SCPCL achieves an average clustering accuracy improvement of 2.61%, with a maximum gain of 6.47% for long-tailed distributions. This model provides an effective solution for clustering complex short text data.}, archive = {J_EAAI}, author = {Jiahui Liu and Chun Yan and Wei Liu and Yi Ding}, doi = {10.1016/j.engappai.2025.112491}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112491}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Constructing a robust short-text clustering model for contrastive learning based on optimized adaptive optimal transport for pseudo-label generation}, volume = {162}, year = {2025}, }
• (2025). Hybrid semantic-structural graph neural network for fault knowledge graph completion in railway operational equipment. EAAI, 162, 112490. (www)

  @article{ , abstract = {Incomplete fault knowledge graphs in railway operational equipment hinder effective fault diagnosis, prediction, and maintenance planning. This study addresses the challenge of completing fault knowledge graph by proposing a hybrid semantic-structural graph neural network (Hybrid S-GNN) that integrates both semantic and structural information for knowledge graph completion (KGC) in railway fault scenarios. The Hybrid S-GNN comprises four key modules: a semantic encoding module that enhances textual fault data representations through contextual enhancement and dynamic weight allocation; a structural encoding module that captures graph topology using multi-view structure encoding combining local aggregation, global path encoding, and relation-aware adjustment; a semantic-structural fusion module leveraging attention mechanisms to balance semantic and structural signals; and an optimization-prediction module employing margin-based ranking loss and context-aware negative sampling for accurate triple prediction. Experiments on real-world railway fault knowledge graphs demonstrate that Hybrid S-GNN achieves a Hits@10 of 80.5 % and mean reciprocal rank (MRR) of 0.640, outperforming state-of-the-art baselines by 5.8 % and 6.1 %, respectively. Ablation studies confirm the critical contributions of each module, validating the necessity of jointly modeling semantic and structural features. This work provides an effective solution to enhance railway fault knowledge graphs and paves the way for advanced fault management applications in railway operations.}, archive = {J_EAAI}, author = {Xiaorui Yang and Honghui Li and Yi Xu and Yunhao Deng and Yanhui Bai and Shufang Liu}, doi = {10.1016/j.engappai.2025.112490}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112490}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hybrid semantic-structural graph neural network for fault knowledge graph completion in railway operational equipment}, volume = {162}, year = {2025}, }
• (2025). Balancing efficiency and accuracy: Extreme gradient boosting and neural networks for near real-time brain deformation prediction in sports collisions. EAAI, 162, 112489. (www)

  @article{ , abstract = {Rapid head motion during sports collisions can cause traumatic brain injury. Head motion can be measured with instrumented mouthguards and fed into finite element (FE) models to predict brain strain, a measure of brain deformation and injury. Due to the computational cost of FE models, deep neural networks have been developed for near real-time prediction. However, they are not used in pitch-side assessments due to their complexity and reliance on full kinematic data, which cannot be reliably transmitted in real-time. We propose an extreme gradient boosting (XGBoost) model with simple input of two kinematic features. Its accuracy and efficiency were compared with two deep learning models: a multilayer perceptron (MLP) using 20 features, and a convolutional neural network (CNN) using entire kinematics. All models were trained on 1701 rugby impacts collected with mouthguards and simulated using the Imperial brain FE model. The XGBoost model predicted strain in key brain regions, while the deep learning models predicted whole-brain strain distributions. All models showed reasonable accuracy in predicting regional strain, with R 2 values 0.764–0.851 for XGBoost, 0.721–0.876 for MLP, and 0.744–0.887 for CNN. XGBoost required orders of magnitude fewer floating-point operations, and it used simple input that can be calculated on mouthguards and reliably transmitted in real-time. This study suggests that different models can be used at different stages of brain injury assessment. We hope that the XGBoost model proposed here will lower the barriers for adopting brain strain combined with instrumented mouthguards for pitch-side assessments from elite to grassroot collision sports.}, archive = {J_EAAI}, author = {Emily Yik Kwan Chan and Xiancheng Yu and Chen Qin and Mazdak Ghajari}, doi = {10.1016/j.engappai.2025.112489}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112489}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Balancing efficiency and accuracy: Extreme gradient boosting and neural networks for near real-time brain deformation prediction in sports collisions}, volume = {162}, year = {2025}, }
• (2025). Towards lensless image deblurring with prior-embedded implicit neural representations in the low-data regime. EAAI, 162, 112488. (www)

  @article{ , abstract = {The field of computational imaging has witnessed a promising paradigm shift with the emergence of untrained neural networks, offering novel solutions to inverse computational imaging problems. While existing techniques have demonstrated impressive results, they often operate either in the high-data regime, leveraging Generative Adversarial Networks (GANs) as image priors, or through untrained iterative reconstruction in a data-agnostic manner. This paper delves into lensless image reconstruction, a subset of computational imaging that replaces traditional lenses with computation, enabling the development of ultra-thin and lightweight imaging systems. To the best of our knowledge, we are the first to leverage implicit neural representations for lensless image deblurring, achieving reconstructions without the requirement of prior training. We perform prior-embedded untrained iterative optimization to enhance reconstruction performance and speed up convergence, effectively bridging the gap between the no-data and high-data regimes. Through a comprehensive comparative analysis of various untrained and low-shot methods, including under-parameterized non-convolutional techniques and domain-restricted low-shot approaches, we demonstrate that our method outperforms these alternatives by a significant margin. This work paves the way for the development of resource-constrained compact imaging systems, which can be applied in fields such as biomedical microscopy and embedded vision in low-data scenarios.}, archive = {J_EAAI}, author = {Abeer Banerjee and Sanjay Singh}, doi = {10.1016/j.engappai.2025.112488}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112488}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Towards lensless image deblurring with prior-embedded implicit neural representations in the low-data regime}, volume = {162}, year = {2025}, }
• (2025). Adaptive detection method for driver fatigue using facial multisource dynamic behavior fusion. EAAI, 162, 112482. (www)

  @article{ , abstract = {Driving while fatigued is a leading cause of traffic accidents. This study proposed an adaptive detection model to recognize driver fatigue based on the dynamic facial behavior information of drivers. First, drivers’ facial fatigue features were extracted to establish a general feature space, including pupil movement, eye state, and fatigue expression parameters. A differentiated feature space was then built based on individual drivers, taking into account the homogeneity, regularity, and individual variances in drivers' facial behavior at various states. A complete adaptive fatigue feature space was built by integrating the general feature space and differentiated feature space. Finally, a driver adaptive fatigue discrimination model was constructed to classify the general and adaptive fatigue feature space to detect driver fatigue states adaptively. A driver fatigue detection dataset from real scenarios had been established to validate the performance of the proposed model. Experimental results demonstrated that the proposed method significantly improved the detection accuracy of driver fatigue. In terms of artificial intelligence, this study contributes a novel adaptive feature space construction method based on multimodal dynamic feature fusion for facial fatigue recognition; in engineering application, it develops an adaptive driver fatigue detection system grounded in multimodal dynamic behaviors, which provides real-time alerts upon detecting driver fatigue and ensures driving safety.}, archive = {J_EAAI}, author = {Guoxin Zhang and Fei Yang and Xin Fang and Lili Wang and Lei Zhao and Chaoning Yu}, doi = {10.1016/j.engappai.2025.112482}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112482}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adaptive detection method for driver fatigue using facial multisource dynamic behavior fusion}, volume = {162}, year = {2025}, }
• (2025). Thermoeconomic optimization of climate-adaptive solar and wind multi-generation systems using artificial intelligence and thermal energy recovery. EAAI, 162, 112481. (www)

  @article{ , abstract = {This study presents a hybrid multi-generation energy system designed to overcome solar intermittency while meeting the global demand for integrated delivery of electricity, water, cooling, and sustainable fuels in the transition to decarbonization. The engineering application integrates solar thermal and wind energy with a modified Brayton cycle, a Steam Rankine Cycle (SRC), and a Thermoelectric Generator (TEG) to simultaneously produce electricity, fresh water via Reverse Osmosis (RO), hydrogen and oxygen via Proton Exchange Membrane Electrolyzer (PEME), and cooling (via absorption chiller) within a unified optimization framework. The system was modeled using Engineering Equation Solver (EES) and optimized via Response Surface Methodology (RSM) based on 11 decision variables. To address the complexity of optimization, a second phase applied Artificial Intelligence (AI) techniques: Adaptive Boosting (AdaBoost) for predictive modelling and Particle Swarm Optimization (PSO) for global optimization. Under optimal conditions, the Response Surface Methodology yielded an exergy efficiency of 45.8 % with a cost rate of 576.76 United States Dollars per hour (USD/h), while AI reduced costs to 211.2 USD/h with a moderate efficiency trade-off. Simulation of the optimized configuration across eight diverse climates identified Quebec as most viable, generating 22,629.6 Megawatt-hours per year (MWh/year) of electricity and avoiding 4616.4 tons of Carbon Dioxide (CO 2 ) emissions annually. Integration of wind energy stabilizes solar variability, enhancing performance. AI contributes to optimizing complex interactions, nonlinear constraints, and multiple conflicting objectives. The methodology offers a scalable, generalizable framework for designing intelligent, climate-resilient infrastructures. Future research includes AI-enabled real-time control, experimental validation, and broader deployment strategies.}, archive = {J_EAAI}, author = {Ehsanolah Assareh and Nima Izadyar and Emad Tandis and Mehdi Khiadani and Amir shahavand and Neha Agarwal and Arian Gerami and Ahmed Rezk and Minkyu Kim and Reza Kord and Tahereh Pirhoushyaran and Mehdi Hosseinzadeh and Saleh Mobayen}, doi = {10.1016/j.engappai.2025.112481}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112481}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Thermoeconomic optimization of climate-adaptive solar and wind multi-generation systems using artificial intelligence and thermal energy recovery}, volume = {162}, year = {2025}, }
• (2025). A mamba-quantum attention transformer-convolutional network for automated pest and disease detection. EAAI, 162, 112480. (www)

  @article{ , abstract = {This study addresses critical challenges in apple leaf disease detection, where environmental interference (climate variations, lighting conditions, growth stages), symptom similarity across diseases, and phenotypic diversity within single diseases significantly impede accurate identification. To overcome these limitations, we propose the Mamba Quantum Attention Transformer-Graph Convolutional Network (MQAT-Transformer), a novel hybrid architecture that integrates quantum-enhanced attention mechanisms with dynamic graph learning. Firstly, the Mamba-Quantum X Attention mechanism (MQXA), inspired by quantum state modeling, optimizes visual feature extraction under complex environmental conditions. Secondly, the Dynamic Graph Convolution Feature Prioritization module (DGCF) adaptively resolves heterogeneous symptom manifestations by establishing multi-scale feature dependencies through learnable graph structures. This study conducted comprehensive experiments on the AppleLeaf9 Datasets (AppleLeaf9) proposed by Northwest A&F University, Apple disease leaf images Dataset (ADLI), and PlantVillage Dataset (PlantVillage) proposed by Pennsylvania State University. The results demonstrate that the proposed method achieves competitive performance across multiple evaluation metrics (e.g., accuracy, recall, and F1-score), confirming its generalization capability in cross-species scenarios. Finally, leveraging this network architecture, we developed a lightweight mobile application for farm leaf disease detection, offering a practical and user-friendly solution for crop health monitoring in agricultural settings.}, archive = {J_EAAI}, author = {Dong Tang and Zhihuan Liu and YiRui Zeng and Zhao Xu and Wendong Su}, doi = {10.1016/j.engappai.2025.112480}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112480}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A mamba-quantum attention transformer-convolutional network for automated pest and disease detection}, volume = {162}, year = {2025}, }
• (2025). Physics-driven prior learning-based deep unrolling for underwater image enhancement. EAAI, 162, 112472. (www)

  @article{ , abstract = {We propose a physics-driven prior learning-based algorithm unrolling approach for underwater image enhancement that leverages the advantages of both model- and learning-based approaches while overcoming their limitations. Model-based algorithms are theoretically robust because of prior knowledge of the underlying physics but may degrade image quality due to modeling inaccuracies. On the other hand, learning-based algorithms exhibit better adaptivity but inferior interpretability due to their black-box models and neglect of domain knowledge. In this work, we first formulate underwater image enhancement as a joint optimization problem with physics-based underwater-related priors and two learnable regularizers to compensate for modeling inaccuracies. Then, we solve the problem by reformulating it as a set of subproblems, which are then solved iteratively. Finally, we unroll the iterative algorithm into a deep neural network comprising a series of blocks, in which the optimization variables and regularizers are updated using closed-form solutions and learned deep neural networks, respectively. Experimental results on several datasets demonstrate that the proposed algorithm outperforms state-of-the-art underwater image enhancement algorithms on both quantitative and qualitative comparisons. The source code and pretrained models will be available at https://github.com/thithuypham/BLUE-Net .}, archive = {J_EAAI}, author = {Thuy Thi Pham and Hansung Yu and Truong Thanh Nhat Mai and Chul Lee}, doi = {10.1016/j.engappai.2025.112472}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112472}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Physics-driven prior learning-based deep unrolling for underwater image enhancement}, volume = {162}, year = {2025}, }
• (2025). Explore unicin milvus optimization-based scale invariant signal interference noise loss enabled cycle generative adversarial network for audio source separation. EAAI, 162, 112470. (www)

  @article{ , abstract = {Audio Source Separation remains the major research area as noisy audio signals lack information connectivity among users. Despite the numerous important efforts for audio source separation, there are still some challenges limiting the overall performance. Specifically, the existing methods face difficulty in working with multiple input sources and ignore the spectrum information of the signals, resulting in subpar performance. Hence, the research proposes the Explore Unicin Milvus Optimization-based Scale Invariant Signal interference Noise loss enabled Cycle Generative Adversarial Network (ExUnMO-S2NC-GAN) for addressing the challenges in the existing methods. The proposed approach utilizes the Cycle Generative Adversarial Network (C-GAN) architecture to carry out the transformation and restoration while preserving the significant details, resulting in achieving the most relevant audio source as the outcome. Specifically, the proposed model exploits the Scale Invariant Signal interference noise (S2N) loss function, improving the robustness against invariant to the signal scale and deformations of the signal. Besides, the Explore Unicin Milvus Optimization (ExUnMO) algorithm, harnessing the unique traits of Red Kite and Harris Hawk, is used for fine-tuning the hyperparameters of C-GAN, leading to improved performance. Moreover, the feature extraction with the spectral parameters added more advantages to the research model to work on more specific inputs. Extensive experiments demonstrates that theproposed model obtained high-efficiency outcomes in comparison with the state-of-the-art methods, which is evaluated with the error metrics attaining the Mean Absolute Error (MAE) of 1.79, and Mean Absolute Percentage Error (MAPE) of 3.22, whereas the signal quality metrics such as Peak Signal-to-Noise Ratio (PSNR), Signal-to-Interference Ratio (SIR) and Signal-to-Artifacts Ratio (SAR) achieved the high values of 54.81 dB (dB), 39.33 dB, and 40.56 dB respectively.}, archive = {J_EAAI}, author = {Baishakhi Dutta and Chandrakant J Gaikwad}, doi = {10.1016/j.engappai.2025.112470}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112470}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Explore unicin milvus optimization-based scale invariant signal interference noise loss enabled cycle generative adversarial network for audio source separation}, volume = {162}, year = {2025}, }
• (2025). A deep ensemble learning model for chinese spelling check. EAAI, 162, 112469. (www)

  @article{ , abstract = {Existing Chinese Spelling Check models are individual end-to-end models with different tendencies, which cannot fully cover all kinds of spelling errors and achieves advanced performance in every aspect. In this paper, a deep ensemble learning model for Chinese Spelling Check is designed, which captures the correct Chinese spelling answers proposed by most of the candidate ckeck models. Considering the phonological, visual and semantic characteristics of all candidate answers, it can even discover new correct answer which is not found by any of the candidate ckeck models. Specifically, in order to learn a hybrid representation of each input correction answer provided by each candidate ckeck model that includes phonological, visual, and semantic characteristics, a hybrid representation learner is designed and does not need to consider the compatibility of the candidate ckeck models. A deep ensemble correction network is designed to integrate all the hybrid representations and finds a final correction answer that considers all the useful information of all input correction answers. Moreover, based on the deep ensemble correction network, the deep ensemble learning model can be easily extended to involve new candidate ckeck models. Experimental results on the benchmark demonstrate that our proposed model largely outperforms any of its aggregated individual ckeck models.}, archive = {J_EAAI}, author = {Yaoyao Wu and Ruizhang Huang and Lina Ren and Ruina Bai}, doi = {10.1016/j.engappai.2025.112469}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112469}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A deep ensemble learning model for chinese spelling check}, volume = {162}, year = {2025}, }
• (2025). Efficient active flow control strategy for confined square cylinder wake using deep learning-based surrogate model and reinforcement learning. EAAI, 162, 112468. (www)

  @article{ , abstract = {This study introduces a deep learning surrogate model-based reinforcement learning (DL–MBRL) for active control of two-dimensional (2D) wake flow past a square cylinder confined between parallel walls using antiphase jets. In the training of this framework, a proximal policy optimisation (PPO) reinforcement learning agent alternates its interaction between a deep learning-based surrogate model (DL–SM) and a computational fluid dynamics (CFD) simulation to suppress wake vortex shedding, thereby significantly reducing computational costs. The DL–SM, built with a Transformer for temporal dynamics and a multiscale enhanced super-resolution generative adversarial network (MS–ESRGAN) for spatial reconstruction, is trained on 2D direct numerical simulation wake flow data to effectively and accurately emulate complex nonlinear flow behaviours. Compared to standard model-free reinforcement learning, the DL–MBRL approach reduces training time by about 50% while maintaining or improving wake stabilisation. Specifically, it achieves approximately a 98% reduction in shedding energy and a 95% reduction in the standard deviation of the lift coefficient, demonstrating strong suppression of vortex shedding. By leveraging the inherent stochasticity of DL–SM, DL–MBRL also addresses the nonzero mean lift coefficient issue observed in model-free methods, promoting more robust exploration. These results highlight the potential of the framework for extension to practical and industrial flow control problems.}, archive = {J_EAAI}, author = {Meng Zhang and Mustafa Z. Yousif and Minze Xu and Haifeng Zhou and Linqi Yu and Hee-Chang Lim}, doi = {10.1016/j.engappai.2025.112468}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112468}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Efficient active flow control strategy for confined square cylinder wake using deep learning-based surrogate model and reinforcement learning}, volume = {162}, year = {2025}, }
• (2025). Vessel behavior recognition method for preventing vessel-bridge collisions via adaptive video analytics. EAAI, 162, 112467. (www)

  @article{ , abstract = {This study presents a comprehensive end-to-end framework for recognizing vessel behaviors aimed at preventing vessel-bridge collisions in complex maritime environments. Current monitoring approaches that rely on Automatic Identification Systems or external tracking mechanisms often suffer from class imbalance, cross-domain variability, and limited capability to detect previously unseen high-risk behaviors. To address these challenges, the proposed framework directly analyzes video streams and introduces a standardized behavioral taxonomy, classifying vessel activities into eleven categories while incorporating temporal continuity and behavior transition modeling. A robust dataset construction pipeline is established, consisting of fixed-length frame sequences and mechanisms for cross-domain generalization. The framework integrates a spatio-temporal feature extraction module based on deformable convolution and multi-scale attention, coupled with a cross-instance mutual enhancement mechanism to capture domain-invariant representations. An open-set recognition strategy, grounded in class anchor clustering, enables accurate identification of previously unobserved high-risk behaviors. Furthermore, an adaptive frame sampling strategy dynamically adjusts sampling density around behavior transitions, enhancing recall and capturing infrequent events while minimizing computational cost. Extensive evaluations on both single-domain and multi-domain benchmark datasets, as well as real-world bridge video streams, demonstrate superior performance in terms of overall accuracy, F1-score, detection of rare behaviors, and recall compared with baseline methods. Ablation studies confirm the contribution of each component, and comparisons with open-set recognition methods underscore the practical utility of the proposed approach for anomaly detection. This framework provides a scalable, artificial intelligence-driven solution for vessel behavior recognition, anomaly detection, and cross-domain generalization, supporting intelligent monitoring and early warning in safety-critical maritime operations.}, archive = {J_EAAI}, author = {Woqin Luo and Daoxin Chen and Ye Xia and Dongming Feng}, doi = {10.1016/j.engappai.2025.112467}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112467}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Vessel behavior recognition method for preventing vessel-bridge collisions via adaptive video analytics}, volume = {162}, year = {2025}, }
• (2025). A secure architecture for intelligent internet of vehicle systems using advanced dimensionality reduction with deep ensemble models. EAAI, 162, 112466. (www)

  @article{ , abstract = {An intelligent transportation system (ITS) is an idea that provides a safe, protected, and smarter travelling experience to drivers. This visionary strategy aims to enable vehicles, pedestrian smartphones, roadside transportation frameworks, and additional devices to communicate with each other to offer secure and convenient services. Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) communication in ITS enables the exchange of data like speed, position, and heading between vehicles and nearby networks. This improves data flow among infrastructure and vehicles, promoting road safety, traffic efficiency, reduced emissions, and ITS development. Artificial intelligence (AI) now presents smart solutions for addressing these threats effectively. This paper presents a Secure Architecture for Intelligent Vehicle Systems Using Integrated Ensemble Model and Advanced Dimensionality Reduction (SAIVS-IEMADR) model. Initially, the data pre-processing is performed to transform and organize raw data into a suitable format. The feature selection (FS) process uses five methods: Consistency, Correlation Feature Selection (CFS), information theory (InfoGain), Relief for Features (Relief-F), and Fast-Correlation Based Filter (FCBF) to identify the most relevant and informative features. Finally, an ensemble model comprising the temporal convolutional network (TCN), deep belief network (DBN), and stacked sparse auto-encoder (SSAE) is employed for classification. The SAIVS-IEMADR approach was evaluated on the Network Security Laboratory – Knowledge Discovery in Databases (NSLKDD) and Canadian Institute for Canadian Institute for Cybersecurity Intrusion Detection System (CICIDS)-2017 datasets, achieving superior accuracy of 99.55 % and 99.32 % compared to existing methods.}, archive = {J_EAAI}, author = {Amal K. Alkhalifa and Mashael M. Asiri and Reham Al-Dayil and Ahmed Alsayat and Mashail N. Alkhomsan and Mohammed A. AlAqil and Shouki A. Ebad and Mohammed Mujib Alshahrani}, doi = {10.1016/j.engappai.2025.112466}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112466}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A secure architecture for intelligent internet of vehicle systems using advanced dimensionality reduction with deep ensemble models}, volume = {162}, year = {2025}, }
• (2025). A constitutive framework for non-isothermal plasticity through micro-mechanism informed artificial neural networks. EAAI, 162, 112465. (www)

  @article{ , abstract = {Non-isothermal plastic deformation creates modeling challenges for constitutive model development. Current constitutive models challenge to capture the coupled microstructural changes that occur when temperature varies during processing. The Micro-Mechanism Informed Artificial Neural Network (MMIANN) framework was developed to address these limitations using artificial intelligence (AI) and machine learning (ML) techniques. The MMIANN framework combines physics-based evolution equations for key metallurgical processes—dislocation density, grain boundary migration, and precipitation kinetics—with neural network predictions. These micro-mechanisms operate as internal state variables that guide the network's material behavior predictions. The architecture uses parallel physics-based and neural pathways, blended through adaptive coefficients. Thermodynamic constraints maintain consistency through penalty-based enforcement of the Clausius-Duhem inequality. The model was trained and validated using experimental data from simultaneous cooling and tensile deformation of AA7075 aluminum alloy. The tests replicated industrial hot forming conditions with cooling rates from 25 to 75 °C per second (°C/s). This experimental approach captures the thermal-mechanical coupling that drives microstructural evolution in practice. MMIANN achieved correlation coefficients exceeding 0.96 for stress, temperature, and grain size predictions. The framework captures thermomechanical regimes. Processing maps generated by the AI model link process parameters to microstructural outcomes. The analysis reveals an optimal processing window (40–55 °C/s cooling, 0.15–0.25 strain ( ε )) and identifies three regimes where different strengthening mechanisms dominate. By integrating metallurgical science with machine learning, this framework provides a practical tool for non-isothermal manufacturing processes. The approach bridges microstructural understanding with process control for thermal-mechanical operations through the application of artificial intelligence.}, archive = {J_EAAI}, author = {Yo-Lun Yang and Tsai-Fu Chung and Chia-Hung Liao and Liang-Yu Chen and Hsing-Yu Wu and Uthayakumar Marimuthu and Arumugaprabu Veerasimman and Sundarakannan Rajendran and Vigneshwaran Shanmugam}, doi = {10.1016/j.engappai.2025.112465}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112465}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A constitutive framework for non-isothermal plasticity through micro-mechanism informed artificial neural networks}, volume = {162}, year = {2025}, }
• (2025). Learnable patchmatch and self-teaching for multi-frame depth estimation in monocular endoscopy. EAAI, 162, 112463. (www)

  @article{ , abstract = {This work delves into unsupervised monocular depth estimation in endoscopy, which leverages adjacent frames to establish supervisory signals during the training phase. For many clinical applications, e.g. , surgical navigation, temporally correlated frames are also available at test time. However, most existing monocular methods struggle to make effective use of temporal information during both training and inference, primarily due to the inherent challenges of endoscopic imagery, including low- or homogeneous-texture regions and brightness fluctuations between frames. To fully exploit the temporal information in endoscopic scenes, we propose a novel unsupervised multi-frame monocular depth estimation model. The proposed model integrates a learnable patchmatch module to adaptively increase the discriminative ability in regions with low or homogeneous textures, and enforces cross-teaching and self-teaching consistencies to provide efficacious regularizations towards brightness fluctuations. Furthermore, as a byproduct of the self-teaching paradigm, the proposed model is able to improve the depth predictions when more frames are input at test time. We conduct detailed experiments on multiple datasets, and the experimental results indicate that the proposed method exceeds prior state-of-the-art competitors. The source code and trained models will be publicly available at https://github.com/ShuweiShao/FrameDepth .}, archive = {J_EAAI}, author = {Shuwei Shao and Zhongcai Pei and Weihai Chen and Xingming Wu and Zhong Liu}, doi = {10.1016/j.engappai.2025.112463}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112463}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Learnable patchmatch and self-teaching for multi-frame depth estimation in monocular endoscopy}, volume = {162}, year = {2025}, }
• (2025). Hypergraph induced semi-supervised orthogonal nonnegative matrix factorization with label and constraint propagation. EAAI, 162, 112462. (www)

  @article{ , abstract = {As a popular technology of artificial intelligence, nonnegative matrix factorization (NMF) aims at clustering and finding the differentially expressed features of each cluster. However, for complex high-dimensional sample data, it is still a challenge to design more appropriate NMF optimization models and develop more efficient algorithms to solve this model in view of enhanced theoretical properties and numerical performance. In this paper, a novel NMF optimization model with regularization is proposed such that the NMF is performed by a semi-supervised approach, as well as incorporating the strategies of hypergraph induced label propagation and constraint propagation. Specifically, different from existing NMF methods, the hypergraph structure underlying the data, together with the simple graph information, is employed to guide the pairwise constraint propagation in our built model. In recognition of sample similarity, a dataset-adaptive strategy is proposed to update the weight matrix of the graphs. By adding dual orthogonality on the factor matrices in the objective function, interpretability and feature independence of the built model are enhanced. Then, an algorithm is developed to efficiently solve this complicated model. Theoretically, it is proved that the developed algorithms are well defined and convergent. Numerically, extensive tests on the proposed model and algorithm are performed, which validate that they outperform the state-of-the-art ones in terms of different metrics of evaluating clustering performance when they are applied into solution of the problems from eight public datasets.}, archive = {J_EAAI}, author = {Jie Guo and Ting Li and Jialu Liu and Zhong Wan}, doi = {10.1016/j.engappai.2025.112462}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112462}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hypergraph induced semi-supervised orthogonal nonnegative matrix factorization with label and constraint propagation}, volume = {162}, year = {2025}, }
• (2025). A novel condition monitoring approach using hybrid lightweighted adaptive models for complex machinery. EAAI, 162, 112461. (www)

  @article{ , abstract = {Condition monitoring of complex industrial systems is critical for ensuring operational reliability. Data-driven methods using artificial intelligence have advanced anomaly detection (AD) and fault diagnosis (FD), but existing approaches often treat them separately, focus on known faults, and struggle with previously unseen or rare conditions in multi-modal scenarios. This study proposes a novel condition monitoring framework that integrates AD and FD within a distributed architecture. Lightweight models—including kernel principal component analysis, support vector machines, and one-dimensional convolutional neural networks—enable efficient and scalable processing. A multilevel information fusion strategy ensures consistent detection and diagnosis while facilitating the isolation of previously unknown faults. Module test results demonstrate the effectiveness and robustness of the proposed feature extraction and adaptive modeling approaches. The overall test results for previously unknown faults vary across channels and modules. For samples with misalignment and inner blade wear, channel-level detection accuracy ranges from 0.007 to 0.989, with unknown recognition rates up to 0.933 and diagnosis probabilities from 0.508 to 0.933. For strong misalignment and fan-end inner race faults, nearly all channels achieve 100 % detection accuracy, with some diagnosis probabilities above 0.9, while unknown recognition remains minimal (mostly below 0.05). Importantly, the proposed framework integrates detection and diagnostic outputs across channels, effectively mapping previously unseen faults to similar known categories or to an unknown category. Overall, the proposed framework offers a referenced solution for condition monitoring of industrial systems like pumps, turbines, and compressors, and lays the foundation for future improvements incorporating domain knowledge and model-driven interpretability.}, archive = {J_EAAI}, author = {Yingqian Liu and Rongyong Zhang and Luigi Grossi and Zhipin Ye and Huairui Li and Rongsheng Zhu and Qiang Fu}, doi = {10.1016/j.engappai.2025.112461}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112461}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel condition monitoring approach using hybrid lightweighted adaptive models for complex machinery}, volume = {162}, year = {2025}, }
• (2025). A fast and stable framework for generative adversarial imitation learning. EAAI, 162, 112460. (www)

  @article{ , abstract = {Applying reinforcement learning to complex and high-dimensional tasks encounters challenges, including the formulation of suitable reward functions, achieving sample efficiency, and developing effective exploration strategies. Adversarial imitation learning techniques address these issues by employing generative adversarial networks (GANs) to capture temporal dependencies and mitigate compounding errors. These methods exhibit enhanced efficiency relative to behavioral cloning and require fewer expert samples. Nonetheless, their complex min-max problem results in sample inefficiency and struggles with challenges such as mode collapse and training instability. This paper provides a comprehensive approach that adeptly addresses these challenges. The proposed method's design comprises three main steps. First, it uses the off-policy Twin Delayed Deep Deterministic (TD3) algorithm to enhance sample efficiency and accelerate learning. In the second step, a novel reward function based on energy-based GANs and deep regret analytic GANs is developed, which alleviates mode collapse and enhances training stability. Finally, we suggest several improvements, including the use of a pre-trained discriminator and mixed batches, to achieve a faster and more stable algorithm. The evaluation findings on continuous control tasks demonstrate that our method not only matches state-of-the-art performance but also surpasses it in both sample efficiency and stability. It achieves convergence with far fewer iterations than the compared methods.}, archive = {J_EAAI}, author = {Fateme Shahabi-Nejad and Mohammad Mehdi Ebadzadeh}, doi = {10.1016/j.engappai.2025.112460}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112460}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A fast and stable framework for generative adversarial imitation learning}, volume = {162}, year = {2025}, }
• (2025). A transfer learning method of collaborating random walk and adaptive instance normalization for inscription image denoising. EAAI, 162, 112458. (www)

  @article{ , abstract = {Mess noise hinders reading and understanding of inscriptions in images. For image restoration from noise-corrupted images, existing network-learning-based methods can construct an excellent model to generate noise patterns. However, the performance of such models is degraded owing to the lack of high-quality training data and the complex noise pattern in inscription images, e.g., mixed noise with multiple levels. Herein, we first propose a novel noise generation model that can produce more realistic synthetic noise images using the random walk algorithm. Then, we propose an explainable inscription image denoising network using a variational inference model, where the joint distribution of clean-noise image pairs is approximated in a dual adversarial manner. The proposed network exhibits improved generalizability and adaptability to different noise characteristics using an estimated noise map and adaptive instance normalization. Finally, we introduce a transfer learning scheme to migrate the network learned from the synthetic noise image domain to a real-inscription image domain with a limited number of real-inscription images. The proposed method outperforms state-of-the-art methods.}, archive = {J_EAAI}, author = {Erhu Zhang and Yunjing Liu and Guangfeng Lin and Jinghong Duan}, doi = {10.1016/j.engappai.2025.112458}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112458}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A transfer learning method of collaborating random walk and adaptive instance normalization for inscription image denoising}, volume = {162}, year = {2025}, }
• (2025). Deep learning-based time series forecasting for bearing remaining useful life: Recent advances, hybrid architectures, and targeted enhancements. EAAI, 162, 112457. (www)

  @article{ , abstract = {This paper presents a systematic review of deep learning(DL)-based time series forecasting hybrid model for bearing RUL prediction by evaluating these studies from 2020 to 2025, addressing the gap in analyzing cross-model collaboration strategies. Firstly, the general workflow and modeling framework for remaining useful life (RUL) prediction were introduced. Secondly, a comparative analysis of time dependence capture mechanisms -including Recurrent Neural Networks(RNN) and their variants and Temporal Convolutional Network(TCN), and Transformer-was conducted. The findings reveal a shift from local sequential modeling to globally contextualized frameworks, enhanced by self-supervised learning and multimodal fusion. These developments underscore the importance of aligning model selection with specific task objectives and balancing multiple dimensions to achieve optimal performance in complex industrial scenarios. Thirdly, to address common challenges in RUL prediction, such as noisy data, sparse features, high model complexity, and limited interpretability, this paper explores performance optimization strategies from the perspectives of data quality, architectural design, and decision transparency. Finally, a comprehensive review was made of the current challenges: unclear applicability of attention, limited interpretability, deployment difficulties under resource constraints, difficulties in real-time prediction, and weak generalization in a data-scarce environment. To address these issues, future research should explore more trustworthy attention evaluation, interpretable architectures, lightweight design, continuous iteration for real-time prediction, and leveraging embedding other models to complement the lack of generalization. Overall, this work provides a structured perspective to support the development of the next generation of intelligent prediction systems.}, archive = {J_EAAI}, author = {Zhenyu Tang and Dalian Yang and Linrong Tan and Liying Zeng}, doi = {10.1016/j.engappai.2025.112457}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112457}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Deep learning-based time series forecasting for bearing remaining useful life: Recent advances, hybrid architectures, and targeted enhancements}, volume = {162}, year = {2025}, }
• (2025). Finite element-integrated neural network framework for spatial modal prediction in machine tool structures. EAAI, 162, 112456. (www)

  @article{ , abstract = {Accurate prediction of position-dependent structural dynamics in (CNC) machine tools is critical for ensuring machining precision, avoiding resonance, and enabling real-time health monitoring. This study proposes an integrated framework combining finite element analysis (FEA), experimental modal testing, and artificial neural networks (ANNs) to model and predict position-dependent dynamics across the machine workspace. A validated FEA model of a high-rigidity vertical machining centre is developed and correlated with experimental modal analysis using a PCB 086D20 impact hammer and tri-axial accelerometer. Natural frequencies and mode shapes are extracted and compared, showing deviation under 10 %, confirming model fidelity. To capture position-dependent dynamics, modal analysis was performed at 27 spatial locations, revealing significant frequency variation across planes, indicating localized compliance zones. A multilayer ANN is trained on the modal dataset to predict frequencies based on spatial coordinates, achieving R 2 values above 0.99. The proposed hybrid approach enables real-time estimation of structural dynamics, reducing the need for repeated testing and supporting intelligent control strategies in large-format CNC systems. This work contributes a predictive foundation for dynamic stability optimization, resonance avoidance, and digital twin development in precision machining applications.}, archive = {J_EAAI}, author = {Aman Ullah and Tzu-Chi Chan and Jun-Fa Huang and Shinn-Liang Chang}, doi = {10.1016/j.engappai.2025.112456}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112456}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Finite element-integrated neural network framework for spatial modal prediction in machine tool structures}, volume = {162}, year = {2025}, }
• (2025). End-to-end go (Weiqi) game record reconstruction from live broadcast videos. EAAI, 162, 112455. (www)

  @article{ , abstract = {Manual transcription of Go (Weiqi) game records from broadcast videos creates a major bottleneck for building training data in artificial intelligence (AI). We present an end-to-end system that reconstructs complete smart game format (SGF) records from professional tournament broadcasts. The pipeline integrates four modules: (i) video-to-frame sampling; (ii) a board detector based on a detection transformer (DETR), optimized with a size-aware loss to reliably localize both main and commentary boards; (iii) a stone classifier that uses knowledge distillation from a vision transformer (ViT) teacher to an efficient grid-based student for full-board inference; and (iv) a temporal reconstruction algorithm for occlusion recovery and move-sequence consistency. When evaluated under a zero-error-tolerance video-level protocol – where a video is counted correctly only if all sampled frames match the reference – the system achieves 82.56% accuracy on 86 real tournament videos (356 h). Component analyses reveal high board localization quality with mean average precision (mAP50-95) reaching 0.99; near-teacher board-state recognition with a 67 × speedup (377.5 frames per second, FPS) and F1 score 0.988; and a 70.23% reduction of occlusion-related misdetections. Compared with you only look once (YOLO) and faster region-based convolutional neural network (Faster R-CNN) baselines, our design improves small-board recall and end-to-end robustness in dual-board and occluded settings. The system outputs SGF records suitable for large-scale dataset construction, AI-assisted analysis, education, and digital preservation, and the approach can be generalized to other grid-structured board games with minor adaptations.}, archive = {J_EAAI}, author = {Chih-Lin Lin and Hsia-Hung Ou and Lung Hung Chen and Chih-En Kuo}, doi = {10.1016/j.engappai.2025.112455}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112455}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {End-to-end go (Weiqi) game record reconstruction from live broadcast videos}, volume = {162}, year = {2025}, }
• (2025). Detecting code paraphrased by large language models using coding style features. EAAI, 162, 112454. (www)

  @article{ , abstract = {Recent progress in large language models (LLMs) for code generation has raised serious concerns about intellectual property protection. Malicious users can exploit LLMs to produce paraphrased versions of proprietary code that closely resemble the original. While the potential for LLM-assisted code paraphrasing continues to grow, research on detecting it remains limited, underscoring an urgent need for a detection system. We respond to this need by proposing two tasks. The first task is to detect whether code generated by an LLM is a paraphrased version of original human-written code. The second task is to identify which LLM is used to paraphrase the original code. For these tasks, we construct a dataset consisting of pairs of human-written code and LLM-paraphrased code using various LLMs. We statistically confirm significant differences in the coding styles of human-written and LLM-paraphrased code, particularly in terms of naming consistency, code structure, and readability. Based on these findings, we develop a detection method that identifies paraphrase relationships between human-written and LLM-generated code, and discover which LLM is used for the paraphrasing. Our detection method outperforms the best baselines in two tasks, improving F1 scores by 2.64% and 15.17% while achieving speedups of 1,343x and 213x, respectively.}, archive = {J_EAAI}, author = {Shinwoo Park and Hyundong Jin and Jeong-won Cha and Yo-Sub Han}, doi = {10.1016/j.engappai.2025.112454}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112454}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Detecting code paraphrased by large language models using coding style features}, volume = {162}, year = {2025}, }
• (2025). Cooperative neural networks for inverse design: Integrating denoising autoencoder and surrogate model for partial design variable imputation. EAAI, 162, 112453. (www)

  @article{ , abstract = {Data-driven inverse design is an engineering approach where target performance criteria are specified upfront, leading to the derivation of design solutions that meet these criteria. While recent research focuses on generating complete design solutions using generative models, these approaches struggle with partial design variables and constraints that predetermine certain variables. Additionally, generative models are data-intensive and prone to overfitting with limited datasets. To address these limitations, this paper proposes a Cooperative Neural Network architecture comprising two key components: the Imputation Model and the Surrogate Model. These components collaborate to optimize design solutions while adhering to predefined performance criteria. The framework’s effectiveness is demonstrated through a case study on Glass Run Channel (GRC) designs from a Korean automotive manufacturer. Results show the architecture proficiently imputes undetermined variables and ensures the designs meet desired performance metrics, achieving Mean Squared Error (MSE) reductions of up to 98 % and R-squared values of 0.997–0.999 in initial tests. It remains robust in diverse scenarios, achieving up to 95.65 % MSE reduction and R-squared values of 0.995–0.999 for cases with the most undetermined variables, and up to 94.68 % MSE reduction with R-squared values of 0.983–0.995 for the smallest training datasets. This framework reduces design cycle times and enhances engineering design efficiency, offering a robust solution to limitations in traditional methods reliant on physical prototyping and iterative testing.}, archive = {J_EAAI}, author = {Agung Nugraha and Hyerin Kwon and Gyeongho Park and Jihwan Lee}, doi = {10.1016/j.engappai.2025.112453}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112453}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Cooperative neural networks for inverse design: Integrating denoising autoencoder and surrogate model for partial design variable imputation}, volume = {162}, year = {2025}, }
• (2025). Knowledge distillation via teacher-modeled sample relationships for skin cancer diagnosis. EAAI, 162, 112452. (www)

  @article{ , abstract = {In skin cancer diagnosis, knowledge distillation can achieve model compression, which enables complex deep learning tasks to run efficiently on devices with limited resources. However, existing studies have largely overlooked explicit modeling of sample relationships during teacher model training, particularly in the context of class imbalance. Directly transferring such unrefined relational knowledge not only fails to address the bias toward majority classes but also leads to suboptimal performance for minority classes. To address this gap, we propose a novel approach that integrates a sample relationship module into the teacher model to learn relational knowledge under class imbalance, which is then transferred to the student model during distillation. Specifically, the teacher transfers two key types of knowledge: traditional logits and inter-sample relationships. During training, the student is optimized through two losses: a standard logit-matching loss to mimic classification knowledge, and relational consistency losses to enforce alignment between the student’s and teacher’s predicted inter-sample relationships to address class imbalance. We conducted extensive experiments on large-scale public skin lesion classification datasets, including ISIC2019 and HAM10000, and the results demonstrate that our method significantly outperforms current state-of-the-art approaches.}, archive = {J_EAAI}, author = {Peng Liu and Wenhua Qian and Shan Tang}, doi = {10.1016/j.engappai.2025.112452}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112452}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Knowledge distillation via teacher-modeled sample relationships for skin cancer diagnosis}, volume = {162}, year = {2025}, }
• (2025). Region-based weighting-and-enhancement network with adaptive class weighting loss for postoperative inguinal hernia prediction. EAAI, 162, 112451. (www)

  @article{ , abstract = {Postoperative inguinal hernia (PIH) is a common complication after radical prostatectomy, subsequently leading to multiple potential risks (e.g., cardiovascular and cerebrovascular accidents) and increased surgical costs due to re-surgical reparation. Magnetic resonance imaging (MRI) examination is a widely used procedure before radical prostatectomy, which can investigate the muscle structures of the abdominal wall (MSAW). Recently, clinical studies have indicated that clinical parameters (e.g., thickness and width of the external oblique muscle) of MSAW are strongly related to PIH. However, automated MRI-based PIH prediction based on deep neural networks has not been studied previously. Motivated by these observations, we propose a novel region-based weighting-and-enhancement network to predict PIH before radical prostatectomy based on MRI images automatically. Specifically, we employ the well-designed Region Weighting-and-Enhancement module to capture informative context representations through region weighting and regional context enhancement, by fully leveraging the potential of clinical MSAW priori. Additionally, this paper designs an effective adaptive class weighting loss to emphasize or suppress the samples with varying levels of significance to further boost the PIH prediction performance. The extensive experiments on a clinical MRI-PIH dataset and one publicly available MRI dataset manifest the superiority of our proposed methods over state-of-the-art deep neural networks and advanced loss methods.}, archive = {J_EAAI}, author = {Jiawei Zhang and Lisheng Wu and Qiang Fang and Weidong Yu and Zhengyu Hu and Fengyun Zhang and Cheng Yang and Xiaoqing Zhang}, doi = {10.1016/j.engappai.2025.112451}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112451}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Region-based weighting-and-enhancement network with adaptive class weighting loss for postoperative inguinal hernia prediction}, volume = {162}, year = {2025}, }
• (2025). Predicting thermal transport of blood-based penta-hybrid nanofluid in fin geometries using deep neural networks and finite difference approach. EAAI, 162, 112450. (www)

  @article{ , abstract = {Nanofluids have garnered significant research interest due to their enhanced heat transfer and thermal characteristics. A novel hybrid nanofluid has exhibited exceptional thermal properties, combining five nanoparticles of uniform shapes with a base fluid, such as blood. This study investigates the influence of fin thickness, varying with length, considering the implications of internal heat production, convection, and thermal radiation processes in rectangular, convex, and triangular fin descriptions. Wet scenarios are interpreted to evaluate differences in thermal energy dynamics for fin shapes like Rectangular, Convex and Triangular. Darcy's model is employed to account for the material's porous nature. A finite difference scheme, implemented using Partial Differential Equation solver (PDSolve) in Maple (2024), provides graphical insights into fin effectiveness and thermal steady-state responses across various parameters. Incorporating Penta hybrid nanofluids enhances fin performance, with rectangular fins' Nusselt numbers (up to 1.936) proving more efficient, delivering faster thermal responses than triangular fins and convex fins. Further, using the Adam Optimisation algorithm, Convolutional Neural Networks were used to validate the current model. It was observed that these networks could accurately forecast the truth values, and the two findings matched, as indicated in Table 3 As a potential biological application, this research offers insight into optimising cooling systems for biomedical devices, such as heat exchangers in artificial organs.}, archive = {J_EAAI}, author = {Maddina Dinesh Kumar and Nehad Ali Shah and Dharmaiah Gurram and Se-Jin Yook}, doi = {10.1016/j.engappai.2025.112450}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112450}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Predicting thermal transport of blood-based penta-hybrid nanofluid in fin geometries using deep neural networks and finite difference approach}, volume = {162}, year = {2025}, }
• (2025). Research on the application of attention mechanism based multi-model fusion in food recommendation platforms. EAAI, 162, 112449. (www)

  @article{ , abstract = {Smartphone-based food ordering has greatly enhanced convenience in daily life, and the rise of recommendation systems has transformed the functionality and user experience of food delivery applications. Innovations in recommendation algorithms and models have significantly improved the efficiency of food, merchant, and advertisement recommendations on food platforms, leading to higher transaction rates and greater user satisfaction. To further enhance recommendation efficiency, this study introduces a novel multi-model fusion recommendation architecture based on the multi-head self-attention mechanism, utilizing a two-tier structure. The first-tier model (the attention-based homogeneous AutoInt model) acts as a teacher to guide the training of the second-tier Transformer model. This hierarchical approach integrates multiple models through knowledge distillation, significantly improving the accuracy of the recommendation system. The complexity and performance of the proposed architecture were analyzed and applied in a production environment. Testing on a private dataset reveals that the proposed multi-model fusion recommendation architecture significantly enhances recommendation performance across various food platform scenarios, achieving an accuracy of 0.7643, recall of 0.8262, and an F1 score of 0.7936. These results surpass the performance of current state-of-the-art models. Therefore, the proposed architecture is not only highly applicable to food recommendation systems but also has broad applicability in other fields such as retail and entertainment.}, archive = {J_EAAI}, author = {Linchao Zhang and Lei Hang}, doi = {10.1016/j.engappai.2025.112449}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112449}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Research on the application of attention mechanism based multi-model fusion in food recommendation platforms}, volume = {162}, year = {2025}, }
• (2025). Identifying fake reviews for refund purposes: Evaluating the effectiveness of a transfer-learning model against emerging large language models. EAAI, 162, 112448. (www)

  @article{ , abstract = {Background: Recently, dishonest sellers are using social platforms to advertise products that can be purchased for free through a refund mechanism, which is based on the writing of five-star fake reviews. The aim is to increase product visibility by influencing their ranking compared to similar products. This mechanism is leading to a significant distortion of e-commerce platforms, eroding trust among customers and sellers. Objective: In this paper, we address the problem of identifying fake reviews, aiming to provide an approach for mitigating fraudulent practices that compromise the integrity and transparency of e-commerce platforms. Methods: We propose a supervised model tailored for identifying fake reviews for refund purposes and compare its performance with some of the most recent generative models. Since, to the best of our knowledge, no datasets exist in the literature suitable for fake review identification in the process of Purchasing, Requesting reviews, and Refunding a product, we first proposed a new dataset of fake and genuine reviews from Amazon, collected with the help of a domain expert. Then, we defined five other new datasets containing reviews automatically generated by language models. To interact with these models, we designed new prompt approaches specifically tailored to our goal, which exploit the iterative refinement behind these models for improving classification results. Results: Experimental results demonstrated the effectiveness of the supervised model in detecting both types of fake reviews, outperforming state-of-the-art models with improvements ranging from 0.23 to 0.70 in terms of accuracy, precision, and recall.}, archive = {J_EAAI}, author = {Loredana Caruccio and Gaetano Cimino and Stefano Cirillo and Vincenzo Deufemia and Giuseppe Polese and Giandomenico Solimando}, doi = {10.1016/j.engappai.2025.112448}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112448}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Identifying fake reviews for refund purposes: Evaluating the effectiveness of a transfer-learning model against emerging large language models}, volume = {162}, year = {2025}, }
• (2025). Enhanced multi-modal emotion recognition using the feature level fusion. EAAI, 162, 112447. (www)

  @article{ , abstract = {Multi-modal human emotion recognition is a complex process of synthesizing information from various modalities to calculate emotion states. This field faces several challenges: (1) Acoustic is an essential component of emotion expression, but it often underperforms compared to visual and text in emotion recognition. (2) Capturing the feature interaction among different modalities is usually complex. (3) Processing high-definition videos can significantly reduce the efficiency of visual analysis. In this study, we presented a learning architecture designed to recognize human emotions effectively. For the first challenge, we implemented a multi-level acoustic encoder (MLAE) that enhances the extraction of acoustic information to improve the acoustic contribution in multi-modal emotion recognition. Facing the second challenge, we introduced the cross-attention block module, which adeptly captures the inter-modal interactions. To address the third challenge, we adopted the re-parameterized visual geometry group network (RepVGG) as the visual feature encoder, employing its multi-branch learning and single-branch reasoning structure to maintain high reasoning efficiency. Our model has demonstrated the state-of-the-art performance of the interactive emotional dyadic motion capture (IEMOCAP) dataset and the multi-modal opinion sentiment and emotion intensity of the Carnegie Mellon University (CMU-MOSEI) dataset.}, archive = {J_EAAI}, author = {Aziguli Wulamu and Yuheng Wu and Xin Liu and Yao Zhang and Jinghan Xu and Yang Zhang}, doi = {10.1016/j.engappai.2025.112447}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112447}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhanced multi-modal emotion recognition using the feature level fusion}, volume = {162}, year = {2025}, }
• (2025). Deep adaptive wavelet autoencoder with mutually independent empirical cumulative distribution for unsupervised motor anomaly detection. EAAI, 162, 112446. (www)

  @article{ , abstract = {—Permanent magnet synchronous motors (PMSMs) are widely used in industrial applications but remain vulnerable to stator faults, such as inter-coil and inter-turn short circuits. Although recent deep learning-based fault detection methods have shown promise, they typically rely on large volumes of labelled fault data for training. To address this limitation, this paper proposes a novel unsupervised fault detection framework, termed Deep Adaptive Wavelet Autoencoder (DAWA) with Mutually Independent Empirical Cumulative Distribution (MIECD), specifically designed for PMSM fault detection. DAWA utilizes convolutional neural networks to learn adaptive wavelet filters through fast discrete wavelet transform, allowing for fully learnable, threshold-free extraction of fine-grained signal patterns. The resulting latent features are then mapped by MIECD into a mutually independent space via independent component analysis (ICA). Without assuming any prior data distribution, MIECD estimates empirical cumulative distributions (ECDs), computes tail probabilities across dimensions, and aggregates them into a unified anomaly score. Experimental results on motor vibration datasets demonstrate the effectiveness of the proposed method, showing average accuracy improvements of 15.85 % for Interturn and 15.16 % for Intercoil fault detection compared to conventional data-driven baselines across various operating conditions.}, archive = {J_EAAI}, author = {Pinze Ren and Ning Zhu and Dandan Peng and Liyuan Ren and Huan Wang}, doi = {10.1016/j.engappai.2025.112446}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112446}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Deep adaptive wavelet autoencoder with mutually independent empirical cumulative distribution for unsupervised motor anomaly detection}, volume = {162}, year = {2025}, }
• (2025). Dynamic vision-based machine vibration sensing and fault diagnosis with signal alignment and feature clustering. EAAI, 162, 112445. (www)

  @article{ , abstract = {In recent years, intelligent fault diagnosis methods for machines have been widely developed. The contact accelerometer has been popularly used with high measurement accuracy. However, in many industrial applications, non-contact sensors are often preferred due to practical constraints. The event camera is a novel bio-visual sensing technology for asynchronously capturing pixel-wise changes in brightness. It has various advantages including high measurement rate, exceptional resolution, wide dynamic range, etc., which thus has promising prospects in non-contact monitoring and fault diagnostic tasks. Despite these advantages, the high complexity of the dynamic vision data from the event cameras poses significant processing challenges, and the extraction of machine vibration information is of great difficulties. To address these challenges, this paper proposes a novel dynamic vision-based machine vibration sensing and fault diagnosis method. First, the dynamic vision data is reconstructed into event frame sequences. Next, a deep neural network is proposed to extract the micro-vibration information with feature clustering for enhancing model robustness. A signal alignment method is further proposed where the contact sensing data are used as a reference for optimizing model performance. Finally, the intelligent fault diagnosis is implemented with the estimated vibration data. Experimental validations are conducted with real rotating machine data, which demonstrate the promising applicability of the proposed method in non-contact machine vibration sensing and fault diagnosis.}, archive = {J_EAAI}, author = {Ruiyi Guang and Xiang Li and Yaguo Lei and Bin Yang and Naipeng Li}, doi = {10.1016/j.engappai.2025.112445}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112445}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dynamic vision-based machine vibration sensing and fault diagnosis with signal alignment and feature clustering}, volume = {162}, year = {2025}, }
• (2025). A reliable degradation prediction method for proton exchange membrane fuel cells based on uncertainty bayesian self-attention. EAAI, 162, 112444. (www)

  @article{ , abstract = {Health state prediction of Proton Exchange Membrane Fuel Cells (PEMFCs) is a critical technology to ensure their long-term reliable operation. Prediction accuracy directly influences the effectiveness of maintenance strategies and risk management. However, existing PEMFC degradation prediction methods based on Recurrent Neural Networks (RNNs) or Transformer architectures mostly focus on point estimation while neglecting uncertainty quantification. This limitation makes it difficult to assess the confidence level of predictions in practical engineering applications, reducing the models' reliability in decision support. To address this issue, this paper proposes a novel Bayesian Patch Time Series Transformer (B-PatchTST) method. By deeply integrating Bayesian variational inference with time series patch modeling, the method enables probabilistic prediction of PEMFC degradation trajectories and disentangled analysis of uncertainty sources. Unlike traditional Bayesian Neural Networks (BNNs) that primarily apply Bayesian modeling to fully connected layers, B-PatchTST introduces a Bayesian Self-Attention Mechanism, which models epistemic uncertainty in three stages: patch embedding, uncertainty-aware self-attention computation, and adaptive regularization. This design significantly enhances the credibility of the model. Extensive experiments on the fuel cell datasets demonstrate the proposed method's outstanding performance. It achieves an average reduction of 36.31 % in root mean square error and an average compression of 83.39 % in the 95 % confidence interval, significantly outperforming existing methods. This approach offers a trustworthy basis for predictive maintenance in PEMFC systems, promoting a shift from “experience-based maintenance” to “reliable prognostics” in hydrogen energy applications.}, archive = {J_EAAI}, author = {Mengyu Liu and Zhe Cheng and Yu Yang and Niaoqing Hu and Guoji Shen and Yi Yang}, doi = {10.1016/j.engappai.2025.112444}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112444}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A reliable degradation prediction method for proton exchange membrane fuel cells based on uncertainty bayesian self-attention}, volume = {162}, year = {2025}, }
• (2025). Knowledge-data synergy enabling zero-shot composite fault diagnosis in sucker-rod pumping systems. EAAI, 162, 112443. (www)

  @article{ , abstract = {Zero-Shot Learning Accurate and comprehensive fault diagnosis is critical to ensuring production efficiency and extending equipment lifespan in oilfield operations. However, most existing diagnostic methods for sucker rod pumping systems are limited to single-fault identification, while the scarcity and high acquisition cost of compound fault samples hinder the application of supervised learning. To address these challenges, this paper proposes a zero-shot compound fault diagnosis framework that integrates domain knowledge with data-driven representations, enabling the identification of unseen fault using only single-fault samples. First, a unified semantic space is constructed by jointly embedding text-based fault descriptions and capsule-encoded load features. Then, a semantics-guided weakly supervised attribute composition strategy is introduced to enhance the completeness and discriminability of the semantic space. Finally, a bidirectional contrastive learning mechanism is established between visual encodings and semantic representations, and an adaptive multi-task loss weighting strategy is employed to optimize the overall framework efficiently. Experiments on real-world oilfield data demonstrate that the proposed method achieves an F1-score of 86.15 % under the zero-shot setting and 69.08 % under the generalized zero-shot setting, offering an effective and scalable solution for compound fault diagnosis in oil wells.}, archive = {J_EAAI}, author = {Xin-yan Wang and Li-ming Zhang and Kai Zhang and Cheng Cheng}, doi = {10.1016/j.engappai.2025.112443}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112443}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Knowledge-data synergy enabling zero-shot composite fault diagnosis in sucker-rod pumping systems}, volume = {162}, year = {2025}, }
• (2025). Edge computing and server-based high-precision flood level classification system. EAAI, 162, 112442. (www)

  @article{ , abstract = {Urban flooding and the resulting road water accumulation have become a significant threat to public transportation safety and the stability of municipal infrastructure. Traditional monitoring networks based on physical water level sensors suffer from low deployment density, high maintenance costs, and lagging response times. To address these shortcomings of traditional water accumulation monitoring systems, this study proposes an edge-computing intelligent monitoring system based on collaborative inference between the edge end (You Only Look Once version 5, YOLOv5) and the server end (Transform Vision Detection, TrVDet). A dual-modal perception architecture of “edge-end triggering and server-end precise analysis” has been constructed. At the edge end, the YOLOv5 model is deployed on embedded devices to achieve efficient preliminary screening of water accumulation, reducing dependence on the central server, lowering latency, and enhancing real-time response capabilities. On the server end, multi-object segmentation is performed on the detected water accumulation images, including roads, cars, motorcycles, and bicycles. Finally, a series of logical judgments is applied to determine the water accumulation level based on reference objects within the water. Since there is no publicly available dataset for target object recognition in flooded areas, we employed professional annotators to perform pixel-level labeling on the collected and organized flood data and constructed a multi-class target flood dataset (City Flood Segmentation, CityFloodSeg). Given the scarcity of moderate and severe water accumulation samples, we optimized the instance segmentation model TrVDet under the (A Visual Representation for Neon Genesis, EVA-02) framework and applied five data augmentation methods, including Mosaic and Flip, to expand the diversity of the dataset. Moreover, based on domain expert standards, we designed a logical judgment rule algorithm for model inference of water accumulation levels to classify the levels of water accumulation. Experimental results show that the server-end processing delay is stable within 0.4 s, capable of accurately judging different water accumulation risk levels. This provides centimeter-level real-time situational awareness for urban flood control decision-making and promotes the development of intelligent municipal infrastructure towards higher reliability and universality.}, archive = {J_EAAI}, author = {Ankang Lu and Runlong Cao and Yuanbin Wang and Wenjun Hu and Yuncan Gao and Zhifeng Hu and Ying Zang}, doi = {10.1016/j.engappai.2025.112442}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112442}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Edge computing and server-based high-precision flood level classification system}, volume = {162}, year = {2025}, }
• (2025). WeedNet-X: A lightweight field weed detection algorithm. EAAI, 162, 112441. (www)

  @article{ , abstract = {Accurately distinguishing field weeds from crops and locating weed positions are critical prerequisites in automated weed control operations. However, weed detection and localization in unstructured field environments with complex lighting remains challenging. Firstly, data-driven deep learning based algorithms usually have a high dependence on a large number of training samples, and there are huge differences between field weeds and crops in different regions, growth cycles, and types. In addition, the conflict between hardware performance and computation cost makes it difficult for existing weed detection algorithms to maintain both detection accuracy and speed on low-performance platforms. All these problems increase the difficulty of detection. To solve the above problems, we first construct a medium-to-large weed dataset using an open-source agricultural image dataset and collect field data. Subsequently, we have proposed a lightweight weed detection algorithm using the ShuffleNetv2 network as the backbone network, with a multi-scale pyramid network, and the overall network algorithm is named WeedNet-X. The number of model parameters and the computational volume of the algorithm are only 0.57 million and 0.48 Giga floating point operations (GFLOPs), respectively. On the two constructed datasets, the mean Average Precision (mAP) of the algorithm can reach 86.31 % and 80.98 %, respectively, which are improved by 0.61 % and 3.10 % compared to the baseline model. Finally, the hardware and software systems for weed detection verify the excellence of the proposed algorithm in terms of practical performance.}, archive = {J_EAAI}, author = {Yong Li and Ao Ke and Zhiqiang Guo and Qingji Tan and Jingchao Yang}, doi = {10.1016/j.engappai.2025.112441}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112441}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {WeedNet-X: A lightweight field weed detection algorithm}, volume = {162}, year = {2025}, }
• (2025). Data-driven robust intertwined wheat supply chain: Redesigning a viable network for long-term geopolitical conflicts. EAAI, 162, 112440. (www)

  @article{ , abstract = {The recent human-made conflict in 2022 severely damaged Ukraine's infrastructure, causing significant instability in the food supply chain. This crisis was further exacerbated by trade bans imposed on another major global wheat exporter. Since wheat production and export are intrinsically linked, particularly in times of crisis, it is essential to adopt the concept of an intertwined supply chain. Accordingly, this study proposes an intertwined supply chain framework for the production and export of wheat during long-term disruptions. To enhance the viability of this intertwined system, the study introduces three key strategies. First, it addresses long-term disruptions and operational risks by employing redundancies and data-driven robust optimization techniques, where uncertainty sets are generated using a support vector clustering model. Second, the proposed supply chain accounts for freshwater resource limitations by integrating water resilience measures. Third, as the framework operates within a global context, it incorporates a comprehensive model that considers exchange rates, taxation, foreign demand points, and international trade responsibilities. To optimize these strategies, two multi-objective optimization models are developed and solved using an epsilon-constraint method. A cardinality-based measure is introduced to efficiently represent the Pareto front, offering decision-makers valuable insights into non-dominated solutions. The results are divided into analyses of wheat production, export, and their combined network. Individual analyses assess network setup, viability, and uncertainty control, while the integrated analysis examines sensitivity and interdependence. Overall, improving water use, managing risks, and designing a resilient, interconnected system can greatly strengthen the wheat supply chain during long-term crises.}, archive = {J_EAAI}, author = {Hani Gilani and Mehrdad Mohammadi and Tom Van Woensel and Hadi Sahebi}, doi = {10.1016/j.engappai.2025.112440}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112440}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Data-driven robust intertwined wheat supply chain: Redesigning a viable network for long-term geopolitical conflicts}, volume = {162}, year = {2025}, }
• (2025). A multitask learning-based fault detection approach for high impedance fault in resonant distribution networks. EAAI, 162, 112439. (www)

  @article{ , abstract = {Addressing high impedance faults (HIF) in resonant distribution networks remains a formidable challenge. This paper introduces a multitask learning-based approach integrated with a multitask fault detection network (MTFD-Net), employing three task-specific heads—classification, segmentation, and regression—to enable precise fault detection. MTFD-Net utilizes zero-sequence voltage data and a sliding time window to perform initial coarse classification, which allows the classification head to determine whether a permanent HIF has occurred. Upon detection, MTFD-Net proceeds to pinpoint potential fault moments through the outputs of the segmentation head. The regression head further refines these moments by predicting a reference moment and calculating the distance to each potential fault, effectively isolating the exact fault moment. An industrial prototype was developed and rigorously tested on a 10 kV system, where MTFD-Net demonstrated superior performance, achieving an accuracy of 0.976, an intersection over union of 0.984, and an absolute detection deviation of 5.20 ms. Operating efficiently with inference times ranging from 9.69 to 15.45 miliseconds on a Raspberry Pi 4B, MTFD-Net surpasses existing methods in accuracy, F1-score, sensitivity, specificity, and detection accuracy, providing a robust solution for HIF detection in resonant distribution networks.}, archive = {J_EAAI}, author = {Jian-Hong Gao and Mou-Fa Guo and Shuyue Lin and Duan-Yu Chen}, doi = {10.1016/j.engappai.2025.112439}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112439}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A multitask learning-based fault detection approach for high impedance fault in resonant distribution networks}, volume = {162}, year = {2025}, }
• (2025). Carbon trading price prediction with spikes: A novel hybrid model framework using heuristic multi-head attention convolutional bidirectional recurrent neural network. EAAI, 162, 112438. (www)

  @article{ , abstract = {Accurate forecasting of carbon trading prices (CTPs) with spikes is crucial for developing carbon emission reduction policies and planning corporate investments. However, most existing CTP approaches usually focus on designing a cutting-edge model without considering spike prediction. Therefore, this paper presents a novel heuristic optimization-based hybrid model framework for CTP prediction with spikes. First, random forest is exploited to identify the relevant features of spikes and non-spikes for CTPs, and categorical boosting is employed to predict the spike occurrences of CTPs. Then, a novel hybrid model based on multiple linear regression, categorical boosting, and two dimensions convolutional neural network and bidirectional gated recurrent unit with multi-head regularized attention mechanism (2DCNN-BiGRU-MRA) is proposed to predict spikes and non-spikes for CTPs. In this model, multiple linear regression and categorical boosting are respectively applied to capture the linear and complex nonlinear features of the CTPs, in which their prediction results and deviations are integrated into the 2DCNN-BiGRU-MRA model as relevant features. The proposed 2DCNN-BiGRU-MRA can learn the spatiotemporal features and enhance representation capabilities by introducing 2DCNN, BiGRU, and MRA, thereby improving the accuracy of CTP prediction. In addition, to construct appropriate model hyperparameters of 2DCNN-BiGRU-MRA, the strength honey badger algorithm based on the adaptive momentum estimation is proposed to optimize the hyperparameters of 2DCNN-BiGRU-MRA. Finally, the proposed framework is tested on the actual data of European Union emissions trading and the carbon market in Hubei, China, and case studies have confirmed the superiority and achievable local interpretability of the proposed hybrid model framework.}, archive = {J_EAAI}, author = {Rongquan Zhang and Siqi Bu and Gangqiang Li and Min Zhou}, doi = {10.1016/j.engappai.2025.112438}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112438}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Carbon trading price prediction with spikes: A novel hybrid model framework using heuristic multi-head attention convolutional bidirectional recurrent neural network}, volume = {162}, year = {2025}, }
• (2025). Inter-graph and intra-graph: Utilizing global financial markets and constituent stocks for stock index prediction. EAAI, 162, 112437. (www)

  @article{ , abstract = {Stock index prediction is a significant yet difficult undertaking due to its incorporation of complex and diverse information. Following the implementation of Graph Neural Networks in financial data analysis, numerous researchers have focused on the node-level task of forecasting individual stock movements by analyzing the relationships between stocks. However, two key challenges remain: first, realizing different speeds of feature propagation among nodes in graph representation learning; second, predicting stock indices by extracting and aggregating fluctuations from constituent stocks through graph-level tasks remains unaddressed. To tackle these challenges, this paper proposes a novel spatio-temporal prediction framework combining both node-level and graph-level tasks. The framework includes two types of graphs: inter-graph and intra-graph, which combine information from the micro, meso, and macro dimensions. For the inter-graph at the node level, we introduce the Granger causality test as an innovative node filtering method, which realizes the propagation of features between nodes with different strengths and speeds in the process of graph representation learning. For the intra-graph at the graph level, we examine various graph pooling methods and pooling proportions of stock index constituents to enhance the interpretability of the results and to provide new theoretical insights for stock index prediction. In conclusion, we develop the Graph Representation Learning-based Long Short-Term Memory (GRL-LSTM) model for forecasting stock index movements, and demonstrate the superiority of our approach on four major Chinese stock markets.}, archive = {J_EAAI}, author = {Yong Shi and Yunong Wang and Jie Wu}, doi = {10.1016/j.engappai.2025.112437}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112437}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Inter-graph and intra-graph: Utilizing global financial markets and constituent stocks for stock index prediction}, volume = {162}, year = {2025}, }
• (2025). A novel data-efficient double deep Q-network framework for intelligent financial portfolio management. EAAI, 162, 112436. (www)

  @article{ , abstract = {Navigating the complexities of dynamic and uncertain financial markets demands intelligent systems capable of learning profitable strategies amidst risk and volatility. While Deep Q-Networks (DQN) offer a foundation for such systems, they often suffer from overestimation bias, training instability, and poor generalization in noisy financial environments. To address these challenges, this work introduces Portfolio Double Deep Q-Network (PDQN), a novel architecture inspired by recent advancements in reinforcement learning. PDQN enhances portfolio management by integrating Double Q-Learning to reduce overestimation, alongside Leaky ReLU activation, Xavier initialization, Huber loss, and dropout regularization to improve learning stability and generalization. Unlike prior methods that rely on large datasets and heavy computational infrastructure, PDQN achieves competitive—and often superior—performance using substantially less training data and lightweight infrastructure, making it well-suited for real-world, resource-constrained financial applications. Distinct from conventional approaches, PDQN uses separate networks to adapt portfolio decisions across varying market conditions. Empirical results across multiple market years show that PDQN often outperforms baseline strategies, including classic DQN and Buy-and-Hold, across key metrics such as Sharpe ratio, Sterling ratio, and cumulative return. PDQN—like all data-driven models—exhibits room for improvement under highly irregular or extreme financial scenarios. These observations suggest promising directions for future refinement and increased robustness, without detracting from the model's practical effectiveness and competitive edge.}, archive = {J_EAAI}, author = {Mahshad Alidousti and Morteza Khakzar Bafruei and Amir Hosein Afshar Sedigh}, doi = {10.1016/j.engappai.2025.112436}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112436}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel data-efficient double deep Q-network framework for intelligent financial portfolio management}, volume = {162}, year = {2025}, }
• (2025). Unlocking few-shot wind speed prediction through a novel end-to-end transfer learning paradigm based on decomposition and gating information fusion. EAAI, 162, 112435. (www)

  @article{ , abstract = {Accurate wind speed prediction is one of the key technologies for achieving intelligent and sustainable development in the engineering field. In the field of wind speed prediction, we are confronted with a challenging few-shot prediction problem. Specifically, due to the fact that some wind turbines in wind farms are newly established or there is data loss during the data collection process, these turbines only contain a small amount of wind speed data. This scarcity of data poses great difficulties for the prediction work, and traditional prediction methods often fail to achieve the desired prediction accuracy. In order to overcome the above difficulties, we propose an novel prediction paradigm of end-to-end transfer learning based on data decomposition and gated information fusion. We use the Fourier transform to find the source domain similar to the target domain to achieve feature alignment. Then, we pre-train the model on the source domain and transfer this model to the target domain, thus solving the problem of low prediction accuracy when directly predicting the target domain. In the first step, the data is decomposed and denoised by using the Variational Mode Decomposition. According to the sample entropy, the decomposed data is reorganized into three frequency components. Each component is input as an independent channel into the end-to-end prediction model. Firstly, the features of each channel are expanded to a high-dimensional space through the Multilayer Perceptron. Then, the gating mechanism is utilized to mix the features of the three channels into the features of one channel, thus achieving information fusion. Finally, the prediction result of the end-to-end model is output through the Gated Recurrent Unit. In the second step, the model pre-trained on the source domain is transferred to the small-sample target domain. The Dynamic Time Warping and cosine similarity are used to quantify the similarity of each channel between the two domains. The parameters of the channels with high similarity are locked, and at the same time, the parameters of other channels are fine-tuned to output the final prediction result. In addition, multiple sets of comparative experiments conducted using the wind speed data from wind farms in Queensland, Australia, have demonstrated the superiority of this prediction paradigm. Our strategy outperforms various baseline models in all three sets of data. Moreover, ablation experiments have proven the effectiveness of each component in this framework in improving prediction accuracy, opening up a new path for solving the difficult problem of few-shot prediction in practical engineering.}, archive = {J_EAAI}, author = {Xiaoyue Dong and Zhirui Tian}, doi = {10.1016/j.engappai.2025.112435}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112435}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Unlocking few-shot wind speed prediction through a novel end-to-end transfer learning paradigm based on decomposition and gating information fusion}, volume = {162}, year = {2025}, }
• (2025). A hyperparameter-fusion neural networks for deposition prediction. EAAI, 162, 112434. (www)

  @article{ , abstract = {As integrated circuit manufacturing processes develop into the nanometer scale, precise control and prediction of the deposition process have become crucial. Nanoscale manufacturing imposes unprecedentedly high demands on film quality, uniformity, and consistency, presenting significant challenges to traditional control and prediction methodologies. This study proposes a novel approach that, for the first time, formulates the thin-film deposition process as a video prediction task, enabling the use of deep learning for morphological forecasting under varying process conditions, and introduces a novel hyperparameter-fusion neural network, referred to as DepositionNet (DepoNet). Unlike conventional video prediction models, DepoNet specifically accounts for the influence of deposition parameters on the entire simulation process. We have incorporated a novel Hyper Projector that allows the model to flexibly adapt to varying deposition conditions and material characteristics. Through comprehensive comparative experimental analyses, we demonstrate that DepoNet significantly outperforms existing deep-learning models and achieves a mean squared error of 17.34, representing a 3.67% improvement over the second best model and a 1,435 × speedup over physics-based methods, thereby validating its exceptional generalization capability. Extensive experiments reveal that the model maintains high performance even under conditions of limited training data, for instance, achieving a peak signal-to-noise ratio (PSNR) of 41.516 decibels (dB) when trained with only 20% of the available data.}, archive = {J_EAAI}, author = {Li Ding and Kun Pang and Junjie Li and Hua Shao and Nan Liu and Rui Chen and Zhiqiang Li and Zhenjie Yao and Ling Li}, doi = {10.1016/j.engappai.2025.112434}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112434}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A hyperparameter-fusion neural networks for deposition prediction}, volume = {162}, year = {2025}, }
• (2025). Overcoming challenges in leveraging blockchain technology: Entropy-based q-rung orthopair fuzzy model for benchmarking application barriers. EAAI, 162, 112433. (www)

  @article{ , abstract = {Blockchain technology has emerged as a transformative solution across industries, delivering enhanced transparency, security, and operational efficiency. Nevertheless, its adoption remains hindered by significant challenges, especially in complex, data-intensive domains such as logistics. This study introduces a novel integration of the entropy-based q-rung orthopair fuzzy compromise ranking of alternatives from distance to ideal solution (CRADIS) approach to systematically evaluate and prioritize key barriers to blockchain adoption. The innovation of this work lies in applying q-rung orthopair fuzzy sets which are particularly capable of handling higher degrees of uncertainty and hesitancy, and then integrated with entropy for objective criterion weighting and CRADIS for robust decision-making. A real-world case study is presented, involving five critical barriers, lack of legal and regulatory frameworks, high implementation costs, technological scalability issues, data privacy and security concerns, and cultural resistance to change evaluated against eight decision criteria. The entropy weighting revealed regulatory clarity (0.168) and security (0.154) as the most influential factors, while the CRADIS ranking identified a lack of legal frameworks as the top barrier. This framework provides a transparent, data-driven method for decision-makers to identify and prioritize adoption challenges, particularly in uncertain and multi-faceted environments. By demonstrating the model’s applicability and precision, the study contributes to the emerging body of literature on blockchain integration and supports organizations in navigating the transition towards decentralized technologies.}, archive = {J_EAAI}, author = {Sana Shahab and Naoufel Kraiem and Ashit Kumar Dutta and Mohd Anjum and Vladimir Simic and Dragan Pamucar}, doi = {10.1016/j.engappai.2025.112433}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112433}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Overcoming challenges in leveraging blockchain technology: Entropy-based q-rung orthopair fuzzy model for benchmarking application barriers}, volume = {162}, year = {2025}, }
• (2025). Dual angle magnetic arc blow estimation in keyhole tungsten inert gas welding using high dynamic range imaging and a lightweight vision transformer network with coordinate attention and multiple auxiliary branches. EAAI, 162, 112432. (www)

  @article{ , abstract = {In high current Keyhole Tungsten Inert Gas (K-TIG) welding, magnetic arc blow frequently causes severe defects such as lack of fusion and undercut, which seriously affect weld formation quality. Conventional visual sensing systems are limited by dynamic range, making it difficult to capture arc morphology, while single angle descriptors fail to represent nonlinear deflection and lightweight convolutional models struggle with long range dependencies. To address these challenges, this study employs a High Dynamic Range (HDR, 120 decibel [dB]) imaging system to capture detailed arc variations and proposes a lightweight Vision Transformer (ViT) network with embedded Coordinate Attention (CA) and multiple auxiliary branches for real time angle estimation. A custom magnetic excitation system enables controllable arc blow simulation and consistent data acquisition. The method introduces a dual angle representation, namely the maximum curvature angle ( θ curv ) and the equivalent deviation angle ( θ eq ), to comprehensively describe arc geometry. The Artificial Intelligence (AI) framework integrates segmentation, keypoint localization, and regression tasks to improve accuracy and robustness. Trained on a self constructed HDR dataset containing 3,191 annotated images, model achieves a mean absolute error (MAE) of 1 . 12 ° , a root mean square error (RMSE) of 2 . 84 ° , a determination coefficient ( R 2 ) of 0.96, and a per frame inference latency of 12.96 ms (ms) on an NVIDIA RTX 2080Ti graphics processing unit (GPU). These results demonstrate that AI based methods combined with HDR imaging cannot only achieve accurate monitoring of welding arc states, but also provide potential support for closed loop control in all position welding applications.}, archive = {J_EAAI}, author = {Xiyin Chen and Xiaohu Zhang and Yonghua Shi and Yuxiang Huang and Junjie Pang}, doi = {10.1016/j.engappai.2025.112432}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112432}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dual angle magnetic arc blow estimation in keyhole tungsten inert gas welding using high dynamic range imaging and a lightweight vision transformer network with coordinate attention and multiple auxiliary branches}, volume = {162}, year = {2025}, }
• (2025). Plug-and-play dynamic optimization for three-dimensional gaussian generation. EAAI, 162, 112431. (www)

  @article{ , abstract = {Recent advancements in Three-Dimensional (3D) asset generation have demonstrated remarkable progress in generation efficiency, enabling transformative applications across creative industries and mission-critical domains including autonomous systems. Current 3D asset generation primarily employs Score Distillation Sampling (SDS) to derive 3D priors from Two-Dimensional (2D) diffusion models. While this contribution ensures high generation quality, it is time-consuming. Recent methods have utilized 3D Gaussian Splatting for image rendering, which, despite enhancing generation speed, compromised on quality. Our method aims to balance the quality and speed of 3D asset generation by designing a plug-and-play optimization process that combines the strengths of both methods. We propose a rapid 3D Gaussian generation framework that begins with constructing a pipeline to generate multi-view images from text input using pre-trained generative models. Then our method utilizes 3D Gaussian Splatting for quick 3D asset initialization and subsequently performs detail optimization using Gaussian Filter and SDS-based 2D diffusion model optimizer. Additionally, we have optimized the loss function for 3D Gaussian Splatting and ensured the entire optimization process is plug-and-play, offering high generation quality and speed. Our method demonstrates strong adaptability in representative single-object 3D Gaussian generation tasks, indicating promising generalization potential. Achieving high-quality 3D generation on a single Graphics Processing Unit (GPU), our framework outperforms most popular optimization-based models in generation speed (5 × speedup +). Furthermore, when juxtaposed with the latest inference-based models, our optimization architecture offers a notable enhancement in generation quality (Contrastive Language-Image Pre-Training Score 33.8 vs. 27.3) within an acceptable amount of time.}, archive = {J_EAAI}, author = {Qixuan Li and Haoyang Li and Chao Wang and Yang Zhou and Yan Peng}, doi = {10.1016/j.engappai.2025.112431}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112431}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Plug-and-play dynamic optimization for three-dimensional gaussian generation}, volume = {162}, year = {2025}, }
• (2025). A diffusion model using semantic and sketch information for anomaly detection. EAAI, 162, 112430. (www)

  @article{ , abstract = {In anomaly detection, methods that employ diffusion models for anomaly localization and reconstruction have demonstrated significant achievements. However, these methods face challenges such as the misclassification of multiple types of anomalies and the inability to effectively reconstruct large-scale anomalies due to the absence of semantic and sketch information from the original images. To tackle these challenges, we propose a framework, A Diffusion Model using Semantic and Sketch Information for Anomaly Detection (DSAD), which includes a semantic and sketch-guided network (SSG), a pre-trained autoencoder, and Stable Diffusion (SD). Initially, within SSG, we introduce a Semantic & Sketch Feature Fusion Module to enhance the model’s comprehension of the original images and present a Multi-scale Feature Fusion Module to maximize reconstruction accuracy. Subsequently, we connect SSG with the denoising network in SD in order to guide the network in reconstructing anomalous regions. Experiments on MVTec-AD dataset demonstrate the effectiveness of our approach which surpasses the state-of-the-art methods. The dataset and code are available at https://github.com/QinLi-STUDY/DSAD/tree/master .}, archive = {J_EAAI}, author = {Li Qin and Zhenyu Yin and Feiqing Zhang and Chunhe Song and Xiaoqiang Shi}, doi = {10.1016/j.engappai.2025.112430}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112430}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A diffusion model using semantic and sketch information for anomaly detection}, volume = {162}, year = {2025}, }
• (2025). A real-time spatiotemporal error compensation framework for face gear grinding. EAAI, 162, 112429. (www)

  @article{ , abstract = {Geometric and thermal errors critically affect the precision of face gear grinding, yet current modeling approaches are computationally intensive and lack real-time adaptability. This study proposes a real-time spatiotemporal error compensation framework for face gear grinding. A closed-loop feedback mechanism is introduced to adaptively update compensation intensity based on residual error feedback, ensuring robustness and efficiency under fluctuating machining conditions. Moreover, a novel spatial-temporal thermal error model is developed by integrating Taylor-graph convolutional network and modified-long short term memory network to capture both node-level spatial fusion and long-term temporal dependencies. High-order terms in geometric error modeling are eliminated using a vector decomposition and truncation-based approach, significantly reducing computational complexity. Furthermore, a high-efficiency multi-source error-tooth flank mapping model is developed based on vector decomposition and truncation function methods, enabling accurate prediction with reduced computational cost. To identify dominant error contributors, an improved Morris-based sensitivity analysis method is integrated, distinguishing geometric and thermal errors affecting tooth flank deviation. Experimental results demonstrate sub-65 ms real-time response, 24.2 μm maximum error reduction, and robust adaptability under fluctuating machining conditions. Compared with recent gear-flank compensation studies, the proposed closed-loop framework achieves a 63.4 % reduction in maximum normal flank error under real machining and <65 ms response latency. This level is comparable to reported reductions based on grid-aggregated metrics in spiral bevel gears (76.82 % reduction of the sum of absolute grid errors), while additionally ensuring real-time, delay-aware execution. These findings validate the proposed system's potential for precision, real-time compensation in multi-axis manufacturing environments.}, archive = {J_EAAI}, author = {Jialan Liu and Chi Ma and Mingming Li and Jialong He and Giovanni Totis and Chunlei Hua and Gangwei Cui and Liang Wang and Ruijun Xue and Zhi Tan and Jun Yang and Kuo Liu and Yuansheng Zhou and Jianqiang Zhou and Xiaolei Deng and Shengbin Weng}, doi = {10.1016/j.engappai.2025.112429}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112429}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A real-time spatiotemporal error compensation framework for face gear grinding}, volume = {162}, year = {2025}, }
• (2025). Multilayer perceptron-based offspring prediction model for constrained multi-objective optimization. EAAI, 162, 112428. (www)

  @article{ , abstract = {Constrained multi-objective optimization problems generally have both multiple constraint violations and conflicting objective functions. Some of them not only have sparse feasible regions, but also are difficult to converge. For these problems, the evolutionary operators used in traditional constrained multi-objective evolutionary algorithms (CMOEAs) are difficult to generate solutions with ideal quality. Therefore, this paper proposes a multilayer perceptron-based offspring prediction model for constrained multi-objective optimization (MOPCMO). Specifically, an evolutionary direction guidance strategy is designed that utilizes historical populations as training data to train a multilayer perceptron, which guides the evolution of the population by predicting and generating offspring, thereby improving the overall evolutionary efficiency of the algorithm. In addition, as the population iterates, evolutionary direction guidance strategy adaptively transforms the training data of multilayer perceptron. Finally, the multilayer perceptron is intermittently updated and uses an evolutionary direction guidance strategy to generate promising offspring, guiding the algorithm to achieve efficient search. Compared with seven state-of-the-art CMOEAs on 33 benchmark test problems and 8 engineering application problems, MOPCMO achieves excellent performance.}, archive = {J_EAAI}, author = {Qianlong Dang and Ruihuan Luo and Linlin Xie and Xiaochuan Gao and Weiting Bai}, doi = {10.1016/j.engappai.2025.112428}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112428}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multilayer perceptron-based offspring prediction model for constrained multi-objective optimization}, volume = {162}, year = {2025}, }
• (2025). Fault diagnosis via multi-sensor fusion with auxiliary contrastive learning and phased fine-tuning. EAAI, 162, 112427. (www)

  @article{ , abstract = {Typically, deep learning-based fault diagnosis models fail to fully utilize the potential information in large amounts of normal state data and encounter difficulties when learning from limited fault samples. To address these challenges, this study proposes an auxiliary contrastive learning framework designed for multi-sensor data. The framework incorporates auxiliary classifiers after each sensor-specific branch to enhance feature representation, and enables model pretraining using only normal condition data. In addition, a phased fine-tuning strategy is developed, which combines full-model fine-tuning with lightweight adapter tuning to improve the adaptability of the fine-tuning process. A novel multi-sensor data augmentation technique is also introduced to enrich the contrastive learning tasks by generating structurally diverse negative samples. By enabling the effective utilization of normal condition data in model training, the proposed framework offers a new perspective for fault diagnosis applications. Experimental results on three benchmark datasets demonstrate that the proposed method significantly improves the generalization capability of the pre-trained model. Furthermore, the phased fine-tuning strategy exhibits high adaptability to the target tasks. Compared to other data fusion methods, the proposed auxiliary contrastive learning framework achieves notable performance advantages.}, archive = {J_EAAI}, author = {Yulin Jin and Xiaochuan Luo and Xiangwei Kong and Yulin Zhang}, doi = {10.1016/j.engappai.2025.112427}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112427}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Fault diagnosis via multi-sensor fusion with auxiliary contrastive learning and phased fine-tuning}, volume = {162}, year = {2025}, }
• (2025). Damage and energy dissipation prediction and multi-objective optimization design of latticed concrete-filled steel tube column-composite box girder joints based on extreme gradient boosting. EAAI, 162, 112426. (www)

  @article{ , abstract = {To optimize joint performance, a finite element (FE) model is developed based on low-cycle reciprocating load tests of latticed concrete-filled steel tubular (CFST) column-composite box girder joints. The FE-predicted hysteresis curves are compared with test results to verify model accuracy, and a data set is established accordingly. Extreme Gradient Boosting (XGBoost) algorithm is used for training and prediction, and compared with the traditional machine learning (ML) algorithm, the superiority of the XGBoost algorithm is manifested. The XGBoost algorithm is then used to predict the damage and energy values of the joint under more different parameter combinations, with the largest ratio of damage value to energy dissipation value selected as the optimal combination of the joints within the variation range of the six parameters. The results show that the FE model correlates well with the test results and can therefore be used to generate a data set. The prediction accuracy of XGBoost algorithm has high accuracy of more than 99 % in predicting damage and energy dissipation values and can thus be used for joint prediction research. Compared with other ML algorithms, XGBoost has the best prediction performance and superiority. Within the variation range of the six parameters, the ratio of damage value to energy dissipation value is the largest when the concrete strength, longitudinal bar diameter, concrete slab thickness, box girder strength, axial compression ratio, and transverse stiffener strength are respectively 30 Mega Pascal (MPa), 12 mm (mm), 90 mm, 390 MPa, 0.3, and 455 MPa.}, archive = {J_EAAI}, author = {Zhi Huang and Xin Deng and Juan Chen and Xiang Li and Lizhong Jiang and Yohchia Frank Chen and Yuner Huang and Lin Chen}, doi = {10.1016/j.engappai.2025.112426}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112426}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Damage and energy dissipation prediction and multi-objective optimization design of latticed concrete-filled steel tube column-composite box girder joints based on extreme gradient boosting}, volume = {162}, year = {2025}, }
• (2025). Multi-dimensional feature fusion network design and performance optimisation for small target detection. EAAI, 162, 112425. (www)

  @article{ , abstract = {Due to the long distance of image acquisition, high imaging resolution, complex feature background, shooting angle, etc. The result is that there are few features available for small targets and they are easily interfered by background noise, which poses a challenge to the detection of small targets. To address the above problems, this paper proposes a target detection network (Convolution-based Small Target Detection Network, CSTDNet) with enhanced feature information, which integrates a multi-dimensional information fusion strategy for small target features. An all-round efficient feature fusion mudule (AeFusion) is introduced, which emphasises the fusion of multi-dimensional feature information, enhances the model's ability to focus on key information and suppress redundant information, and strengthens the ability to characterise local features and details, improving the effectiveness of the information and computational efficiency. In order to further enhance the location-awareness capability in cross-layer interaction, this paper introduces a novel decoupling head (Self-aware task decomposition for fine-grained feature sharing, STFS), which improves the accuracy of the small-target classification and localisation tasks through efficient detail sharing and task auto-alignment functions. And localisation tasks through efficient detail sharing and task auto-alignment. This study evaluates the effectiveness of the algorithm on five different scenarios containing small target datasets. Experimental results show that CSTDNet achieved improvements of 6.6 %, 5.8 %, 5.8 %, 5.5 %, and 5.6 % over the baseline model in terms of the mean average precision (mAP@0.5) metric on the Visdrone 2019, BDD100K, WiderPerson, SODA10M, and AppleDatas datasets, respectively, demonstrating stronger detection performance.}, archive = {J_EAAI}, author = {Xiaoyao Yang and Wenyang Zhao and Pengchao Sun and Wenda Zhao and Wenlong Yang}, doi = {10.1016/j.engappai.2025.112425}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112425}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multi-dimensional feature fusion network design and performance optimisation for small target detection}, volume = {162}, year = {2025}, }
• (2025). FDFNet: Feature-decision dual fusion network for intelligent fault diagnosis of rotating machinery under varying speed conditions. EAAI, 162, 112423. (www)

  @article{ , abstract = {Fault diagnosis is a critical technique for enhancing the reliability and security of rotating machinery. Existing diagnosis methods still have restricted generalization performance under speed variations owing to inadequate utilization of multisensor information. To address this problem, a novel feature-decision dual fusion network is proposed for fault diagnosis of rotating machinery under varying speed conditions. First, for each sensor, the frequency information learner is built to simultaneously extract global and local frequency domain features using global and local feature encoders. These features are then fused through a cross-attention mechanism to generate a sensor-specific initial classification decision. Subsequently, these individual sensor-wise decisions are fed into the decision dynamic ensemble to yield final fault diagnosis result. Moreover, an adaptive optimization strategy is designed to guide model learning generalizable features by flexibly adjusting the sensor loss weights during training. Finally, the effectiveness of the proposed method is validated on bearing and gearbox datasets. Experimental results demonstrate that the proposed method exhibits superior generalization and robustness for fault diagnosis under varying speed conditions.}, archive = {J_EAAI}, author = {Qi Deng and Zuoxiu Zhang and Xuyuan Tu and Zimuzhi Wang and Jun Wu}, doi = {10.1016/j.engappai.2025.112423}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112423}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {FDFNet: Feature-decision dual fusion network for intelligent fault diagnosis of rotating machinery under varying speed conditions}, volume = {162}, year = {2025}, }
• (2025). Resource-efficient cross-subject emotion recognition from electroencephalogram via spiking domain discriminators. EAAI, 162, 112422. (www)

  @article{ , abstract = {Real-time emotion recognition poses a significant challenge in electroencephalogram (EEG) based emotion recognition, as it requires the immediate processing of EEG data. This necessity imposes substantial demands on the model’s resource consumption. To address this issue, this paper introduces a novel approach to EEG emotion recognition using a Cross Domain Spiking Convolutional Network (CDSCN), focusing on developments in the design of the spiking convolutional block. To address individual differences, the CDSCN incorporates Z-Score normalization at the feature level and introduces a spiking domain discriminator at the model level. These innovations aim to mitigate variations in data distribution across individuals and domains, thereby enhancing the model’s robustness and generalizability. Additionally, the CDSCN introduces a novel pooling fusion layer within the spiking convolutional block to optimize computational efficiency while preserving discriminative performance. Experimental evaluations on two publicly available datasets validate the effectiveness of the proposed CDSCN in achieving both accurate and generalized emotion recognition.}, archive = {J_EAAI}, author = {Dongdong Li and Shengyao Huang and Yujun Shen and Zhe Wang}, doi = {10.1016/j.engappai.2025.112422}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112422}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Resource-efficient cross-subject emotion recognition from electroencephalogram via spiking domain discriminators}, volume = {162}, year = {2025}, }
• (2025). Lightweight deep learning based solar cells defect detection using electroluminescence images. EAAI, 162, 112421. (www)

  @article{ , abstract = {Solar cells are the fundamental core energy harvesting components in photovoltaic (PV) power generation stations. In view of the capability of detecting the invisible defects, the electroluminescence (EL) imaging is broadly used in the production lines of solar cells, based on which the deep learning technique is introduced to implement automatic defect detection and classification. However, the current deep learning models feature high complexity and require much computation resources, which are difficult to deploy in edge devices for real time applications. To tackle this issue, we proposed a novel lightweight and high-precision deep learning model named Cross Stage Partial Photovoltaic-You Only Look Once (CSPV-YOLO) based on the deep learning framework You Only Look Once v5 (YOLOv5) to enable the real-time solar cell defect detection. Firstly, a new module Cross Stage Partial C5 (CSPC5) is proposed to replace the initial C3 module in the YOLOv5 network to enhance the network accuracy in recognizing different types of defects. Secondly, a novel Spatial Pyramid Pooling with Cross Stage Partial (SPPFCSP) module is designed to replace the original Spatial Pyramid Pooling Fast (SPPF), which boosts the network feature extraction capabilities from defect targets at multiple scales and facilitates a more efficient integration of multiscale features. Finally, the original loss function of YOLOv5 is replaced by the Scylla intersection over union (SIoU) function to optimize the training model. The proposed models have been validated and intensively compared with many other state-of-the-art models on two public datasets. Firstly, results of experiments on the public Pascal Visual Object Classes (PASCAL VOC) 2007 datasets demonstrate that the proposed SPPFCSP block is obviously superior to other Spatial Pyramid Pooling blocks for the most state-of-the-art YOLO detectors, which can significantly improve the detection accuracy. The comparison results of experiments on the public Photovoltaic Electroluminescence Anomaly Detection Dataset (PVEL-AD) that includes 12-class defects obviously indicate that the proposed CSPV-YOLO model is better than many state-of-the-art models and achieves 91.5 % average precision (AP) and frames per second (FPS) of 177.8 on with only 2.2 million (M) parameters. Hence, it is suitable for the deployment on edge devices for real-time applications.}, archive = {J_EAAI}, author = {Zhicong Chen and Tianxiang Chen and Haoxin Zheng and Lijun Wu and Shuying Cheng and Peijie Lin}, doi = {10.1016/j.engappai.2025.112421}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112421}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Lightweight deep learning based solar cells defect detection using electroluminescence images}, volume = {162}, year = {2025}, }
• (2025). Multiple scattering-assisted data-driven full waveform inversion for pipeline blockage detection. EAAI, 162, 112420. (www)

  @article{ , abstract = {Blockages in urban water supply systems (UWSS) cause operational inefficiencies and require timely detection and intervention. Hydraulic transients offer an efficient method for diagnosing UWSS. However, existing transient-based approaches face limitations: they either rely on gradient-descent optimization algorithms, which are prone to convergence issues due to noise, or they assume weak blockage-induced scattering that only applies to small blockages, thereby restricting their diagnostic scope. This study introduces a novel approach that leverages multiple scattering of transient wavefields to enhance full waveform inversion (FWI) for accurate pipeline blockage detection and profiling. Recognizing that blockage characteristics – such as length, size, and location – significantly alter the system’s transient response, we perturb these parameters to generate a comprehensive dataset using a numerical model. This dataset is used to train a machine learning (ML) model designed to associate multiple scattered wavefield patterns with specific blockage characteristics. The ML model performs full waveform inversion to predict spatial variations in pipeline area, thereby revealing detailed blockage profiles. We validate the effectiveness of our method through numerical simulations and experimental data, which account for multiply scattered wavefields influenced by visco-elastic and frictional damping effects. Specifically, we quantify prediction accuracy by reporting errors in key blockage parameters such as length and radial extent, which directly influence pipeline performance. Additionally, we assess the framework’s resilience to noise, a common challenge in practical applications. The proposed framework demonstrates that ML can effectively interpret complex scattered wavefield data related to pipeline defects, paving the way for advancements in diagnosing large-scale water networks.}, archive = {J_EAAI}, author = {Utban Ahmed and Muhammad Waqar and Fedi Zouari and Liyou Luo and Moez Louati and Jensen Li and Mohamed S. Ghidaoui}, doi = {10.1016/j.engappai.2025.112420}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112420}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multiple scattering-assisted data-driven full waveform inversion for pipeline blockage detection}, volume = {162}, year = {2025}, }
• (2025). A streaming variable neural speech codec. EAAI, 162, 112418. (www)

  @article{ , abstract = {This paper presents a variable bit rate streaming neural speech codec designed for ultra-low bit rate scenarios, based on the SoundStream network framework. The codec employs the vector quantized variational auto-encoder (VQ-VAE) algorithm to capture the temporal structure and spectral characteristics of the speech signal, and constructs a latent space codebook to facilitate the effective mapping of feature vectors to discrete vectors. Based on the harmonic characteristics of speech signals and the inherent defects of single-scale discriminators, we introduce multi-period discriminators and multi-scale discriminators. The training process uses a balanced training strategy to ensure the balance between codebook utilization and training weights, and utilizes the Short-Time Fourier Transform (STFT) spectrum that can provide more accurate time–frequency resolution to compute the reconstruction loss. We introduce codebook loss to improve the utilization rate of the codebook and accelerate the convergence of the model. In the inference process, we use a quantizer selection strategy to achieve adaptive adjustment of variable bitrate. Objective and subjective experiments demonstrate that our proposed new neural speech codec outperforms traditional classical speech codecs and existing neural speech codecs in terms of reconstructed speech naturalness and quality while maintaining the low latency characteristic of neural speech codecs. With a multi-stimulus test with hidden reference and anchor (MUSHRA) score of 87, it is highly suitable for ultra-low bit rate speech compression applications such as satellite speech communication and narrowband instant messaging. The demo has been publicly released at https://svcodec.github.io/ .}, archive = {J_EAAI}, author = {Huaifeng Zhang and Pengfei Wu and Guigeng Li and Yuan An and Hao Zhang}, doi = {10.1016/j.engappai.2025.112418}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112418}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A streaming variable neural speech codec}, volume = {162}, year = {2025}, }
• (2025). LGP-DETR: An end-to-end object detection model for surface defect detection in light guide plates. EAAI, 162, 112416. (www)

  @article{ , abstract = {In this paper, we propose Light Guide Plate-DETR (LGP-DETR), an end-to-end object detection model tailored for identifying surface defects in light guide plates (LGPs). To address challenges such as low contrast, small target size, and complex backgrounds in industrial settings, LGP-DETR integrates three key components: Deformable Transformer Fusion Layer (DtransFusion), a deformable attention-based fusion module for capturing multi-scale features; Upsampling by Dynamic Sampling (DySample), a dynamic upsampling strategy for edge detail preservation; and OrthoC3, a channel attention module that suppresses background noise through orthogonal feature enhancement. We adopt FasterNet as a lightweight convolutional backbone to achieve a balance between accuracy and efficiency. Experimental results on a real-world LGP defect dataset demonstrate that LGP-DETR achieves a mean Average Precision (mAP) of 97.9 % and inference speed of 60 frames per second (FPS), significantly outperforming existing models. Furthermore, generalization tests on a fiberglass fabric defect dataset confirm the model's adaptability to different industrial domains. These findings validate the practical applicability and robustness of the proposed deep learning framework for industrial visual inspection.}, archive = {J_EAAI}, author = {Shuangning Liu and Cunling Liu and Junfeng Li}, doi = {10.1016/j.engappai.2025.112416}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112416}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {LGP-DETR: An end-to-end object detection model for surface defect detection in light guide plates}, volume = {162}, year = {2025}, }
• (2025). Towards efficient stream monitoring: A systematic approach for model selection and continuous improvement in tiny machine learning applications. EAAI, 162, 112415. (www)

  @article{ , abstract = {Measuring ephemeral stream flows is essential for ecological and hydrological studies. However, their intermittent nature and remote locations pose challenges for conventional monitoring methods, which often consume excessive energy to capture rare events. We address this with BODOQUE (Bimodal Observational Device for Optimizing Quantification of Ephemeral streams), a dual-mode system that leverages Tiny Machine Learning (TinyML) on low-power microcontrollers. The system remains in an energy-saving sensing state and activates high-precision measurements only when water flow is detected. We present a model selection methodology that balances detection accuracy with inference cost, enabling reliable operation within hardware constraints. To enhance adaptability in diverse environments, we developed a specialized component that facilitates dataset expansion through new field samples. This supports ongoing retraining to maintain model performance under changing conditions. A comprehensive evaluation using real-world data demonstrates that our system can achieve up to 97% annual energy savings compared to traditional continuous monitoring approaches.}, archive = {J_EAAI}, author = {Benjamín Arratia and Erika Rosas and Javier Prades and Salvador Peña-Haro and José M. Cecilia and Pietro Manzoni}, doi = {10.1016/j.engappai.2025.112415}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112415}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Towards efficient stream monitoring: A systematic approach for model selection and continuous improvement in tiny machine learning applications}, volume = {162}, year = {2025}, }
• (2025). Transformer architecture with illumination aware mechanisms for low-light image enhancement via retinex decomposition. EAAI, 162, 112414. (www)

  @article{ , abstract = {Enhancing low-light images is a complex task that involves not only restoring brightness but also preserving color fidelity and reducing noise interference. In this paper, we propose a novel Retinex-based Transformer Model with Illumination Aware Mechanisms (TIMRetinex-Net), which achieves physically interpretable modeling through a decomposition network guided by Retinex theory. To adapt to light variations in different regions, we randomly apply gamma transformations to several subregions of the illumination component and use a Color Estimation Module to capture the color global distribution of the natural scene in the reflection component. By modeling the color global distribution and repairing the degraded regions collaboratively, we alleviate the issue of being highly sensitive to data usage during training and improve the model’s ability to handle unknown scenes. The Illumination and Reflection Adjustment Transformer Network (IRAT-Net) produces enhanced images, achieving a balanced enhancement of detail and color. In addition, IRAT-Net incorporates an attention mechanism into the feature extraction layer and introduces the Illumination-Guided Information Aggregation Module to adaptively estimate lighting conditions. In the field of image processing, our method based on artificial intelligence was evaluated on five datasets and compared with twelve state-of-the-art methods. The results demonstrated strong alignment with the ground truth, with our method achieving superior performance in both subjective and objective assessments.}, archive = {J_EAAI}, author = {Zixuan Wang and Gang Liu and Hanlin Xu and Yao Qian and Rui Chang and Durga Prasad Bavirisetti}, doi = {10.1016/j.engappai.2025.112414}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112414}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Transformer architecture with illumination aware mechanisms for low-light image enhancement via retinex decomposition}, volume = {162}, year = {2025}, }
• (2025). Efficient interactive segmentation of three-dimensional gaussians with optimal view selection. EAAI, 162, 112413. (www)

  @article{ , abstract = {Three-dimensional (3D) scene representation has advanced rapidly in recent years, drawing the focus of more researchers. One of the main challenges for researchers is quickly and accurately segmenting 3D objects. Previous work has achieved excellent segmentation accuracy, but retraining requires a significant amount of time. Additionally, most methods fail to provide users with an efficient and convenient segmentation experience. To address these issues, we present Efficient Interactive Segmentation of 3D Gaussians (EISG), an efficient interactive segmentation method that eliminates the need for lengthy retraining. We first design an optimal view selection (OVS) method. This method uses 3D Gaussian entropy and image uncertainty to evaluate the quantity of view information. OVS helps users quickly select the optimal segmentation view, thereby enhancing interaction efficiency. Secondly, we use projection to find the target foreground rapidly and then segment the approximate objects using a clustering algorithm. Thirdly, we design a spatial-color background filter (SCBF) using the depth and color of 3D Gaussians. SCBF enables precise segmentation without needing retraining. Our method has been systematically tested on multiple datasets. Compared to other methods, the results demonstrate that EISG achieves ideal accuracy while significantly reducing processing time.}, archive = {J_EAAI}, author = {Yongtang Bao and Chengjie Tang and Yuze Wang and Yutong Qi and Ruijun Liu}, doi = {10.1016/j.engappai.2025.112413}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112413}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Efficient interactive segmentation of three-dimensional gaussians with optimal view selection}, volume = {162}, year = {2025}, }
• (2025). Adversarial black-box attack and defense for convolutional neural network-based power quality disturbance classification. EAAI, 162, 112411. (www)

  @article{ , abstract = {Correctly identifying power quality disturbance (PQD) is crucial for the proper functioning of power systems. Deep learning (DL) techniques have been widely used for PQD classification due to their excellent performance. However, DL models are susceptible to adversarial attacks, posing a serious security threat to DL-based PQD classification systems. This issue has received limited attention in current research. In this study, we first utilize a convolutional neural network (CNN) to recognize various types of PQD signals. To evaluate model robustness, we introduce a black-box attack method for PQD classification based on the variance-tuning momentum iterative fast gradient sign method (VMI-FGSM). VMI-FGSM integrates a variance tuning method into the iterative process of the momentum iterative fast gradient sign method (MI-FGSM) , thereby producing more transferable adversarial PQD signals. To defend against such attacks, we propose a perturbation removal defense based on a generative adversarial network (PRD-GAN). This approach is capable of removing perturbations from adversarial PQD signals before they are recognized by the target classification model. Experiments demonstrate that VMI-FGSM produces adversarial perturbations that are nearly identical to those of the advanced MI-FGSM, but its adversarial examples are significantly more effective at misleading the target CNN model. Furthermore, the proposed PRD-GAN effectively reconstructs adversarial PQD signals into clean forms under various black-box attack intensities and outperforms the multi-level denoising autoencoder (ML-DAE) in defense performance due to its superior reconstruction capability.}, archive = {J_EAAI}, author = {Xiudong Zhang and Congmei Jiang and Mingbiao Yu and Xiankui Wen and Jing Zhang and Na Rong and Song Han}, doi = {10.1016/j.engappai.2025.112411}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112411}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adversarial black-box attack and defense for convolutional neural network-based power quality disturbance classification}, volume = {162}, year = {2025}, }
• (2025). An intrusion detection system for critical infrastructures: Modbus approach. EAAI, 162, 112410. (www)

  @article{ , abstract = {This study aims to develop an Intrusion Detection System (IDS) using deep learning and machine learning algorithms to detect cyber attacks in the network traffic of critical infrastructures using an artificial intelligence-based approach. The research investigates various machine learning algorithms, datasets, and performance evaluations to detect the security vulnerabilities commonly found in industrial networks. Implemented in Python, the system has been tested on hybrid dataset, demonstrating the performance of different algorithms in terms of accuracy, precision, and other metrics. From artificial intelligence perspective, this study contributes machine learning and deep learning in cybersecurity, showing how normal and ensemble models can effectively detect complex threats, with fewer features but more relevant. The research employs supervised learning techniques, leveraging labeled datasets to train models that can accurately classify network traffic as either normal or attack, ensuring high detection accuracy. From an engineering standpoint, the system’s Python implementation addresses the practical challenges of real-world deployment in industrial control systems (ICS) and facilitates integration with existing infrastructures. Additionally, the custom dataset and post-dissector code contribute to the field of industrial cybersecurity, providing engineers with tools for testing, validating, and optimizing IDS solutions. As cyber–physical systems are increasingly integrated into ICS, the proposed IDS provides a crucial layer of defense against cyber threats, safeguarding both the digital and physical components of critical infrastructure. The findings reveal that the proposed system exhibits high performance in terms of detection accuracy. The results show that the system provides an effective and reliable detection mechanism using artificial intelligence techniques.}, archive = {J_EAAI}, author = {Murat Varol and Murat İskefiyeli}, doi = {10.1016/j.engappai.2025.112410}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112410}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An intrusion detection system for critical infrastructures: Modbus approach}, volume = {162}, year = {2025}, }
• (2025). Adaptive resource management in dynamic Cyber–Physical systems using artificial intelligence. EAAI, 162, 112409. (www)

  @article{ , abstract = {Effective resource management is crucial for the operation of dynamic Cyber–Physical Systems (CPS), yet traditional static or rule-based approaches often fail to handle their inherent complexity. This paper presents a novel Artificial Intelligence (AI)-driven framework for adaptive resource management, defined as the capability to autonomously adjust resource allocation by proactively forecasting future demands and dynamically optimizing decisions in real-time. The framework integrates a suite of AI techniques, including time-series models like Long Short-Term Memory (LSTM), chosen for their ability to capture complex temporal dependencies, for demand prediction. For resource allocation, it employs advanced actor–critic reinforcement learning (RL) algorithms like Proximal Policy Optimization (PPO) and Deep Deterministic Policy Gradient (DDPG), selected for their stability and efficiency in complex decision-making tasks. Performance was rigorously evaluated in a simulated dynamic environment. Experimental results demonstrate that combinations leveraging LSTM’s predictive accuracy with the robust optimization of PPO and DDPG achieve superior performance and stability. Specifically, the LSTM+DDPG and LSTM+PPO configurations yielded the highest average rewards (0.964 and 0.942, respectively), significantly outperforming the fixed-strategy baseline (0.497) and other AI pairings. Furthermore, the feasibility of training prediction models in a distributed manner via Federated Learning (FL) is successfully demonstrated. This research highlights that a synergistic integration of suitable AI predictors and advanced RL agents provides a powerful and resilient solution for resource management in dynamic CPS.}, archive = {J_EAAI}, author = {Xiaofei Zhao and Fangling Guo and Amin Huang and Jieqiong Ding and Chi Yan and Wei Yuan and Yunqi Su and Quanzhou Li and Qianggang Zhang}, doi = {10.1016/j.engappai.2025.112409}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112409}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adaptive resource management in dynamic Cyber–Physical systems using artificial intelligence}, volume = {162}, year = {2025}, }
• (2025). A novel prior knowledge-based and texture-enhanced network for few-shot industrial defect segmentation. EAAI, 162, 112408. (www)

  @article{ , abstract = {Deep learning-based segmentation techniques have demonstrated significant potential in defect detection, which is vital for product quality. However, the existing models tend to specialize in detecting specific defect types, reducing their adaptability to a wider range of product defects, most existing methods rely on multi-scale or prototype learning to extract defect features, but still struggle with complex backgrounds, various interferences, and large intra-class variations. Additionally, the rarity of certain defects limits the availability of training samples. Herein, an innovative segmentation network, the Prior Knowledge-based and Texture-Enhanced Network (PTNet), is designed for few-shot industrial segmentation. The model is mainly composed of a self-guidance branch, a cross-guidance branch, and a texture enhancement module, enabling generalization across defect types with minimal labeled samples. Self-guidance extracts prior knowledge from the query image, while the cross-guidance branch extracts prior and prototype features from the masked support image. The texture information in the low-level features of the backbone is then enhanced by proposed texture enhancement module (TEM). Finally, the enhanced low-level texture information are fused with high-level semantic features, allowing the network to fully exploit both local details and global context before being decoded to restore the original image size. This enables the model to handle complex textures and generalize to unseen defect types. Extensive experimental results validate the effectiveness of the proposed modules. State-of-the-art performance is achieved in few-shot defect segmentation, with notable improvements in mean Intersection over Union (mIoU) of 46.05 % and 46.98 % under 1-shot and 5-shot conditions, respectively.}, archive = {J_EAAI}, author = {Xingyue Liu and Qian Wu and Yahui Cheng and Guojun Wen}, doi = {10.1016/j.engappai.2025.112408}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112408}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel prior knowledge-based and texture-enhanced network for few-shot industrial defect segmentation}, volume = {162}, year = {2025}, }
• (2025). A novel reinforcement learning-based approach for optimal control: An application to multi-tank water systems. EAAI, 162, 112407. (www)

  @article{ , abstract = {The optimization of control actions is a critical challenge in industrial systems, especially when dealing with complex and unknown dynamics. Data collected from the environment enables the application of reinforcement learning techniques, which let the controller learn a policy based on data. This work proposes a novel model-free reinforcement learning approach that consists of a value iteration algorithm based on separate policy evaluation and policy improvement phases to provide an accurate control policy estimation. The proposed approach addresses tracking control for quadruple-tank water systems while obtaining minor tracking errors and faster transient responses. The results from the case study reveal better accurate estimation of the value function, up to 86.13% mean improvement in tracking accuracy and faster responses compared to existing methods. Therefore, the proposed approach demonstrates advantages in optimizing control performance and stands as a promising control method for industrial applications.}, archive = {J_EAAI}, author = {Eva Masero and Giacomo Mussita and Alessio La Bella and Riccardo Scattolini}, doi = {10.1016/j.engappai.2025.112407}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112407}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel reinforcement learning-based approach for optimal control: An application to multi-tank water systems}, volume = {162}, year = {2025}, }
• (2025). Automatic weighted ensemble learning for ballast resistance estimation driven by vehicle-ground information fusion. EAAI, 162, 112406. (www)

  @article{ , abstract = {Health management of transmission parameters for railway signal equipment is a key link between intelligent operation and maintenance. As a core parameter of track circuits, ballast resistance significantly affects signal transmission. To accurately and reliably assess its health state, an ensemble learning algorithm (ELA) is introduced, tackling deviations of appraisal decision boundaries. Focusing on issues of complex weight calculation, model homogenization, and severe overfitting in ELA, an integration model based on an automatic weight allocation strategy (AWAS) is innovatively proposed, constructing a method for resistance estimations driven by information fusion, while maximizing its generalization ability. Firstly, for deterioration mechanism analysis of ballast resistance, a transmission state model for vehicle-ground collaboration is established, completing extractions of evolutionary rules. Secondly, the improved ELA leverages heterogeneous classifier optimization and automatic weighted soft voting, with its core ensemble strategy employing a secondary learner to map the fused datasets. Then, by means of data mining techniques, interpolation and denoising algorithms are applied to implement data preprocessing, facilitating the effective fusion of heterogeneous vehicle-ground information. Finally, based on occurrence of adverse conditions, an appropriate particle size is set to achieve state warning. The results indicate that the proposed AWAS for ballast resistance calculations can achieve 98.52 % testing accuracy and outperforms others.}, archive = {J_EAAI}, author = {Conghui Wang and Shiwu Yang and Chang Liu}, doi = {10.1016/j.engappai.2025.112406}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112406}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Automatic weighted ensemble learning for ballast resistance estimation driven by vehicle-ground information fusion}, volume = {162}, year = {2025}, }
• (2025). Future of humanity in an artificial intelligence centric world. EAAI, 162, 112405. (www)

  @article{ , abstract = {This scholarly article rigorously investigates the transformative and disruptive roles of artificial intelligence (AI) in influencing the trajectory of human society. By concentrating on three fundamental sectors—healthcare, finance, and education—it evaluates the ways in which AI augments operational efficiency, facilitates intricate decision-making processes, and introduces innovative capabilities such as personalized medicine and automated financial systems. Concurrently, the analysis underscores urgent ethical dilemmas, encompassing algorithmic bias, accountability deficiencies, data privacy vulnerabilities, and workforce displacement. Employing real-world examples such as Deepfakes, and Neuralink, the article contextualizes emerging challenges within a dynamic socio-technical framework. The research offers a cohesive conceptual model that amalgamates technical, ethical, and governance aspects of AI, while presenting policy recommendations designed to promote transparency, equity, and human-centered AI development. The study emphasizes the necessity for reliable AI systems that humans can trust. The conclusions accentuate the immediate necessity for robust regulatory frameworks and sector-specific ethical supervision to ensure that advancements in AI are harmonized with the well-being of society.}, archive = {J_EAAI}, author = {Sunil Baloda and Monika Sharma and Mukesh Kumar}, doi = {10.1016/j.engappai.2025.112405}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112405}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Future of humanity in an artificial intelligence centric world}, volume = {162}, year = {2025}, }
• (2025). A novel federated deep learning for intrusion detection in smart grid cyber-physical systems. EAAI, 162, 112404. (www)

  @article{ , abstract = {The fusion of sophisticated computational, communicative, and physical elements in Smart Grid Cyber-Physical Systems (SGCPS) has greatly improved the efficiency and reliability of power grids. However, this complexity introduces enhanced cybersecurity risks, evidenced by significant cyberattacks on the Ukrainian power grid during 2015 and 2016. Despite progress in Artificial Intelligence (AI)-driven security solutions for SGCPS, practical deployment of these technologies is often limited due to a lack of high-quality attack data and owners’ hesitance to distribute sensitive details. This paper introduces an innovative strategy to fortify SGCPS against diverse network threats via a comprehensive intrusion detection system. We present a deep learning model leveraging a temporal convolutional network with multi-feature integration, aimed at robust threat identification. We also propose a federated learning framework enabling various SGCPS to jointly develop an extensive intrusion detection model, ensuring data privacy. Moreover, we incorporate a gradient compression technique utilizing the Long Short Term Memory- β -Total Correlation Variational Autoencoder (LSTM- β -TCVAE) model to enhance and secure model parameters throughout the training phase. Thorough experimental validations confirm the efficacy of our method in recognizing multiple cyber threat types to SGCPS and its advantages over current methods.}, archive = {J_EAAI}, author = {Rong Xie and Bin Wang and Xin Xu}, doi = {10.1016/j.engappai.2025.112404}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112404}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel federated deep learning for intrusion detection in smart grid cyber-physical systems}, volume = {162}, year = {2025}, }
• (2025). Tunnel-YOLO: An improved you only look once algorithm for real-time shield tunnel lining leakage detection. EAAI, 162, 112403. (www)

  @article{ , abstract = {Detecting crack leakages in shield tunnels is crucial for ensuring structural safety and extending service life, as traditional detection methods are limited by high subjectivity and low accuracy. To address these limitations, this paper proposes Tunnel-YOLO, an improved object detection algorithm based on You Only Look Once version 8 (YOLOv8). This algorithm replaces standard convolutional blocks with a novel Receptive Field Channel Attention Convolution (RFCAConv) module, which leverages dynamic receptive fields to enhance feature capture at different scales. We also introduce a C2f_SGE module, integrating the Spatial Group-wise Enhance (SGE) attention mechanism into the C2f (CSPNet with 2 convolutions) block to significantly improve feature extraction while suppressing background interference. Furthermore, an Edge Feature Enhancement Detection Head (EFE-Head) incorporates deconvolution layers to enhance fine-grained details for more precise boundary localization. To better accommodate the shape-sensitive detection task, our LeShape-IoU (Intersection over Union) loss function is designed to focus on the shape and scale characteristics of target bounding boxes. Experimental results on a public, real-world dataset demonstrate that Tunnel-YOLO significantly outperforms the baseline, increasing Recall, Precision, and mean Average Precision at 0.5 IoU (mAP50) by 15.7%, 10.3%, and 14.8%, respectively. Comparative analysis with other mainstream algorithms further validates the effectiveness and superiority of the proposed Tunnel-YOLO.}, archive = {J_EAAI}, author = {Ruijun Yang and Hao Zhang}, doi = {10.1016/j.engappai.2025.112403}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112403}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Tunnel-YOLO: An improved you only look once algorithm for real-time shield tunnel lining leakage detection}, volume = {162}, year = {2025}, }
• (2025). Development of data-driven predictive model and enhanced multiobjective optimization to improve the excavation performance of large-diameter slurry shields. EAAI, 162, 112402. (www)

  @article{ , abstract = {Safety, efficiency and energy consumption are important aspects for evaluating the performance of large-diameter slurry shield, and improving the performance of shield is crucial for safe and efficient excavation. To this end, a data-driven hybrid method is developed to improve the excavation performance of large-diameter slurry shields by intelligence regulating shield parameters. This method combines Bayesian Optimization with categorical boosting (BO-CatBoost) and enhanced multiobjective evolutionary algorithm based on decomposition (EMOEA/D). The method uses surface settlement, penetration and specific energy as output targets and employs the expert knowledge to select the input parameters. Subsequently, the trained BO-CatBoost model is employed to fit the input-output relationship. On this basis, the multiobjective optimization process was performed using EMOEA/D, with the important parameters determined by Shapley Additive exPlanations as decision variables and the nonlinear relationship fitted by BO-CatBoost as the objective function. Finally, the technique for order preference similarity to ideal solution is applied to obtain optimal operational parameters, thereby enhancing the excavation performance of large-diameter slurry shield. The proposed method is applied to a Wuhan rail transit line to verify the effectiveness, and the result shows that: (1) Our method can accurately predict the three targets with goodness of fit ranging from 0.938 to 0.988, respectively. (2) The proposed method can effectively improve the excavation performance of the large-diameter slurry shield, and reaches 13.88 %, 5.21 %, and 10.88 %, respectively. (3) An adaptive decision-making system for setting operational parameters is constructed, which is valuable for formulating of operational control strategies for large-diameter slurry shields.}, archive = {J_EAAI}, author = {Feiming Su and Xianguo Wu and Tiejun Li and Yang Liu}, doi = {10.1016/j.engappai.2025.112402}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112402}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Development of data-driven predictive model and enhanced multiobjective optimization to improve the excavation performance of large-diameter slurry shields}, volume = {162}, year = {2025}, }
• (2025). Contrastive active adaptive partial label learning under class distribution mismatch. EAAI, 162, 112401. (www)

  @article{ , abstract = {Partial label learning is an important learning framework where each training sample is associated with a candidate label set and its ground-truth label is included in the candidate label set. Active partial label learning is a variation where training data consists of both labeled and unlabeled samples. However, there exists the problem of class distribution mismatch, wherein the unlabeled sample set contains many instances out of the target categories. In this paper, a contrastive active adaptive partial label learning method under class distribution mismatch which combines active partial label learning with contrastive coding is proposed. A novel active sample selection strategy is first established to use label propagation ability to measure the optimization ability of unlabeled samples to partially labeled samples. Furthermore, to solve the problem of class distribution mismatch, a joint query score based on contrastive coding is utilized to reduce the queries of unlabeled samples out of target categories. Finally, the above two indicators are combined adaptively to select the most valuable unlabeled samples in target categories for manual labeling and the selected samples will be added to the training sample set to train the new classifier. The effectiveness and efficiency of the method are evaluated by performing experiments on the datasets CIFAR10 and CIFAR100.}, archive = {J_EAAI}, author = {Aohan Zhang and Kezhen Dong and Hongying Zhang}, doi = {10.1016/j.engappai.2025.112401}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112401}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Contrastive active adaptive partial label learning under class distribution mismatch}, volume = {162}, year = {2025}, }
• (2025). A framework for photovoltaic power forecasting based on hybrid data reconstruction, neural network models fusion, and multi-objective optimization. EAAI, 162, 112400. (www)

  @article{ , abstract = {The intermittency of photovoltaic power seriously affects the safety and operation of the power grid. Accurate photovoltaic power forecasting is critical for a safe connection of large-scale solar energy to the grid. Despite the efforts of many researchers, current forecasting methodologies remain inadequate. To bridge this gap, leveraging the recent advancements in artificial intelligence algorithms, this work combines cutting-edge deep learning techniques and data preprocessing strategies to develop a forecasting system that comprehensively considers various influencing factors and integrates multiple deep learning neural networks. The framework enables deterministic forecasting and uncertainty analysis, providing reliable supporting information for accurate forecasting through hybrid decomposition data preprocessing and feature selection modules. Then, closed-form continuous-time (Cfc) neural networks are introduced as one of the core forecasting components. Theoretically, the validity of the combined model and the Pareto optimization process are proved. Practically, the multi-objective African vultures optimization (MoAvo) is employed to identify the Pareto optimal solution, integrate four models, and improve the model's adaptability to external environmental changes. The experimental results show that the average mean absolute percentage error (MAPE) of the designed combined system for 1–3 steps forecasting on the Yulara are 6.09 %, 8.15 %, and 10.03 %, respectively. The results demonstrate that the framework fully considers the influence of candidate variables on forecasting, offering significant advantages over comparison models.}, archive = {J_EAAI}, author = {Menggang Kou and Jianzhou Wang and Jingrui Li and Runze Li and Zhiwu Li}, doi = {10.1016/j.engappai.2025.112400}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112400}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A framework for photovoltaic power forecasting based on hybrid data reconstruction, neural network models fusion, and multi-objective optimization}, volume = {162}, year = {2025}, }
• (2025). A binary particle swarm optimization with dual encoding mechanism for feature selection. EAAI, 162, 112397. (www)

  @article{ , abstract = {Feature selection is a crucial machine learning preprocessing stage with numerous practical uses. Numerous algorithms are created to tackle the task. However, these algorithms still suffer from several challenges. This study introduces a novel binary particle swarm optimization with dual encoding mechanism, named DEBPSO, to solve feature selection problems. A new transfer function, called an inverse S-shaped function, and a Boolean encoding mechanism are employed to enhance the exploration performance of DEBPSO. In addition, to better balance exploration and exploitation, a new game mechanism is proposed to find the best solution. In order to verify the performance of DEBPSO, a comprehensive experimental is designed. The experimental results on 27 well-known datasets show that DEBPSO significantly outperforms the compared algorithms on 17, 14, 13, 17, 16, 21, 14, 23, 20 datasets in terms of classification error rate, highlighting its efficiency in reducing the classification error rate and irrelevant features.}, archive = {J_EAAI}, author = {Chong Zhou and Rumeng Liang and Qi Liu and Sirui Niu}, doi = {10.1016/j.engappai.2025.112397}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112397}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A binary particle swarm optimization with dual encoding mechanism for feature selection}, volume = {162}, year = {2025}, }
• (2025). A novel weight-optimized machine-learning hybrid model for daily river runoff prediction. EAAI, 162, 112396. (www)

  @article{ , abstract = {The daily runoff process has been characterized as nonlinear and unsteady due to the impacts of watershed precipitation and evaporation, vegetation coverage rate, reservoir operations and other human activities. In recent years, machine-learning (ML) models have been widely applied in the daily runoff predictions, but the robustness and effectiveness of individual ML model is always limited. A novel weight optimization scheme has been introduced to ML models to obtain accurate predictions of daily river runoff. Variational modal decomposition method is adopted in the dataset preprocessing, and the runoff prediction performance of various classic ML models, including Genetic Algorithm-Back Propagation neural network (GA-BP), Long Short-Term Memory network (LSTM), Elman neural network (Elman) and Genetic Algorithm-Support Vector Machine (GA-SVM) are subsequently evaluated. A particle swarm optimization (PSO) based weight optimization strategy is proposed to combine different types of ML models, thus more accurate and robust results could be obtained. The ten-fold cross-validation method has been adopted and the performance of the optimized hybrid models are further evaluated for different schemes. A case study at Hankou hydrological station demonstrates that root mean square error (RMSE) and mean absolute percentage error (MAPE) is improved by 35.7 %, 75.8 % respectively for the optimized hybrid model. The present study shares useful insights to the comprehensive optimization of various ML models in the intelligent management of water resources.}, archive = {J_EAAI}, author = {Zhonglian Jiang and Jianglong Ying and Zhen Yu and Xiao Chu and Chengqiang Yu}, doi = {10.1016/j.engappai.2025.112396}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112396}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel weight-optimized machine-learning hybrid model for daily river runoff prediction}, volume = {162}, year = {2025}, }
• (2025). Intelligent assessment of habitat quality based on multiple machine learning fusion methods. EAAI, 162, 112395. (www)

  @article{ , abstract = {Evaluating habitat quality can help balance the relationship between economic development and biodiversity conservation, and it serves as a foundation for constructing an ecological security pattern. However, research on the intelligent construction of habitat quality is limited. This study develops a comprehensive framework to assess habitat quality based on optimized machine learning methods. The findings of the research are as follows: (1) From the perspective of human-machine interactive interpretation, ensemble learning is used to enhance the performance of basic classifiers, resulting in a classification map with high precision and recall. (2) The particle swarm optimization (PSO) algorithm can improve the goodness of fit of the Extreme Gradient Boosting (XGBoost) inversion model by 4–5 %. (3) The habitat quality inversion method based on XGBoost-PSO has high credibility and application value, with its texture structure being the result of both expert experience and image information interaction. (4) The model demonstrates certain application potential in downscaling; under the seven-band perspective, the blue and near-infrared bands are the most important, while in the four-band perspective, green and near-infrared bands take precedence.}, archive = {J_EAAI}, author = {Kui Yang and Dongge Cui and Chengrui Wang and Qi Tang and Linguang Miao}, doi = {10.1016/j.engappai.2025.112395}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112395}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Intelligent assessment of habitat quality based on multiple machine learning fusion methods}, volume = {162}, year = {2025}, }
• (2025). Hierarchical semantics guided multi-scale correlation network for alignment-free red-green-blue and thermal salient object detection. EAAI, 162, 112394. (www)

  @article{ , abstract = {RGBT (red-green-blue and thermal) salient object detection (SOD) aims to identify and highlight the most visually salient objects in an image by leveraging the complementary information from both RGB and thermal (TIR) modalities. It is particularly effective for 24/7 intelligent surveillance and autonomous perception in smart city security and traffic monitoring, especially under low light and adverse weather. However, existing methods primarily rely on manually aligned datasets, which are limited in handling the challenges posed by unaligned multi-modal data in real-world applications. Furthermore, these methods usually extract complementary information from both modalities using fixed-size windows (Liuet al., 2022, Wanget al., 2024b). However, such fixed-size windows are not effective in dealing with unaligned multi-modal images due to spatial inconsistencies. Additionally, existing methods often use single-layer high-level feature to represent semantic information, which fails to fully exploit the complementary benefits of multi-level features, thereby reducing the effectiveness of semantic guidance. To address these challenges, we propose a Hierarchical Semantics guided Multi-scale correlation Network (HSMNet) for alignment-free RGBT SOD. A Hierarchical Semantic Fusion Module (HSFM) dynamically assigns weights to features from multiple levels, enabling adaptive fusion of multi-level semantic information. A Multi-scale Asymmetric Correlation Module (MACM) employs windows of various sizes to capture asymmetric correlations between unaligned multi-modal data, enhancing cross-modal complementary information extraction even when data are not perfectly aligned. We conduct extensive experiments on unaligned, weakly aligned and aligned RGBT SOD datasets, with results demonstrating that our method outperforms state-of-the-art algorithms, achieving superior accuracy and robustness in both unaligned and weakly aligned RGBT SOD scenarios.}, archive = {J_EAAI}, author = {Chengmei Han and Lei Liu and Kunpeng Wang and Fei Xie and Bing Wei}, doi = {10.1016/j.engappai.2025.112394}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112394}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hierarchical semantics guided multi-scale correlation network for alignment-free red-green-blue and thermal salient object detection}, volume = {162}, year = {2025}, }
• (2025). Nonlinear dynamic modeling of turbojet engines using combined convolutional and long short-term memory networks. EAAI, 162, 112393. (www)

  @article{ , abstract = {Turbojet engines are widely used in small-scale aerial vehicles, but their nonlinear and time-varying dynamics present significant challenges for accurate modeling and control. Traditional system identification methods often struggle to capture these complex behaviors, particularly under limited data conditions. This study proposes a novel hybrid neural network architecture that combines convolutional neural networks and long short-term memory units. The model is specifically designed for small-sample scenarios, enabling robust learning and precise engine speed prediction from real input-output sequences. The input vector comprises the current engine speed, the next-step pulse-width modulation command, and its increment, enhancing the model’s responsiveness and reducing phase-lag effects. The proposed model is trained and evaluated on a real-world dataset containing 38,257 samples, with 80 % used for training and 20 % for testing. Its predictive performance is assessed using step input responses and three evaluation metrics: mean absolute error, root mean square error, and Pearson correlation coefficient. Experimental results demonstrate that the proposed hybrid architecture outperforms other recurrent models in capturing transient dynamics and accurately reproducing real engine behavior. These findings highlight the model’s effectiveness in modeling nonlinear engine dynamics and its potential as a data-efficient alternative to traditional identification techniques for small-scale turbojet applications.}, archive = {J_EAAI}, author = {Chen Lei and Dong Wei and Su Hang and Chi Yutian and Tian Congling and Gao Yongzhuo and Wu Dongmei and Dong Hui}, doi = {10.1016/j.engappai.2025.112393}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112393}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Nonlinear dynamic modeling of turbojet engines using combined convolutional and long short-term memory networks}, volume = {162}, year = {2025}, }
• (2025). Scientific machine learning for generic compact model parameter extraction of nanoscale transistors. EAAI, 162, 112392. (www)

  @article{ , abstract = {This work presents a framework to automate modelcard extraction of industry-standard compact models. This framework presents a Scientific Machine Learning (ScML) approach capable of inverse modeling. It integrates a random forest model with an artificial neural network to produce efficient and precise regression results. This new method is used for parameter extraction in the standard compact models of the semiconductor device industry. Modeling of a multi-gate Field Effective Transistor (FET) with an industry-standard compact model like Berkeley Short-channel Insulated-Gate Field-Effect Transistor Model – Common Multi-Gate (BSIM-CMG) is taken as an example to illustrate and describe the framework and highlight its key advantages. Proposed framework is useful in numerous aspects; it holds vital principles of physics, avoids depending on massive datasets, and has a sparse architecture while avoiding accuracy trade-offs. The framework is tested on production-level experimental devices to evaluate the real-world performance. This framework significantly reduces the time and cost of parameter extraction for the Process Design Kits (PDKs) development. Therefore, this is of immediate importance for fabrication and Electronic Design Automation (EDA) industries.}, archive = {J_EAAI}, author = {Kumar Sheelvardhan and Surila Guglani and Abhilash Dubey and Shashank Dubey and Sindhu Ramaswamy and Vaidy Subramanian and Kassandra Anderson and Glenn Workman and Sourajeet Roy and Avirup Dasgupta}, doi = {10.1016/j.engappai.2025.112392}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112392}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Scientific machine learning for generic compact model parameter extraction of nanoscale transistors}, volume = {162}, year = {2025}, }
• (2025). Physics-informed graph neural network for 3D spatiotemporal structural response modeling of flexible pavements. EAAI, 162, 112391. (www)

  @article{ , abstract = {Quantifying pavement damage is crucial for roadway agencies' maintenance planning. This study proposed a Physics-informed Graph Neural Network-based Pavement Simulator (PhyGPS) to predict three-dimensional (3D) asphalt concrete pavement responses, building upon an established data-driven Graph Neural Network-based Pavement Simulator (GPS) model. The key innovation lies in integrating knowledge graphs and mechanics equations to create a physics loss function, distinguishing it from its data-driven counterpart. The physics loss function comprises strain-displacement and stress loss components derived from 3D strain-displacement relations and stress equilibrium principles. A thorough 3D finite element (FE) pavement database supported the model development. The 3D FE pavement data was transformed into graph format where nodes and edges represent 3D FE pavement models’ nodes and node connections, respectively. Performance evaluation employed two case studies: “OneStep” for assessing short-term predictive capabilities and “Rollout” for examining long-term prediction accuracy under practical conditions. Results demonstrated that the physics-informed GPS model showed superior long-term predictive capability and robustness while maintaining excellent short-term accuracy compared to the data-driven model. Both models achieve rollout time under 8 s per FE simulation case, a dramatic improvement over the 12-h runtime of traditional 3D FE pavement models. The PhyGPS model successfully integrates physics principles, spatial relationships between structural components, temporal correlations in structural data, and complex material properties, offering an accurate, robust, and computationally efficient solution for predicting 3D pavement responses.}, archive = {J_EAAI}, author = {Fangyu Liu and Imad L. Al-Qadi}, doi = {10.1016/j.engappai.2025.112391}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112391}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Physics-informed graph neural network for 3D spatiotemporal structural response modeling of flexible pavements}, volume = {162}, year = {2025}, }
• (2025). Health state estimation of retired batteries based on physical constraints. EAAI, 162, 112390. (www)

  @article{ , abstract = {With the growing use of retired lithium-ion batteries, accurately monitoring their health status has become increasingly important. This study proposed a method to estimate the health of retired batteries by embedding their capacity degradation characteristics directly into the loss function of a Bidirectional Long Short-Term Memory (BiLSTM) network, combined with a Physically Informed Neural Network (PINN) model. The model is developed by incorporating the dynamics of the solid electrolyte interface (SEI) membrane, which evolves as the lithium-ion poles of the retired battery move. By combining these dynamics with the governing equations of motion, a partial differential equation (PDE) is derived. This approach integrates physical constraints, data-driven learning, and PDEs into a composite loss function. The proposed method is validated on two different datasets under varying operating temperatures. The results show that the PINN-BiLSTM model achieves a Root Mean Square Percentage Error (RMSPE) of 0.024, representing a 9.67 % improvement over the PINN-LSTM. This adaptive PINN method offers highly accurate health state predictions across temperature variations, thus supporting the sustainable use of retired batteries in secondary applications and helping to mitigate energy scarcity.}, archive = {J_EAAI}, author = {Fei Xia and Qianwen Dong and Lin Xia and Zhenyi An and Ziyang Xia and Chunyang Gong}, doi = {10.1016/j.engappai.2025.112390}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112390}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Health state estimation of retired batteries based on physical constraints}, volume = {162}, year = {2025}, }
• (2025). Adaptive cybersecurity in bio-medical modules: A dynamic programming neural network-based protection for markov-chain fabricated data attacks. EAAI, 162, 112389. (www)

  @article{ , abstract = {With the advances in communication technologies, remote monitoring and control of drug delivery are becoming prevalent in bio-medical engineering. In a chemotherapy system, the measurement signals can be wirelessly transferred to the control center by communication networks. Nevertheless, the avenues of communication might be jeopardized by false data injection (FDI), which poses significant risks to the security and stability of biomedical systems. In this work, a defense mechanism is developed to tackle the effect of FDI threats in the networked chemotherapy system. In particular, the effect of FDI attacks on the chemotherapy system is modeled by the Markov chain process. The proposed defense mechanism is designed in two parts: i ) a data-driven sliding mode observer (DDSMO) is utilized to identify the occurrence of cyber attacks in the tumor signals measured by the bio-sensor, and ii ) a mitigation scheme based on a dynamic rejection compensator (DRC) to compensate for the impact of cyber threats. In the mitigation phase, a goal representation heuristic dynamic programming (GrHDP) is adopted to adaptively adjust the parameters of DRC and to dynamically handle the cyber threats. The designed mitigation mechanism not only regulates the cancerous cells against cyber threats but also minimizes the side effects of drug delivery by regulating the output of normal cell and immune cell. Compared to prevalent methodologies, the proposed approach yields significant performance, including a 60.23 % improvement over the without protection, 37.48 % over the DDSMO-based model predictive controller (MPC), 35.95 % over the reinforcement learning (RL) based Kalman filter, and 70.44 % over the proportional integral (PI) based Kalman filter.}, archive = {J_EAAI}, author = {Mostafa Taheri and Juliang Yin and Zahra Rasooli Berardehi}, doi = {10.1016/j.engappai.2025.112389}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112389}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adaptive cybersecurity in bio-medical modules: A dynamic programming neural network-based protection for markov-chain fabricated data attacks}, volume = {162}, year = {2025}, }
• (2025). Weighted multi-source domain unsupervised adaptive network for rotating machinery fault diagnosis based on dual adversarial. EAAI, 162, 112386. (www)

  @article{ , abstract = {Multi-domain adaptive methods are becoming a growing focus of fault diagnosis, which can provide enhanced data support for models using the feature information from various source domains. As a most commonly used method, unsupervised multi-domain adaptive methods (UMA) can eliminate the requirement for the label of the target domain samples. However, the neglect of contributions from different source domains to the target domain and insufficient utilization of diagnostic information from multiple source domains are the widely limitation of UMA. Therefore, a dual-adversarial weighted multi-source domain unsupervised adaptive network (DAWMUN) is proposed to utilize diagnostic information from multi-source domains and consider the contribution of different source domains. Firstly, the shared feature extractor and dual adversarial training with the domain adversarial modules between multi-source domains and source-target domains are used to enhance domain confusion between multi-source and target domains (MSTD). Secondly, based on Multiple Kernel Maximum Mean Discrepancy (MK-MMD), a novel weighting mechanism and the corresponding training framework are constructed to effectively reduce negative transfer. Finally, a novel weighted classifier is proposed to merge the outputs of multiple classifiers and synthesize the impact of each source domain. The performance of the DAWMUN is validated using a rotating machinery dataset across various transfer tasks under different rotational speed and load conditions. The experimental results demonstrate that the diagnostic accuracy using the proposed DAWMUN is superior to existing SSDA and MSDA methods, with the average accuracies of 98.53 % and 98.23 % across six tasks in two separate experimental setups. The comparison to the existing methods results that the DAWMUN still demonstrates superior performance with improvements of 2.54 % and 2.86 %, respectively.}, archive = {J_EAAI}, author = {Wenqi Wang and Zongzhen Zhang and Jinrui Wang and Baokun Han and Huaiqian Bao and Zhikang Fan and Rongkang Ge}, doi = {10.1016/j.engappai.2025.112386}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112386}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Weighted multi-source domain unsupervised adaptive network for rotating machinery fault diagnosis based on dual adversarial}, volume = {162}, year = {2025}, }
• (2025). Twin-stream network: Enhancing wave prediction by capturing spatiotemporal information. EAAI, 162, 112385. (www)

  @article{ , abstract = {Wave prediction is a critical challenge in ocean and coastal engineering, particularly for understanding and mitigating the effects of sea waves on structures such as ships, offshore platforms, and coastal defenses. A novel machine learning model, Twin-Stream Network (TSNet), is proposed to enhance wave prediction accuracy by leveraging temporal and spatial dependencies in historical data. The TSNet model along with other baseline models are evaluated, in both single-point and multi-point forecasting tasks, by various performance metrics across different datasets including one-dimensional-linear, one-dimensional-nonlinear, two-dimensional-linear and two-dimensional-nonlinear water waves. The comprehensive comparative analysis demonstrates that the TSNet model outperforms others, especially in the multi-point forecasting task. This study provides a valuable insight into the effectiveness of machine learning approaches and highlights the potential of the accuracy improvement for wave prediction.}, archive = {J_EAAI}, author = {Junhao Xu and Zhongying Feng and Zhan Wang and Kun Zheng and Ruipeng Li}, doi = {10.1016/j.engappai.2025.112385}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112385}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Twin-stream network: Enhancing wave prediction by capturing spatiotemporal information}, volume = {162}, year = {2025}, }
• (2025). Clean-sample guided cross-modal retrieval with adaptive weighted contrastive learning. EAAI, 162, 112383. (www)

  @article{ , abstract = {Cross-modal retrieval enables efficient integration of information by linking different data modalities, such as images and text. As data volumes increase rapidly, the need for effective cross-modal interaction grows. Cross-modal hashing is favored for its low storage requirements and fast retrieval speed, but many existing methods depend on accurately labeled data, which can be subjective and expensive to obtain. To address this limitation, we propose Clean-guided Adaptive Weighted Contrastive Hashing (CAWCH), a novel framework designed to improve robustness against noisy labels. CAWCH incorporates two main components: a Gaussian Mixture Model (GMM)-based noise purifier that identifies reliable and noisy samples by modeling sample loss, and a contrastive learning strategy that selectively chooses positive samples and adaptively assigns weights based on multi-label similarity, considering both intra- and inter-modal relationships. Extensive experiments demonstrate that CAWCH significantly outperforms existing methods under noisy label conditions, highlighting its effectiveness and potential for real-world cross-modal retrieval applications.}, archive = {J_EAAI}, author = {Shuni Jiang and Zhixin Li}, doi = {10.1016/j.engappai.2025.112383}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112383}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Clean-sample guided cross-modal retrieval with adaptive weighted contrastive learning}, volume = {162}, year = {2025}, }
• (2025). Denoising of the magnetic flux leakage signal using dynamic feature fusion and a multi-scale autoencoder network. EAAI, 162, 112382. (www)

  @article{ , abstract = {Magnetic flux leakage (MFL) signal denoising is essential for the nondestructive inspection of oil and gas pipelines, where complex noise interference can severely degrade defect quantification accuracy. Traditional approaches such as mean filtering and wavelet transform offer limited suppression of multi-type mixed noise and often distort critical features, including defect peaks and valleys. Even deep learning–based MFL denoising methods struggle in scenarios with substantial signal-noise overlap due to inadequate feature extraction and limited adaptability.This work presents an advanced denoising framework that combines dynamic feature fusion with a multi-scale autoencoder network. The framework jointly exploits time- and frequency-domain signal components, employing an adaptive weighting mechanism for dynamic feature fusion. Parallel convolutional branches extract multi-scale features, improving the capture of both global structures and fine-grained details, while a Squeeze-and-Excitation (SE) channel attention mechanism enhances defect-sensitive features and suppresses noise. Extensive experiments demonstrate that the proposed model outperforms mean filtering, wavelet denoising, and a baseline autoencoder, achieving notable gains in signal-to-noise ratio (SNR), mean squared error (MSE), and signal similarity. Beyond superior noise suppression, the method preserves critical defect characteristics, providing a robust and reliable foundation for precise defect quantification in pipeline MFL inspection.}, archive = {J_EAAI}, author = {Lushuai Xu and Shaohua Dong and Haotian Wei and Feng Li and Pengkun Zhang and Cong Zuo and Mingxing Guo and Penghui Liao}, doi = {10.1016/j.engappai.2025.112382}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112382}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Denoising of the magnetic flux leakage signal using dynamic feature fusion and a multi-scale autoencoder network}, volume = {162}, year = {2025}, }
• (2025). An optimisation approach guided by crack variation mechanism in the informer prediction model. EAAI, 162, 112381. (www)

  @article{ , abstract = {Structural health monitoring (SHM) faces a fundamental challenge in reconciling predictive performance with physical interpretability for infrastructure diagnostics. Conventional deep learning (DL) approaches neglect essential mechanisms governing crack width variation—including thermal gradients, hysteretic responses, and phase-shifted correlations—limiting their reliability in real-world applications. To bridge this gap, we propose a mechanism-guided optimization (MGO) framework that integrates domain knowledge into the Informer architecture through physics-informed enhancements: auto-correlation modeling for capturing temperature-crack hysteresis, static gated fusion for multi-feature integration, and adaptive elastic net regularization for feature selection. Validated on cable-stayed bridge monitoring data, our framework achieves significant mean absolute error reductions (MAE) (5 %–60 %) and root mean square error reductions (RMSE) (10 %–55 %) versus baseline Informer across all cracks and prediction horizons, with diebold-mariano (DM) tests confirming statistical superiority in most cases. Crucially, it demonstrates superior precision relative to six state-of-the-art benchmarks across all evaluation scenarios. The ordinary least squares (OLS)-enhanced variant further delivers volatility reduction, while sensor failure tests establish quantifiable robustness benchmarks through MAE progression from 0.013 mm to 0.391 mm. This work establishes an interpretable, physics-grounded paradigm that explicitly links environmental drivers to structural degradation.}, archive = {J_EAAI}, author = {Xujia Liu and Youliang Ding and Fei Xu and Yichao Xu and Kang Yang}, doi = {10.1016/j.engappai.2025.112381}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112381}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An optimisation approach guided by crack variation mechanism in the informer prediction model}, volume = {162}, year = {2025}, }
• (2025). A lightweight segmentation model based on segment anything model for tongue image segmentation. EAAI, 162, 112379. (www)

  @article{ , abstract = {Tongue image segmentation plays a crucial role in intelligent of diagnosis of Traditional Chinese Medicine. Accurate, efficient, and lightweight tongue segmentation significantly improves both the quality and practical applicability of intelligent disease diagnosis models. To address this challenge, we propose TongueSAM_Lite, a lightweight and fully automated tongue image segmentation model. Based on the Segment Anything Model. Our approach employs knowledge distillation and parameter-efficient fine-tuning to develop a novel lightweight image encoder, high-parameter modules in the Vision Transformer are partially replaced with lightweight image modules, which facilitate the transfer of its feature extraction capabilities while accelerating inference speed and reducing computational resource requirements. Additionally, to eliminate manual annotation of tongue region bounding boxes, we integrate a YOLOX-based automatic Box-prompt generator, enabling end-to-end fully automated prompting and segmentation of tongue images. To validate our approach, various experiments were conducted in three datasets. The results show that compared to the original large-scale model of the Segment Anything Model, TongueSAM_Lite reduces the size of the model by 42.7% and shortens the inference time to 45.43% while retaining the near-complete segmentation accuracy of few-shot learning. TongueSAM_Lite achieves Mean Intersection over Union scores of 96.48%, 98.36%, and 97.53% in the three datasets, respectively, outperforming state-of-the-art segmentation methods. Further validation confirms that the YOLOX-based prompt encoder yields optimal performance for the generation of tongue image bounding boxes. Our proposed approach provides new research insights to advance tongue diagnosis technology of Traditional Chinese Medicine. All codes in this article are available at https://github.com/ruanqunsheng/TongueSAM_Lite .}, archive = {J_EAAI}, author = {Qunsheng Ruan and Shan Cao and Zhirong Luo}, doi = {10.1016/j.engappai.2025.112379}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112379}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A lightweight segmentation model based on segment anything model for tongue image segmentation}, volume = {162}, year = {2025}, }
• (2025). Exploring cross-branch information for semi-supervised remote sensing object detection. EAAI, 162, 112378. (www)

  @article{ , abstract = {Semi-supervised object detection (SSOD) provides a promising solution to mitigate the annotation costs in remote sensing applications. Mainstream teacher-student based SSOD methods leverage unlabeled images through pseudo labeling, and their effectiveness is fundamentally limited by the inevitable noise in pseudo labels, particularly for remote sensing (RS) scenarios with complex backgrounds and dense, multi-scale and oriented objects. Current methods primarily focus on reducing pseudo label noise through category, scale and Intersection over Union information mining, as well as designing fine-grained confidence thresholding strategies. However, the inherent discrepancy between classification and localization reliability is neglected. In this study, with analyzing the characteristic discrepancies between the classification and localization branches, We propose artificial intelligence (AI) methodological innovation method named cross-branch information incorporation method (i.e., CBI-SSOD) to utilize these discrepancies to assist the training of the classification branch, and thus improve the performance of SSOD methods. Specifically, our method present two key AI innovations. Firstly, we propose a pretext task to extract cross-branch information, which can improve the classification ability by reinforce the consistent predictions between the classification branch and the pretext task. Besides, we propose a pseudo label reassignment approach to adjust the soft classification pseudo labels, and thus suppress pseudo label noise and improve the detection performance. Extensive experiments on Dataset for Object Detection in Aerial Images (DOTAv1.0) and DOTAv1.5 datasets validate the effectiveness and superiority of our method, and demonstrate the practical engineering impact of our method on RS applications and interpretation systems.}, archive = {J_EAAI}, author = {Shitian He and Huanxin Zou and Yingqian Wang and Xu Cao and Hao Chen and Ning Jing}, doi = {10.1016/j.engappai.2025.112378}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112378}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Exploring cross-branch information for semi-supervised remote sensing object detection}, volume = {162}, year = {2025}, }
• (2025). Lightning risk assessment of offshore wind farms considering tropical cyclone impacts based on an improved gradient boosting algorithm. EAAI, 162, 112376. (www)

  @article{ , abstract = {In recent years, global climate warming has led to a significant increase in both the frequency and intensity of tropical cyclones (TCs). The development of TCs is often accompanied by frequent lightning activities. The risk of lightning strikes to high offshore wind turbines is substantially elevated. This study evaluates the lightning risk faced by offshore wind farms influenced by tropical cyclones. Firstly, TC paths are analyzed in both spatial and temporal dimensions by linking them with lightning data to examine the distribution of TC-related lightning, and the lightning strike characteristics of offshore wind turbines are investigated. Secondly, a Bayesian Optimization (BO)-based eXtreme Gradient Boosting (XGBoost) model for lightning risk assessment is proposed, incorporating characteristics of TC lightning and offshore wind farms as input variables. The proposed BO-XGBoost model outperforms XGBoost, Bidirectional Long Short-Term Memory (Bi-LSTM), Support Vector Machine (SVM) and Neural Network (NN), achieving a precision of 98.9 % and a recall of 98.9 % on the test set. Additionally, SHapley Additive exPlanations (SHAP) value analysis indicates that TC lightning characteristics and offshore wind farm characteristics significantly impact the model output, enhancing the accuracy of the model. The assessment outcomes provide a theoretical basis for future offshore wind farm planning and guidance for lightning protection measures in offshore wind farms.}, archive = {J_EAAI}, author = {Qibin Zhou and Kehan Chen and Xiaoyan Bian and Shangjie Chen and Gaopeng Lu}, doi = {10.1016/j.engappai.2025.112376}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112376}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Lightning risk assessment of offshore wind farms considering tropical cyclone impacts based on an improved gradient boosting algorithm}, volume = {162}, year = {2025}, }
• (2025). Beyond trial-and-error: Predicting user abandonment after a moderation intervention. EAAI, 162, 112375. (www)

  @article{ , abstract = {Current content moderation follows a reactive, trial-and-error approach, where interventions are applied and their effects are only measured post-hoc. In contrast, we introduce a proactive, predictive approach that enables moderators to anticipate the impact of their actions before implementation. We propose and tackle the new task of predicting user abandonment following a moderation intervention. We study the reactions of 16,540 users to a massive ban of online communities on Reddit, training a set of binary classifiers to identify those users who would abandon the platform after the intervention—a problem of great practical relevance. We leverage a dataset of 13.8 million posts to compute a large and diverse set of 142 features, which convey information about the activity, toxicity, relations, and writing style of the users. We obtain promising results, with the best-performing model achieving micro F1-score = 0 . 914 . Our model shows robust generalizability when applied to users from previously unseen communities. Furthermore, we identify activity features as the most informative predictors, followed by relational and toxicity features, while writing style features exhibit limited utility. Theoretically, our results demonstrate the feasibility of adopting a predictive machine learning approach to estimate the effects of moderation interventions. Practically, this work marks a fundamental shift from reactive to predictive moderation, equipping platform administrators with intelligent tools to strategically plan interventions, minimize unintended consequences, and optimize user engagement.}, archive = {J_EAAI}, author = {Benedetta Tessa and Lorenzo Cima and Amaury Trujillo and Marco Avvenuti and Stefano Cresci}, doi = {10.1016/j.engappai.2025.112375}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112375}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Beyond trial-and-error: Predicting user abandonment after a moderation intervention}, volume = {162}, year = {2025}, }
• (2025). A sampling interval-adaptive transformer for industrial time sequence modeling with heterogeneou s sampling rates in quality prediction. EAAI, 162, 112374. (www)

  @article{ , abstract = {The industrial data sequences frequently exhibit irregular sampling frequencies, which pose a number of difficulties for data analysis and modeling. The traditional dynamic models like Recurrent Neural Network (RNN) and Transformer are difficult to model such data sequences. The main reason is that these models assume that data sampling frequency should be constant. To this end, a Sampling Interval-Adaptive Transformer (SIA-Trans) is proposed in this paper to adaptively model the temporal information for heterogeneous sampling sequences in industrial processes. The SIA-Trans uses the sampling interval and position embedding block to address the problem of unequal time intervals and rectify the temporal correlations in time series. Then, the interval-aware self-attention net is designed for dynamic data relationship modeling, taking the processed data through the self-attention mechanism. Finally, the predicted output is obtained after the point-wise feed-forward layer. The proposed SIA-Trans is validated on a real-world hydrocracking process to predict the content of hydrocarbon mixture with five carbon atoms (C5) hydrocarbons in light naphtha, as well as the final boiling point of jet fuel.}, archive = {J_EAAI}, author = {Zijian Xu and Nuo Xu and Kai Wang and Xiaofeng Yuan and Yalin Wang and Chunhua Yang and Weihua Gui and Shuqiao Cheng and Lingjian Ye}, doi = {10.1016/j.engappai.2025.112374}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112374}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A sampling interval-adaptive transformer for industrial time sequence modeling with heterogeneou s sampling rates in quality prediction}, volume = {162}, year = {2025}, }
• (2025). Multi-modality complementary learning network with cross-modality interaction and adaptive fusion for face forgery detection. EAAI, 162, 112373. (www)

  @article{ , abstract = {With the advancement of face forgery technology, many forged faces threaten information security. Although existing face forgery detection methods obtain better detection performance on intra-dataset evaluation, the generalization of cross-dataset detection and the robustness against image post-processing operations still need to be improved. To address these issues, we propose a multi-modality complementary learning network with cross-modality interaction and adaptive fusion for face forgery detection. Specifically, a two-branch architecture is designed to extract spatial and frequency features. To realize the interaction and communication of spatial and frequency information, the cross-modality interaction module is designed to explore the inter-modality correlation by applying across self-attention. Subsequently, a multi-scale feature enhancement module is introduced in the spatial branch to enhance the texture and semantic information of spatial features, improving the robustness of tackling image post-processing operations. In addition, to exploit the complementary relationship between the spatial and frequency features, an adaptive fusion module is designed to establish forged feature dependencies by leveraging spatial self-attention, while learning discriminative feature representations by fusing spatial and frequency features in an adaptive weighted manner. Extensive experimental results on four public datasets demonstrate that the proposed method outperforms other state-of-the-art methods for intra-dataset, cross-dataset, and perturbed dataset evaluations.}, archive = {J_EAAI}, author = {Chunyin Shi and Chengyou Wang and Xiao Zhou and Zhiliang Qin}, doi = {10.1016/j.engappai.2025.112373}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112373}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multi-modality complementary learning network with cross-modality interaction and adaptive fusion for face forgery detection}, volume = {162}, year = {2025}, }
• (2025). Adaptive neural network tracking control for unknown high-order nonlinear systems: A constructive approximation set based approach. EAAI, 162, 112371. (www)

  @article{ , abstract = {This article addresses the problem of adaptive neural network (NN) tracking control for unknown high-order nonlinear systems, with a focus on accurately constructing NN approximation sets. To guarantee the local approximation capabilities of NNs, it is crucial that their input signals remain within corresponding compact sets. However, the unknown functions and powers in high-order nonlinear systems make it difficult to determine these sets accurately. To solve this, we introduce a novel adaptive NN tracking control strategy that integrates signal substitution technique, barrier functions (BFs), and NNs. Specifically, the signal substitution technique converts the original system states into state error variables, along with the desired reference signal and its time derivatives, which serve as part of the NN input. BFs are employed to constrain the state errors, while NNs approximate the transformed unknown system functions. This approach enables precise calculation of bounds for the NN weight estimators, ensuring that the NN approximation sets are constructed. Unlike existing methods, our approach not only proves the existence of NN approximation sets but also provides a constructive design strategy, significantly enhancing the approximation accuracy for unknown nonlinear functions. Simulation results demonstrate the effectiveness and advantages of the proposed method.}, archive = {J_EAAI}, author = {Yu-Fa Liu and Yong-Hua Liu and Jin-Wa Wu and Jie Tao and Ming Lin and Chun-Yi Su and Renquan Lu}, doi = {10.1016/j.engappai.2025.112371}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112371}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adaptive neural network tracking control for unknown high-order nonlinear systems: A constructive approximation set based approach}, volume = {162}, year = {2025}, }
• (2025). Dynamic correlation graph convolution network with embedded temporal correlation extraction for stock price forecasting. EAAI, 162, 112370. (www)

  @article{ , abstract = {Stock price forecasting has become a significant and complex research area within financial technology. The dynamic correlations among stocks and the inherent noise in price volatility present considerable challenges in accurately forecasting stock prices and enhancing investment returns. This paper introduces a novel Dynamic Correlation Graph Convolution Network (DyCGCN) with embedded temporal correlation extraction. First, we propose a dual-scale dynamic graph generation method to capture the topological relationships among stocks. Second, we develop a dynamic correlation-temporal convolution module that extracts high-level temporal correlations. Third, we introduce a prospect theory-guided multi-strategy loss function that accommodates the diverse risk preferences of investors. Furthermore, we present a joint regression-classification learning method to extract and leverage stock trend information. Experiments conducted on four real-world datasets demonstrate the superiority of DyCGCN, achieving an average 24.7% reduction in prediction error and a 10.5% improvement in predictive accuracy over baseline models, underscoring its strong potential for practical stock price forecasting.}, archive = {J_EAAI}, author = {Fang He and Wei Yin and Yilun Jin and Zhengyang Chen}, doi = {10.1016/j.engappai.2025.112370}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112370}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dynamic correlation graph convolution network with embedded temporal correlation extraction for stock price forecasting}, volume = {162}, year = {2025}, }
• (2025). Multi-objective deployment optimization for integrated sensing and communication-enabled unmanned aerial vehicle swarm. EAAI, 162, 112368. (www)

  @article{ , abstract = {With the convergence of mobile communication, sensing, and computational networks in sixth-generation technology, the integration of sensing and communication with unmanned aerial vehicles (UAVs) is promising. This paper focuses on the contribution of artificial intelligence in optimizing the deployment of UAV swarms for multi-objective target detection applications in sixth-generation networks. Specifically, the artificial intelligence contribution lies in the development of an improved multi-objective particle swarm optimization (IMOPSO) algorithm for solving a complex multi-objective deployment problem. The problem aims to simultaneously optimize communication rate, sensing quality, and energy consumption in the deployment of UAV swarms. To address this, the proposed IMOPSO incorporates chaotic initialization, Lévy flight mutation, dynamic mutation rate, and an elimination mechanism based on opposition-based learning. These innovations are designed to enhance the algorithm’s ability to explore the solution space effectively, overcome premature convergence to local solutions, and improve solution quality. In terms of engineering applications, the IMOPSO is applied to the deployment of UAV swarms for target detection, demonstrating its ability to enhance communication and sensing performance while reducing energy consumption in practical scenarios. Through extensive simulations, we show that the IMOPSO outperforms traditional optimization methods and other baseline algorithms, achieving superior results across all optimization objectives. Specifically, the IMOPSO achieves approximately 5% higher transmission data rate, 9% better sensing quality, and 19% lower energy consumption compared to baseline algorithms across multiple test scenarios. Furthermore, the solutions obtained are not only closer to the optimal front but also more concentrated, indicating higher-quality results.}, archive = {J_EAAI}, author = {Hongjuan Li and Haiyuan Chen and Miao Wang and Jiahui Li and Hui Kang and Yuzhuo Guan and Xu Lin}, doi = {10.1016/j.engappai.2025.112368}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112368}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multi-objective deployment optimization for integrated sensing and communication-enabled unmanned aerial vehicle swarm}, volume = {162}, year = {2025}, }
• (2025). Progressive semi-supervised learning for specific emitter identification: An iterative clustering and pseudo-label refinement approach. EAAI, 162, 112361. (www)

  @article{ , abstract = {Specific Emitter Identification (SEI) distinguishes radio-frequency (RF) devices by exploiting hardware-induced signal fingerprints, thereby strengthening wireless-layer security. Existing deep learning-based SEI methods depend heavily on labeled data and fixed confidence thresholds for pseudo-labeling, which limits their effectiveness under label scarcity or open-set conditions. To overcome these issues, we propose a progressive semi-supervised learning (ProSSL) method for SEI that combines iterative clustering with contrastive learning to generate adaptive pseudo-labels. ProSSL introduces an “uncertain” class and employs a dual-constraint selector—prediction stability and class diversity—to suppress noisy pseudo-labels and ensure robust propagation. Experiments on the public real-world long range(LoRa) RF-fingerprint dataset show that ProSSL gains 2.90%–6.01% absolute accuracy over state-of-the-art baselines, reaching 96.48% accuracy with 90% labels and 59.88% with only 5% labels. While on the public automatic dependent surveillance-broadcast(ADS-B) Top-10 dataset, ProSSL achieves 84.40% accuracy with 5% labeled data and 99.40% accuracy with 90%labeled data, again outperforming all competing methods. Open-set evaluations further demonstrate that overall accuracy rises from 18.81% when only two classes are known to 62.25% when eight classes are known, confirming strong generalization to unseen emitters and validating ProSSL’s robustness and practicality in realistic wireless environments.}, archive = {J_EAAI}, author = {Yiting Gao and Ke Wang and Hao Huang and Jiao Wang and Jiaxu Liu and Yao Zheng and Jianqing Li}, doi = {10.1016/j.engappai.2025.112361}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112361}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Progressive semi-supervised learning for specific emitter identification: An iterative clustering and pseudo-label refinement approach}, volume = {162}, year = {2025}, }
• (2025). Enhancing scene text image super-resolution via gradient-based graph attention network. EAAI, 162, 112360. (www)

  @article{ , abstract = {Scene text image super-resolution is crucial for enhancing text recognition in low-resolution real-world images. Existing methods usually overlook the structured and repetitive layout of text, which can serve as powerful prior knowledge for guiding reconstruction. In this work, we propose a novel framework that incorporates gradient-based graph attention to explicitly model patch-level text layout. The architecture combines a non-local group-wise attention module, a cascaded channel attention module, and a gradient-guided graph attention module to capture both global and local structural dependencies. This design enables more accurate restoration of text contours and layout consistency. Extensive experiments on the benchmark dataset demonstrate that our method achieves superior performance in both image quality and recognition accuracy, outperforming state-of-the-art methods. The code is available at: https://github.com/cvzxy/TSANv2 .}, archive = {J_EAAI}, author = {Xiangyuan Zhu and Xuchong Liu and Kehua Guo and Wei Zhao}, doi = {10.1016/j.engappai.2025.112360}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112360}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhancing scene text image super-resolution via gradient-based graph attention network}, volume = {162}, year = {2025}, }
• (2025). A consistency regularization-based approach integrating anatomical structural relationships and organ category representations for multi-organ segmentation in pigs. EAAI, 162, 112359. (www)

  @article{ , abstract = {In modern biomedical research and livestock management, accurate multi-organ segmentation in pigs is essential for breeding programs. However, current methods face challenges due to low imaging contrast, size disparities, and organ shape variability. Additionally, the manual annotation of computed tomography (CT) scans is labor-intensive and costly, limiting available labeled samples. To address these issues, we propose a consistency regularization-based network guided by anatomical structural relationships and global organ category representations, specifically designed for multi-organ segmentation using a limited number of annotated CT scan samples from pigs. Specifically, we designed the SpatialLink Gated Recurrent Unit (GRU) module to extract anatomical structural information and capture dynamic spatial relationships between organs, thereby minimizing segmentation biases caused by organ shape variations. Moreover, we developed the Organ Category Coding module and Guidance module, which integrate consistency regularization and attention mechanisms, enabling the network to accurately extract global organ category representations during the decoding phase, even with a small number of labeled samples, significantly improving segmentation consistency across organs of different sizes. Additionally, We are the first to apply the Visual State Space block to multi-organ segmentation in pigs, using it to extract contextual information. Experiments on 60 pigs demonstrate that our method achieves state-of-the-art results, with significant improvements in segmentation accuracy for the gallbladder and bladder, including a 9.8% and 4.2% Dice score increase, respectively, and a 12.4% and 6.2% boost in Jaccard scores compared to compared with a selection of published methods.}, archive = {J_EAAI}, author = {Xiang Pan and Hang Fan and Jianlan Wang and Yan Fu and Wei Chu and Weipeng Tai and Jing Gu and Jianming Ni}, doi = {10.1016/j.engappai.2025.112359}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112359}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A consistency regularization-based approach integrating anatomical structural relationships and organ category representations for multi-organ segmentation in pigs}, volume = {162}, year = {2025}, }
• (2025). Interpretable chest X-ray localization using principal component-based feature selection in deep learning. EAAI, 162, 112358. (www)

  @article{ , abstract = {Accurate identification and localization of diseases in chest X-ray (CXR) images are crucial for early diagnosis and timely medical intervention. Traditional localization techniques like Class Activation Mapping (CAM), depend on Global Average Pooling (GAP) layers, restricting their flexibility, while gradient-based methods like Grad-CAM involve computational overhead and limited interpretability. To address these limitations, this study introduces a novel Principal Component Analysis (PCA)-based localization method that eliminates reliance on GAP layers and gradient computations. Utilizing publicly available Kaggle datasets, namely the COVID-19 Radiography Dataset and Tuberculosis (TB) Chest X-ray Database. The proposed approach employs PCA to compress high-dimensional convolutional feature maps extracted from the pretrained VGG16 model into a lower-dimensional, spatially meaningful representation. This enables rapid, interpretable heatmap generation highlighting precise abnormal regions. Experimental results demonstrate that the proposed method achieved an average training loss of 0 . 0835 ± 0 . 1830 and validation loss of 0 . 1385 ± 0 . 0741 across 5-fold cross-validation. In addition, it achieved an impressive accuracy of 97.5%, sensitivity of 98.2%, specificity of 99.4%, a Dice Similarity Coefficient (DSC) of 97.5%, and an Intersection-over-Union (IoU) of 95.1%. Compared to CAM, and Grad-CAM, PCA-based localization significantly reduces inference time, enhances interpretability, and provides robust multi-class localization performance suitable for clinical deployment.}, archive = {J_EAAI}, author = {Diwakar Diwakar and Deepa Raj}, doi = {10.1016/j.engappai.2025.112358}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112358}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Interpretable chest X-ray localization using principal component-based feature selection in deep learning}, volume = {162}, year = {2025}, }
• (2025). Fast simulation for scattering muography applications using generative adversarial neural networks. EAAI, 162, 112357. (www)

  @article{ , abstract = {Muography is an emergent non-destructive testing technique that uses cosmic muons to probe the interior of objects and structures. This technique can be employed to perform preventive maintenance of critical equipment in the industry in order to test the structural integrity of the facility. Several muography imaging algorithms based on machine learning methods are being developed in the recent years. These algorithms make exhaustive use of simulated data, usually using packages such as GEANT4 (GEometry ANd Tracking), that exhaustively simulate the detector, to produce training samples. This work presents a faster alternative for the generation of simulated samples based on generative adversarial neural networks. A speed up factor of 80 is observed with this system without any significant degradation of the quality of the simulation.}, archive = {J_EAAI}, author = {Rubén López Ruiz and Celia Fernández Madrazo and Sergio Sánchez Cruz and Lara Lloret Iglesias and Pablo Martínez Ruiz del Árbol}, doi = {10.1016/j.engappai.2025.112357}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112357}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Fast simulation for scattering muography applications using generative adversarial neural networks}, volume = {162}, year = {2025}, }
• (2025). Research on lightweight network for real-time detection of steel structure corrosion based on knowledge distillation. EAAI, 162, 112356. (www)

  @article{ , abstract = {Regular and real-time monitoring of corrosion is crucial for ensuring structural safety and extending the service life of infrastructure. With the continuous development of advanced structural health monitoring technologies, intelligent corrosion detection has become an inevitable trend. This study addresses the issues of low accuracy, incomplete detail processing, and missed or false detections in complex scenarios in steel structure corrosion detection, as well as the challenges of high complexity and insufficient real-time performance in deep learning models. We propose a high-performance, lightweight, real-time corrosion detection model, Real-Time Detection Transformer for Corrosion (RT-DETR-Corrosion), based on knowledge distillation. By incorporating lightweight optimization on the RT-DETR-R18 baseline model and a hybrid knowledge distillation approach, the model significantly improves real-time performance and detection accuracy, meeting the application requirements for efficiency and precision in steel structure corrosion detection. Experimental results show that the model exhibits excellent optimization effects in terms of localization accuracy, classification accuracy, and position regression error on both the training and validation sets, while also demonstrating strong generalization ability. In extreme weather conditions (such as rain, fog, snow, and strong light) and complex scenarios (such as occlusion, blur, and low-light environments), the model maintains stable Precision, Recall, and mAP metrics, validating its reliability and applicability in diverse real-world engineering environments. Moreover, visualized heatmap analysis of detection results for different scenarios further confirms the model's precise attention to corrosion regions and its generalization ability, providing essential technical support for steel structure corrosion risk assessment and intelligent monitoring, with significant potential for engineering applications.}, archive = {J_EAAI}, author = {Jia Hou and Wei Chen and Zhen Duan and Hang Li and Mingyu Yu}, doi = {10.1016/j.engappai.2025.112356}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112356}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Research on lightweight network for real-time detection of steel structure corrosion based on knowledge distillation}, volume = {162}, year = {2025}, }
• (2025). Function structures of information measures for n-polygonal interval-valued intuitionistic fuzzy sets and their application in location selection strategy. EAAI, 162, 112355. (www)

  @article{ , abstract = {The interval-valued intuitionistic fuzzy set (IVIFS) represents an organic integration of interval-valued fuzzy sets and intuitionistic fuzzy sets, but it fails to meet the requirements of linearity and closure in arithmetic operations, rendering its computations relatively intricate. Consequently, this paper employs an interval partitioning strategy to mitigate the complexity of arithmetic operations, thereby constructing a novel fuzzy set structure characterized by efficient piecewise linear approximation capabilities. Furthermore, the paper presents the structural form of arithmetic operations for the IVIFS with piecewise linear approximation and demonstrates the simplicity of these operations by an numerical example. In addition, we extend the findings on information measures for polygonal interval-valued intuitionistic fuzzy set pertaining to abstract functions that fulfill particular criteria. Furthermore, we delve into the transformation relationships among these information measures, from which a range of structural formats for information measures can be deduced based on functional expressions and transformation relationships. Finally, similarity measures are applied to company site selection. The validity, practicality and stability of proposed measures have been proven through sensitivity analysis and comparative analysis.}, archive = {J_EAAI}, author = {Le Fu and Chunfeng Suo}, doi = {10.1016/j.engappai.2025.112355}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112355}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Function structures of information measures for n-polygonal interval-valued intuitionistic fuzzy sets and their application in location selection strategy}, volume = {162}, year = {2025}, }
• (2025). Two-dimensional refined composite multi-scale revised ensemble dispersion entropy and its application to fault diagnosis of rolling bearing. EAAI, 162, 112354. (www)

  @article{ , abstract = {One-dimensional ensemble dispersion entropy (EDE 1D ) can effectively characterize the nonlinear dynamic characteristics of one-dimensional time series, but the complexity of two-dimensional space is not reflected, and only single-scale features can be captured. Firstly, to comprehensively capture the feature information of two-dimensional space, the symmetrized dot pattern (SDP) is introduced to overcome the shortcomings of the ordinary images lack of physical meaning and the time-frequency distribution methods exhibit incomplete information representation, etc. Simultaneously, the amplitude and frequency information are intuitively expressed by a two-dimensional mirror snowflake symmetrized image (MSSI 2D ). Secondly, to overcome the shortcomings of single-scale and traditional coarse-graining, a two-dimensional refined composite multi-scale coarse-graining method is proposed, which improves the accuracy of feature extraction and reduces the calculation deviation. After that, a new feature extraction method namely two-dimensional refined composite multi-scale revised ensemble dispersion entropy (RCMREDE 2D ) is proposed, whose parameter stability and performance are explored through simulation analysis. The results demonstrate that the RCMREDE 2D exhibits excellent stability and anti-noise interference ability. Based on the advantages of RCMREDE 2D , a novel fault diagnosis method for rolling bearings is developed by integrating RCMREDE 2D and a firefly algorithm optimized support vector machine (FA-SVM) multi-fault classifier for pattern recognition. The proposed method is further validated through two measured bearing data sets and five comparative methods, and the results indicate that the RCMREDE 2D and FA-SVM achieve the highest recognition accuracy while demonstrating superior stability.}, archive = {J_EAAI}, author = {Wenqing Ding and Jinde Zheng and Haiyang Pan and Jian Cheng and Jinyu Tong}, doi = {10.1016/j.engappai.2025.112354}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112354}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Two-dimensional refined composite multi-scale revised ensemble dispersion entropy and its application to fault diagnosis of rolling bearing}, volume = {162}, year = {2025}, }
• (2025). Sparse and robust elastic net support vector machine with bounded concave loss for large-scale problems. EAAI, 162, 112352. (www)

  @article{ , abstract = {The elastic net support vector machine is an extensively employed method for addressing a range of classification tasks. Nevertheless, a significant drawback of the elastic net support vector machine is its high computational cost when dealing with large-scale classification problems. To address this drawback, we first introduce an innovative non-convex elastic net support vector machine model that employs our newly created bounded concave loss function, which effectively attains both sparsity and robustness. Based on proximal stationary point, we have effectively constructed an innovative optimality theory tailored for our newly created elastic net support vector machine model. By leveraging the innovative optimality theory, we have successfully developed a new and exceptionally effective algorithm designed to enhance computational efficiency through the division of the entire dataset into two distinct categories: working sets and non-working sets. During each learning cycle, the parameters associated with the non-working set remain unchanged. In contrast, the parameters related to the working set are subject to updates. Consequently, our new algorithm facilitates quicker modifications on smaller datasets, improving runtime efficiency and lowering computational complexity. Numerical experiments have demonstrated significant efficiency, particularly regarding computational speed, the number of support vectors, and classification accuracy, surpassing eleven other leading solvers.}, archive = {J_EAAI}, author = {Huajun Wang and Wenqian Li}, doi = {10.1016/j.engappai.2025.112352}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112352}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Sparse and robust elastic net support vector machine with bounded concave loss for large-scale problems}, volume = {162}, year = {2025}, }
• (2025). A review of speaker verification: Methods, network architectures, tasks and challenges. EAAI, 162, 112351. (www)

  @article{ , abstract = {Speaker verification is an important branch of biometric recognition, with wide applications in identity authentication, audio monitoring, and other fields. In recent years, deep learning and meta-learning have made remarkable advancements in the field of speaker verification. Therefore, it is necessary to update existing reviews of speaker verification to reflect the latest research developments. We review literature from the past decade to provide a timely and comprehensive survey of the field. First, we outline the concept and system process of speaker verification. Then, we analyze the speech preprocessing process and common acoustic features used in the systems. Next, we present an overview of speaker modeling approaches, covering traditional probabilistic methods, deep learning-based speaker methods, and meta-learning-based speaker methods, focusing on the latter two methods. We provide an in-depth analysis and summary of the characteristics and the latest network architectures of these methods, focusing on the development of Transformer and large-scale pre-trained Transformer. Furthermore, we introduce the datasets and evaluation metrics used in speaker verification systems, focusing on a detailed and fair comparison of the performance of text-dependent and text-independent speaker verification systems. Finally, we explore the challenges faced by speaker verification systems and discuss future research opportunities.}, archive = {J_EAAI}, author = {Weijie Wang and Hong Zhao and Yikun Yang and Yongjuan Yang}, doi = {10.1016/j.engappai.2025.112351}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112351}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A review of speaker verification: Methods, network architectures, tasks and challenges}, volume = {162}, year = {2025}, }
• (2025). Low-cost and sparsity for continual semantic segmentation. EAAI, 162, 112350. (www)

  @article{ , abstract = {Deep neural networks have contributed to significant progress in semantic segmentation tasks. However, deep neural networks exhibit a critical drop in performance due to catastrophic forgetting when they are required to learn new tasks incrementally. The more plastic the network is, the easier it can learn new tasks. Whereas, for continual semantic segmentation, it is more reliable to preserve the knowledge it has learned from previous tasks. Here, gated 0-1 Bernoulli variable is used as a regularization method to optimize performance by enhancing network sparsity. Then, the special case of gated 0-1 Bernoulli variable is applied in the replay-based method of continual semantic segmentation. Specifically, when the value of the sub-network sampling rate reaches 0.5, the network reaches the strongest stability. Finally, the gated 0-1 Bernoulli variable improves the network’s performance in complex scenarios and reduces cost under similar performance. Experimental results indicate that in using 100% samples for incremental training, the Mean Intersection over Union(mIoU) of the old classes improves by up to 4.6% and 5.5% compared to the baseline at the end of the overall training in continual semantic segmentation scenarios 10-1 and 10-2. Furthermore, in using 60% samples for incremental training, the performance for the old tasks only drops by less than a percentage, while the time cost to complete the full setup decreases by 22%.}, archive = {J_EAAI}, author = {Qing Ji and Bin Li and Shaobo Li and Hongchao An and Jing Yang}, doi = {10.1016/j.engappai.2025.112350}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112350}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Low-cost and sparsity for continual semantic segmentation}, volume = {162}, year = {2025}, }
• (2025). Promoting sustainability-oriented brand activist campaigns: A spherical fuzzy decision support framework for evaluating activist advertising videos. EAAI, 162, 112349. (www)

  @article{ , abstract = {Activist video advertisements represent a strategic form of brand communication in which companies express their stance on social or environmental issues through emotionally driven storytelling and slogan-based narratives. Despite their growing prevalence, there is a notable lack of systematic and quantitative methods for evaluating their performance or comparing their effectiveness across competing brands. This research addresses that gap by proposing a comprehensive decision support system (DSS) designed to assess the performance of activist video advertisements in a structured and reproducible manner. The study introduces a novel hybrid multi-criteria decision-making (MCDM) framework: the spherical cubic fuzzy (SCF)–Aczel-Alsina–ranking comparison (RANCOM)–method based on the removal effects of criteria (MEREC)–deviation-based pairwise assessment ratio technique (DEPART). This methodology integrates subjective weights obtained via SCF–RANCOM and objective weights derived through SCF–MEREC, with both sets of weights combined using SCF-based aggregation operators that incorporate Aczel-Alsina t-norm and t-conorm functions. Performance rankings are then generated using the SCF–DEPART method. To demonstrate the model's applicability, a real-world case study involving eight sustainability-oriented activist video advertisements released in Türkiye was conducted. Evaluations were based on input from ten domain experts across eleven criteria. The analysis identified “convincingness and credibility” as the most critical factor, with “The Voice of Nature” campaign achieving the highest performance rating. The model's robustness was confirmed through scenario-based sensitivity analyses, and its consistency was validated by benchmarking against thirteen alternative MCDM approaches. The findings offer meaningful implications for both academic research and advertising practice.}, archive = {J_EAAI}, author = {Galip Cihan Yalçın and Karahan Kara and Gülcan Işık and Esra Serdar Tekeli and Vladimir Simic and Abdullah Ballı and Dragan Pamucar}, doi = {10.1016/j.engappai.2025.112349}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112349}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Promoting sustainability-oriented brand activist campaigns: A spherical fuzzy decision support framework for evaluating activist advertising videos}, volume = {162}, year = {2025}, }
• (2025). Federated clustering with mutual knowledge distillation for traffic flow prediction. EAAI, 162, 112347. (www)

  @article{ , abstract = {Traffic flow prediction plays a critical role in intelligent transportation systems. Conventional traffic flow prediction methods primarily rely on centralized training, which poses a risk of privacy leakage. Federated learning, a privacy-preserving framework to machine learning, enables distributed participants to jointly train a shared model without sharing local private data. However, traffic flow is typically collected from different devices and contains different temporal patterns, leading to non-independent and identically distributed. To address these challenges, we propose a traffic flow prediction method based on federated clustering with mutual knowledge distillation. We first perform temporal decomposition on the traffic flow data and use mutual learning with adaptive distillation loss to facilitate mutual knowledge transfer among local models during training. Then, we apply spectral clustering to cluster clients based on the cosine similarity of model parameters at the server and design a global model aggregation method to improve the performance of federated learning. Finally, the proposed method is evaluated on two real-world traffic datasets, and the experiment results show significant improvements over traditional federated learning approaches and also outperform federated mutual learning. The results demonstrate that the proposed method effectively captures temporal information and mitigates the effect of non-independent and identically distributed issues.}, archive = {J_EAAI}, author = {Yao Lin and Shengwu Xiong}, doi = {10.1016/j.engappai.2025.112347}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112347}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Federated clustering with mutual knowledge distillation for traffic flow prediction}, volume = {162}, year = {2025}, }
• (2025). Quantifying hybrid failure mode in cyclic-loaded reinforced concrete shear walls: Integrating unsupervised and supervised learning techniques. EAAI, 162, 112346. (www)

  @article{ , abstract = {This paper aims to identify failure types in Reinforced Concrete Shear Walls (RCSWs) by quantifying the contributions of shear and flexural modes in the force-deformation response of the walls. The supporting research database includes images, cyclic curve backbones, and geometric and mechanical characteristics of 253 RCSWs. Initially, the database is manually classified into shear, flexure, and shear-flexure failure modes based on observations of surface damage and the cyclic response of the wall. Subsequently, unsupervised clustering and supervised learning algorithms are employed to probabilistically quantify and predict the participation of flexural and shear modes in the overall seismic response of the walls, respectively. The unsupervised model, utilizing the K-means algorithm, identifies the primary failure modes of the walls, achieving over 90 % concordance with manual expert labeling. Based on the results of unsupervised clustering, a hybridity index is proposed to demonstrate the contributions of shear and flexure failure modes to the overall seismic response. Supervised learning is then used to predict hybridity indices from wall characteristics, with the Extremely Randomized Trees (Extra Trees) model achieving the best results based on a balanced evaluation of multiple performance metrics. SHapley Additive exPlanations (SHAP), a tool for exploring model sensitivity, highlights the aspect ratio as the key influencing factor on failure mode, in accordance with relevant structural engineering codes and standards. Implementation of the proposed framework in exploring the behaviors of four unseen case studies reveals a significant correlation between the predicted hybridity indices and observed damage, consistent with existing guidelines.}, archive = {J_EAAI}, author = {Pouya Ebrahimi and Amir Hossein Asjodi and Kiarash M. Dolatshahi}, doi = {10.1016/j.engappai.2025.112346}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112346}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Quantifying hybrid failure mode in cyclic-loaded reinforced concrete shear walls: Integrating unsupervised and supervised learning techniques}, volume = {162}, year = {2025}, }
• (2025). Dual-path multiple attention-guided feature interaction network for camouflaged object detection. EAAI, 162, 112345. (www)

  @article{ , abstract = {Existing Camouflaged Object Detection (COD) methods rely on features from a pre-trained backbone with a single-encoder structure, leading to initial features biased towards global or local preferences. This affects subsequent feature modeling and degrades COD performance. Some studies use modular or auxiliary flow structures to balance feature preferences but often focus only on interactions between hierarchical features or information flows, ignoring potential redundancy or noise within aggregated features. Therefore, we propose a novel dual-path multiple attention-guided feature interaction network (DMAFI-Net) for COD, which contains four main components: global and local features interaction module (GLFI), intra-feature interaction module (IFI), multi-scale feature enhancement module (MFE), and two decoders including neighbor connection decoder based feature aggregation (NFA) and refine decoder. Specifically, the GLFI is designed to implement the interaction and combination of global and local features, and the combined features will be sent to IFI to mine intra-feature information. Besides, the MFE is introduced to further enrich the extracted features obtained in the IFI. In the feature decoding stage, the NFA module utilizes neighbor connection decoder to fuse multi-scale features and ultimately generates a coarse prediction. Finally, the refine decoder leverages multiple attention modules to refine the initial prediction with the combined features as auxiliary cues and obtain the final camouflaged map. Extensive experiments on four COD benchmark datasets demonstrate the superiority of the proposed framework when compared to 24 state-of-the-art (SOTA) methods in terms of five widely used evaluation metrics. Furthermore, the ablation studies show the effectiveness of main components of our DMAFI-Net.}, archive = {J_EAAI}, author = {Anzhi Wang and Jintao Wu and Shuang Zhao and Yun Liu}, doi = {10.1016/j.engappai.2025.112345}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112345}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dual-path multiple attention-guided feature interaction network for camouflaged object detection}, volume = {162}, year = {2025}, }
• (2025). TFCTL: Time–Frequency calibrated transfer learning for cross domain depression detection. EAAI, 162, 112344. (www)

  @article{ , abstract = {As the application of speech-based depression detection systems expands, differences in cross-domain data distribution pose significant challenges. This paper proposes the framework of Time–Frequency Calibrated Transfer Learning (TFCTL). This framework first introduces Frequency-Delay Neural Network (FDNN), inspired by Time-Delay Neural Network (TDNN), extending the concept of temporal feature extraction using sliding windows and weight sharing from the time domain to the frequency domain. A multi-level information aggregation module then integrates features of varying abstraction levels from both time-delay and frequency-delay neural networks, balancing global and local speech information. Finally, TFCTL uses transfer learning to calibrate the distribution of the aggregated time–frequency embedding vectors, uncovering commonalities of depression features across different domains. Cross-speaker and cross-corpus experiments were conducted using the Chinese Multimodal Depression Corpus (CMDC) and the Distress Analysis Interview Corpus Wizard-of-Oz (DAIC-WOZ). In cross-speaker scenarios, TFCTL achieved F1 scores of 0.7324 on DAIC and 0.9660 on CMDC, outperforming other methods. In cross-corpus scenarios, TFCTL achieved F1 scores of 0.6743 on DAIC and 0.6879 on CMDC, demonstrating its robustness in addressing domain mismatch issues. The source code used in the paper is available at https://anonymous.4open.science/r/TFCTL-A545/ .}, archive = {J_EAAI}, author = {Dongdong Li and Li Ding and Zuo Yang and Zhe Wang and Ke Zhao}, doi = {10.1016/j.engappai.2025.112344}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112344}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {TFCTL: Time–Frequency calibrated transfer learning for cross domain depression detection}, volume = {162}, year = {2025}, }
• (2025). Mutual information guided invertible image hiding network. EAAI, 162, 112343. (www)

  @article{ , abstract = {Image hiding techniques are commonly used for secure communication, copyright protection, and visual privacy. Invertible neural network (INN) have emerged as a promising approach for image steganography, enabling the concealment and recovery of secret images through forward and backward mappings within the network. However, existing methods often face limitations in the accuracy of recovered images due to challenges in estimating the lost information during the forward process. To address this issue, we propose a Mutual Information Guided Invertible Image Hiding Network (MIGIIHNet), which leverages mutual information estimation between the lost information and the stego image in the forward process to guide the backward mapping for reconstruction. Specifically, we propose a lightweight INN with a channel attention feature aggregation module (CAFAM), integrating a channel attention mechanism to optimize the multi-scale aggregation of both low-level and high-level features in a single forward pass. Also, an association learning module (ALM) is designed to model the mutual information between the stego image and the lost information during the forward hiding process. Then, the mutual information is utilized to reconstruct the secret image with high accuracy. Extensive experimental results show that MIGIIHNet outperforms existing state-of-the-art methods in terms of invisibility, security, and recovery accuracy, while maintaining low computational complexity.}, archive = {J_EAAI}, author = {Kehan Zhang and Fen Xiao and Jingwen Cai and Xieping Gao}, doi = {10.1016/j.engappai.2025.112343}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112343}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Mutual information guided invertible image hiding network}, volume = {162}, year = {2025}, }
• (2025). Long-tailed detection and classification of wafer defects from scanning electron microscope images robust to diverse image backgrounds and defect scales. EAAI, 162, 112342. (www)

  @article{ , abstract = {In semiconductor engineering, high yield of wafers relies on accurate detection and classification of wafer defects. The dataset for detecting wafer defects presents three primary challenges: (i) different background types, (ii) variable image or defect scales, and (iii) imbalanced data with a long-tailed distribution of defect types. These challenges create significant limitations for traditional classification techniques. To address these issues, we propose a stratified framework called Wafer Detection and Classification (WaferDC), designed specifically for detecting and classifying wafer defects from scanning electron microscope (SEM) images. Our framework achieves high defect detection performance on SEM wafer images by utilizing a multi-cluster memory bank, which effectively handles the challenges of (i) variable background types and (ii) differing image or defect scales. Building on this robust detection, we propose Segmentation and Mix (SegMix), a novel defect augmentation technique based on anomaly heatmaps, which enhances the reliability of defect detection and classification in a (iii) long-tailed imbalanced environment. Finally, we pass defect-classified images through a parameter-efficient fine-tuning (PEFT)-based classifier (Shiet al., 2023) utilizing a vision transformer (ViT) architecture, further improving overall defect detection and classification performance. We rigorously tested WaferDC on a proprietary SEM wafer dataset and the public Describable Textures Dataset-Synthetic (DTD-Synthetic) and Magnetic Tile Defect (MTD) datasets. The results confirm the effectiveness of our method in improving defect detection and classification in wafer manufacturing. Our code is available at https://github.com/SpatialAILab/WaferDC .}, archive = {J_EAAI}, author = {Taekyeong Park and Yongho Son and Sanghyuk Moon and Seungju Han and Je Hyeong Hong}, doi = {10.1016/j.engappai.2025.112342}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112342}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Long-tailed detection and classification of wafer defects from scanning electron microscope images robust to diverse image backgrounds and defect scales}, volume = {162}, year = {2025}, }
• (2025). Fast trajectory planner with a reinforcement learning-based controller for robotic manipulators. EAAI, 162, 112341. (www)

  @article{ , abstract = {Generating obstacle-free trajectories for robotic manipulators in unstructured and cluttered environments remains a significant challenge. Existing motion planning methods often require additional computational effort to generate the final trajectory by solving kinematic or dynamic equations. This paper highlights the strong potential of model-free reinforcement learning methods over model-based approaches for obstacle-free trajectory planning in joint space. We propose a fast trajectory planning system for manipulators that combines vision-based path planning in task space with reinforcement learning-based obstacle avoidance in joint space. We divide the framework into two key components. The first introduces an innovative vision-based trajectory planner in task space, leveraging the large-scale fast segment anything (FSA) model in conjunction with basis spline (B-spline)-optimized kinodynamic path searching. The second component enhances the proximal policy optimization (PPO) algorithm by integrating action ensembles (AE) and policy feedback (PF), which greatly improve precision and stability in goal-reaching and obstacle avoidance within joint space. These proximal policy optimization (PPO) enhancements increase the algorithm’s adaptability across diverse robotic tasks, ensuring consistent execution of commands from the first component by the manipulator, while also enhancing both obstacle avoidance efficiency and reaching accuracy. The experimental results demonstrated the effectiveness of proximal policy optimization (PPO) enhancements, as well as simulation-to-simulation (Sim-to-Sim) and simulation-to-reality (Sim-to-Real) transfer, in improving model robustness and planner efficiency in complex scenarios. These enhancements allowed the robot to perform obstacle avoidance and real-time trajectory planning in obstructed environments. https://sites.google.com/view/ftp4rm/home}, archive = {J_EAAI}, author = {Yongliang Wang and Hamidreza Kasaei}, doi = {10.1016/j.engappai.2025.112341}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112341}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Fast trajectory planner with a reinforcement learning-based controller for robotic manipulators}, volume = {162}, year = {2025}, }
• (2025). Bi-level location-routing problem with time windows for mixed-load recycling of heterogeneous batteries: A transformer-based improved deep reinforcement learning algorithm. EAAI, 162, 112340. (www)

  @article{ , abstract = {Given the urgency, timeliness and uncertainty of power batteries recycling, we extend a novel network model for retired battery recycling systems, bi-level capacitated location-routing problem with time windows for heterogeneous battery mixed-load (CLRPTW-HBM). Firstly, the expected interval and linear weighting methods are used to transform and process the lower-level multi-objective function that contains fuzzy variables. Secondly, a Transformer-based improved deep reinforcement learning algorithm (Transformer-IDRL) is proposed. (1) The bi-level CLRPTW-HBM is modeled as Markov decision process, and a policy network model with dual-layer encoder-decoder structure is designed based on Transformer architecture. (2) Randomly generate instance data, and the asynchronous advantage Actor-Critic with adaptive dynamic parameter tuning strategy is employed for training. (3) The action sampling strategy based on roulette reverse selection mechanism, and local search strategy incorporating problem characteristics are introduced to improve solution quality. Finally, extensive experiments are conducted on benchmark datasets and actual cases, and the results demonstrate superior performance of Transformer-IDRL, with an average Gap of 0.22 % and 0.19 %, a 5.30 % reduction in recycling cost, and a 6.06 % reduction in battery exposure risk. These satisfactory results highlight the feasibility and efficiency of the proposed model and method. Additionally, sensitivity analysis of model parameters shows that under different decision-maker preferences and vehicle loading capacity, the sensitivity range of path cost is [5.77 %, 39.85 %] and [16.04 %, 35.54 %], while that of exposure risk is [1.40 %, 3.39 %] and [1.35 %, 5.54 %], indicating that parameter variations significant influence the layout of recycling network and overall path cost. Therefore, decision-makers should flexibly adjust key parameters to balance economic benefits and sustainable development in battery recycling.}, archive = {J_EAAI}, author = {Mengna Zhao and Shiping Chen}, doi = {10.1016/j.engappai.2025.112340}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112340}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Bi-level location-routing problem with time windows for mixed-load recycling of heterogeneous batteries: A transformer-based improved deep reinforcement learning algorithm}, volume = {162}, year = {2025}, }
• (2025). Instantaneous power prediction for industrial robots using tree-based machine learning methods. EAAI, 162, 112339. (www)

  @article{ , abstract = {This article presents a tree-based machine learning methodology for instantaneous power prediction designed, tested and validated using data from an articulated industrial robot. The proposed methodology for instantaneous power prediction materializes through a generic system architecture with functionalities consisting of data acquisition, time alignment of data samples, storage, model learning, instantaneous power prediction and integration in time to evaluate energy consumption at robot operation level. This methodology is designed to evaluate offsite energy consumption of robotized workstations for different layouts characterized by relative position of the robot with respect to the serviced and fly-by points. This is important both for offline virtual commissioning of robotized workstations (determine layout) and for online operation for maintenance purposes (determine energy spikes different from normal model). The analyzed operation is the linear motion of the robot Tool Control Point in Cartesian space, characterized by the complexity of the kinematic model: each joint operates in coordinated motion, adjusting its velocity and acceleration continuously to ensure a straight path with constant speed. A custom Internet of things (IoT) device enables synchronized energy and motion data logging for robots, ensuring consistent values for sampled trajectories. Justification for the usage of tree-based methods and experimental results are provided.}, archive = {J_EAAI}, author = {Ionuţ Lenţoiu and Silviu Răileanu and Theodor Borangiu and Mihnea Constantinescu and Octavian Morariu}, doi = {10.1016/j.engappai.2025.112339}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112339}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Instantaneous power prediction for industrial robots using tree-based machine learning methods}, volume = {162}, year = {2025}, }
• (2025). Toward sustainable wastewater treatment: Transformer ensembles and multitask learning for energy consumption and quality management. EAAI, 162, 112338. (www)

  @article{ , abstract = {Wastewater treatment plants (WWTPs) are among the most energy-intensive components of urban infrastructure and bear strict regulatory responsibilities for wastewater quality. These dual challenges, minimizing energy consumption and maintaining environmental compliance, are deeply interrelated and must be managed simultaneously to achieve sustainable plant operation. This study proposes a framework that comprises two customized components. The first component employs a voting ensemble model based on transformer architecture to predict energy consumption. It processes heterogeneous feature domains — including hydraulic, wastewater, and climatic variables — through parallel attention-driven streams. The outputs from these streams are then aggregated using a weighted voting mechanism to produce the final prediction. Second, a multitask Bidirectional Gated Recurrent Unit (Bi-GRU) forecasts wastewater quality indicators concurrently (ammonia, Biochemical Oxygen Demand (BOD), and Chemical Oxygen Demand (COD)), capturing shared temporal dependencies and reducing model complexity. A hybrid preprocessing strategy is applied, incorporating domain-aware outlier detection (z-score and Interquartile Range (IQR)), K-Nearest Neighbors (KNN) Imputation, and feature selection using Extreme Gradient Boosting (XGBoost). Experimental results showed that. The voting ensemble model achieved the best results for energy consumption prediction with 31.61 of Root Mean Squared Error (RMSE). The multitask Bi-GRU achieved the best results for wastewater quality indicators with RMSE at 6.1689, 48.0323, and 88.2214 for ammonia, BOD, and COD, respectively. This work is among the first to integrate transformer ensembles and multitask learning in a unified WWTP forecasting system. Simultaneously addressing energy efficiency and water quality assurance, this offers a practical, scalable, and intelligent decision-support tool for sustainable wastewater management.}, archive = {J_EAAI}, author = {Hager Saleh and Sherif Mostafa and Shaker El-Sappagh and Abdulaziz AlMohimeed and Michael McCann and Saeed Hamood Alsamhi and Niall O’Brolchain and John G. Breslin and Marwa E. Saleh}, doi = {10.1016/j.engappai.2025.112338}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112338}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Toward sustainable wastewater treatment: Transformer ensembles and multitask learning for energy consumption and quality management}, volume = {162}, year = {2025}, }
• (2025). Complete information extraction for monocular depth estimation using a dual framework. EAAI, 162, 112337. (www)

  @article{ , abstract = {This paper aims to address the problem of efficient extraction of complete multi-scale information for supervised monocular depth estimation. Most of the existing depth estimation methods are based on Convolutional Neural Network (CNN). By gradually exploring the contextual and semantic features, they have achieved good results in scene depth estimation. However, with the expansion of the receptive field, global information limited by the local induction bias is gradually suppressed, resulting in the performance cannot be further improved. Recently, Transformer-based methods have been widely used to model the global correlation between features. Nevertheless, since the Transformer networks are not spatially aware enough, they usually lose local details and have no clear mechanism for reusing features when processing images. The Transformer networks perform self-attention mechanism at each location and cannot directly obtain information from other locations for features. Therefore, we propose a novel dual framework called as Transformer-CNN, which includes the Transformer-branch and the CNN-branch for monocular depth estimation. Specifically, the Transformer-branch is able to model the global contextual information and the CNN-branch can capture local spatial relationships in images. However, simply fusing these two independent branches may result in insufficient feature aggregation. To this end, we design a Parallel Feature Interaction Module (PFIM), which contains a Self-Attention Module (SAM) and a Cross-Attention Module (CAM), so as to highlight features from the Transformer-branch and the CNN-branch respectively and extract complementary information between the two branches. Meanwhile, in order to make full use of the low-level features with low quality in the scene, we propose a Low-level Information Acquisition Module (LIAM) to capture texture-related information and preserve texture details in the CNN-branch. Finally, to address the lack of multi-scale contextual information in Vision Transformer (ViT), we introduce a Wide Area Multi-scale Decoder (WAMD), which incorporates the multi-scale feature representations into the decoder part via a Wide Area Attention (WAA). Extensive experiments on benchmark datasets collected in the outdoor and indoor environments demonstrate the competitive results of the proposed method, compared with the state-of-the-art monocular depth estimation methods.}, archive = {J_EAAI}, author = {Bin Li and Dazheng Zhou and Xianjie Gao and Mingliang Zhang}, doi = {10.1016/j.engappai.2025.112337}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112337}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Complete information extraction for monocular depth estimation using a dual framework}, volume = {162}, year = {2025}, }
• (2025). Towards non-visual bowel cancer diagnosis: A certainty-aware data-driven method of lesion characterisation using a vibrating capsule. EAAI, 162, 112336. (www)

  @article{ , abstract = {Recent advances in miniaturised, dynamically actuated robots have opened new pathways for non-visual, in-situ disease diagnosis. This study explores a novel method for early bowel cancer detection using a self-propelled robotic capsule that navigates the bowel and detects lesions based on variations in tissue stiffness. The approach capitalises on the sensitivity of the capsule’s dynamic responses to surrounding tissue properties. A dual-phase machine learning framework is proposed. The first phase uses regression models including multilayer perceptron (MLP), support vector regression (SVR), and Gaussian process regression (GPR) to predict tissue stiffness from displacement signal features. The second phase uses a Gaussian mixture model (GMM) to cluster the predicted stiffness values into different categories. Unlike our previous work, this study emphasises the robustness of the models under varying data conditions using both accuracy and reliability-oriented metrics. Based on our studies, MLP provided the most reliable regression results for simulated data and downstream clustering, though GPR performed better on experimental datasets. SVR consistently underperformed, especially on experimental data. The GMM achieved over 89% clustering accuracy across both simulated and experimental datasets, with improved results when predictions from more accurate regression models are used as the inputs. This work demonstrates a promising step toward dynamic, in-situ lesion characterisation and highlights the potential for integrating lesion biomechanics into future endoscopic diagnosis.}, archive = {J_EAAI}, author = {Kenneth Omokhagbo Afebu and Yang Liu and Evangelos Papatheou and Shyam Prasad}, doi = {10.1016/j.engappai.2025.112336}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112336}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Towards non-visual bowel cancer diagnosis: A certainty-aware data-driven method of lesion characterisation using a vibrating capsule}, volume = {162}, year = {2025}, }
• (2025). Beyond the horizon: A comprehensive analysis of artificial intelligence-based weather forecasting models. EAAI, 162, 112335. (www)

  @article{ , abstract = {The field of Artificial Intelligence (AI)-based weather forecasting is growing rapidly, with continuous progress in model development, techniques, and performance improvements. This paper provides a comprehensive overview of AI-based weather forecasting models, focusing on their current status, challenges, and directions for further development. A review of more than 40 models, primarily proposed after 2015, underscores the importance of critically examining various aspects of AI-based forecasting. Unlike previous reviews that targeted only a limited number of models or features, this study addresses a complete set of aspects and analyzes existing challenges from multiple perspectives. These aspects include the Machine Learning (ML) and Deep Learning (DL) methods used, datasets, predictand parameters, overfitting, and capability for forecasting extreme weather, lead time, spatiotemporal scale, performance criteria, overfitting, data assimilation, data-driven models, and the analysis of state-of-the-art (SOTA) models such as FengWu, ClimaX, Pangu-Weather, FourCastNet, GraphCast, GenCast, and Artificial Intelligence Forecasting System (AIFS) from various viewpoints. The review also discusses current challenges, including limited historical data and data quality, small-scale weather forecasting, model explainability, uncertainty, extreme weather prediction, physical constraints, temporal adaptation, and generalization, and outlines potential future directions.}, archive = {J_EAAI}, author = {Saeid Haji-Aghajany and Witold Rohm and Piotr Lipinski and Maciej Kryza}, doi = {10.1016/j.engappai.2025.112335}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112335}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Beyond the horizon: A comprehensive analysis of artificial intelligence-based weather forecasting models}, volume = {162}, year = {2025}, }
• (2025). Neural model of the adaptive tuned particle impact damper. EAAI, 162, 112334. (www)

  @article{ , abstract = {The paper presents a novel approach for the modeling of the Adaptive Tuned Particle Impact Damper (ATPID) using Multilayer Perceptron (MLP). The main motivation was the recognition that such an approach can support the development of novel neural modeling and the optimal determination of damper parameters in terms of mechanical vibration attenuation. The training data were obtained using a theoretical model validated experimentally. The optimally selected MLP was compared with other regression models using 10 different metrics. A hyperparameter tuning of the determined neural network architecture was conducted based on the input parameters such as excitation amplitude, grain mass, and ATPID damper height. The analyses show that the proposed neural network could quickly and accurately estimate the system’s vibration amplitude and efficiently predict the optimal damper height. The ability to effectively determine the correct optimal height is crucial for ATPID damper control. The high efficiency in predicting the system’s vibration amplitude allows for the replacement of the theoretical model with applied time-consuming contact forces. The MLP accurately estimated vibration amplitudes with 1%–10% error for interpolated data and up to 15% for extrapolated cases. The issue raised is particularly important from the perspective of real-time damper control. It was found that computing a single case using the artificial neural network is more than ten times faster compared to the theoretical model. Therefore, the proposed ATPID damper model based on a neural network forms the basis for further considerations and scientific research to finally propose a control algorithm in the future.}, archive = {J_EAAI}, author = {Mateusz Żurawski and Karolina Grabska and Robert Zalewski and Adam Kulawik}, doi = {10.1016/j.engappai.2025.112334}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112334}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Neural model of the adaptive tuned particle impact damper}, volume = {162}, year = {2025}, }
• (2025). An adaptive hybrid machine reading comprehension framework for multimodal emotion-cause pair extraction in conversations. EAAI, 162, 112333. (www)

  @article{ , abstract = {Multimodal emotion-cause pair extraction in conversations (MECPEC) has gradually evolved into an emerging task aimed at discovering deeper causal relationships between emotions and their corresponding causes in conversational contexts. It has widespread application in fields such as human–computer interaction, social media analysis, customer feedback management, and empathetic companion, among others. However, the challenges posed by the oversimplified multimodal feature fusion mechanism and the failure to account for the relative positional relationship between emotions and causes still hinder the performance of MECPEC. In this study, we propose an adaptive hybrid machine reading comprehension (AHMRC) framework to extract potential emotion-cause pairs inherent in conversations. The MECPEC task is first transformed into a two-round hybrid machine reading comprehension task that sequentially enforces the global emotion query and the local cause query with the goal of exploring the relative position constraint specific to conversations. Subsequently, an adaptive multimodal attention module is designed by incorporating features extracted from text, video, and audio modalities, and adaptively fusing them according to their contributions. Extensive experiments were carried out on the benchmark datasets to demonstrate the effectiveness of the proposed AHMRC framework in comparison to other state-of-the-art methods in the literature.}, archive = {J_EAAI}, author = {Guorui Li and Xufeng Duan and Cong Wang and Sancheng Peng}, doi = {10.1016/j.engappai.2025.112333}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112333}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An adaptive hybrid machine reading comprehension framework for multimodal emotion-cause pair extraction in conversations}, volume = {162}, year = {2025}, }
• (2025). Analytical and machine learning approaches for three-dimensional orthotropic functionally graded cylindrical structure in steady heat conduction. EAAI, 162, 112332. (www)

  @article{ , abstract = {Theoretical and computational modelling of heat conduction in a functionally graded cylinder has been rigorously investigated in prior studies, owing to its critical significance in high-stakes engineering applications such as nuclear reactor design, aerospace structural systems, and pressure vessel technology. Despite this extensive body of work, the majority of these studies have mostly focused on simplified two-dimensional models, frequently presuming idealized thermal parameters such as isotropic thermal conductivity, constant convection coefficients, and spatially uniform ambient temperatures. These simplifications overlook the crucial role of spatially varying thermal characteristics and three-dimensional (3D) temperature distributions, which are essential for accurately simulating the complex heat conduction behaviors found in real-world engineering. Unlike prior research, this study presents an analytical solution for heat conduction under non-homogeneous generalized Robin boundary conditions, capturing 3D thermal conductivity inhomogeneities along three orthogonal directions using Sturm-Liouville theory and finite integral transforms. However, while such analytical methods are highly accurate for simpler geometries, they often encounter significant challenges when extended to scenarios involving complex material gradients and irregular domains. A gradient-enhanced physics-informed neural network (g-PINN) framework is proposed to tackle these challenges, utilizing neural networks that incorporate physical laws and gradient information to enhance its applicability to complex configurations. This combined approach presents a novel framework that integrates classical theory with machine learning, facilitating precise modelling of thermal phenomena in functionally graded cylinders. The findings indicate that both the analytical and machine learning approaches (g-PINN) align closely with presented solutions, precisely capturing the energy equation and more complex boundary conditions.}, archive = {J_EAAI}, author = {Palash Das and Md Ashraful Islam and Dipayan Mondal}, doi = {10.1016/j.engappai.2025.112332}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112332}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Analytical and machine learning approaches for three-dimensional orthotropic functionally graded cylindrical structure in steady heat conduction}, volume = {162}, year = {2025}, }
• (2025). Robust spurious drug–drug interaction detection via chi-square-guided bidirectional attention mechanism. EAAI, 162, 112331. (www)

  @article{ , abstract = {Spurious drug–drug interactions arising from experimental biases can compromise treatment safety and hinder effective clinical decision-making for patients. However, current molecular representation learning methods still face significant challenges in addressing this problem. First, most graph neural network-based approaches consider only single-direction interactive semantic extraction between drug molecules, failing to capture more granular relationships between drugs fully. Moreover, during training, they are vulnerable to noise from negative sampling and cannot sufficiently leverage the complete drug–drug interaction annotations, resulting in reduced robustness and accuracy in downstream tasks. To this end, we propose a robust spurious DDI detection framework that employs chi-square-guided bidirectional attention to capture fine-grained and bidirectional interaction patterns. First, considering their mutual information flow, a two-way cross-attention mechanism is introduced for a more granular extraction of cross-drug molecular interaction semantic representations through bidirectionally perceiving interactive features between drugs. Second, on the basis of robust minimum covariance determinant theory, we propose a chi-square distribution-based spurious detection method to approximate the correctly annotated drug–drug interactive feature space to a chi-square distribution for a complete feature representation. Extensive experiments on benchmark datasets further validate our method’s effectiveness over state-of-the-art methods, particularly in noisy interference scenarios. Our code is available at https://github.com/AlexCostra/cd .}, archive = {J_EAAI}, author = {Wei-Yu Shi and Yi-Jia Zhang and Jin-Zhong Ning}, doi = {10.1016/j.engappai.2025.112331}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112331}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Robust spurious drug–drug interaction detection via chi-square-guided bidirectional attention mechanism}, volume = {162}, year = {2025}, }
• (2025). A domain adaptation method to defend chinese textual adversarial attacks via prompt-tuning. EAAI, 162, 112330. (www)

  @article{ , abstract = {The textual adversarial attack aims to fool existing models into making erroneous predictions by adding strategic perturbations to normal data without affecting the user’s understanding. Recently, methods based on Pre-trained Language Models (PLMs) and Large Language Models (LLMs) have shown promising performance in various Natural Language Processing (NLP) downstream tasks. However, due to significant deviations between the original and perturbed texts, these methods struggle to achieve satisfactory results in defending against textual adversarial attacks, especially in Chinese, which has unique syntactic structures. To address this issue, we propose a domain adaptation method for defending against Chinese textual adversarial attacks through a prompt-tuning model, which effectively mitigates the discrepancy between different domains. Specifically, the original and perturbed texts are treated as the source and target domains, respectively, with the textual adversarial defense task framed as a cross-domain classification problem. The soft prompt-tuning model trained in the source domain is iteratively adapted to uncover the true label information in the target domain. The graph attention network is incorporated to integrate Chinese syntactic structure information with semantic features. Through a voting mechanism on predicted labels generated by the iterative model, soft prompt-tuning is further optimized for cross-domain classification tasks. Extensive experimental results demonstrate the superior effectiveness of our method in Chinese textual adversarial defense tasks compared to baseline methods, including the state-of-the-art fine-tuning approaches for PLMs and LLMs.}, archive = {J_EAAI}, author = {Yi Zhu and Zhenglong Li and Yun Li and Yunhao Yuan and Jipeng Qiang}, doi = {10.1016/j.engappai.2025.112330}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112330}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A domain adaptation method to defend chinese textual adversarial attacks via prompt-tuning}, volume = {162}, year = {2025}, }
• (2025). A novel high-accuracy graph neural network-based rumor detection method. EAAI, 162, 112329. (www)

  @article{ , abstract = {Rumors spreading on social media platforms result in potential damages. A precise rumor detection mechanism can help form a healthy public opinion environment. In recent years, deep learning-based rumor detection methods, especially graph model-based ones, have risen and reached promising performance. However, there are several defects in existing methods, which limit models from efficiently utilizing the propagation structure. In this paper, we propose a novel rumor detection model, which has high accuracy and reaches state-of-the-art performance. First, we design a powerful comprehensive rumor feature extractor that explicitly overcomes the restriction of previous Graph Neural Networks-based models. Then, by introducing Kernel Subtree features, our model acquires the capability to learn crucial local features from important nodes. Comparative experiments performed on two real-world social media platforms demonstrate that our work reaches state-of-the-art performance, which outperforms the best baseline with 1.6% and 1.9% in accuracy respectively.}, archive = {J_EAAI}, author = {Xi Xiao and Zeming Wu and Chengzong Cai and Tian Bian and Guangwu Hu and Qing Li and Cheng Huang}, doi = {10.1016/j.engappai.2025.112329}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112329}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel high-accuracy graph neural network-based rumor detection method}, volume = {162}, year = {2025}, }
• (2025). Committee of multi-scale nonlinear learning frameworks for accurate stock price forecasting. EAAI, 162, 112325. (www)

  @article{ , abstract = {Dependable stock price predictions are vital for optimizing economic policies and investment strategies in both national and corporate settings. However, the intrinsic volatility and intricacy of stock prices pose considerable challenges. Thus, this paper introduces a novel Committee of Multi-scale Nonlinear Learning Frameworks (CoML) that employs a three-stage model: decomposition, reconstruction, and prediction. First, a complete ensemble empirical mode decomposition with adaptive noise is adopted to decompose the original stock prices into multiple intrinsic mode functions. Secondly, a fine-to-coarse algorithm is applied to reconstruct the intrinsic mode functions, so as to effectively extract short-term fluctuations and long-term trends. Finally, an ensemble of nonlinear models including bidirectional long short-term memory (BiLSTM), support vector regression (SVR) and multi-layer perceptron (MLP) is used to learn and forecast features extracted to obtain high performance. Experimental results indicate that the model performs exceptionally well in both emerging and developed markets highlighting the innovative capabilities of CoML in highly complex and volatile financial markets. The proposed model is further validated using Model Confidence Set and the results indicate that the model is statistically significant.}, archive = {J_EAAI}, author = {Qian He and Yanhui Liang and Yu Lin and Dazhi Pan and Yuying Yue}, doi = {10.1016/j.engappai.2025.112325}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112325}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Committee of multi-scale nonlinear learning frameworks for accurate stock price forecasting}, volume = {162}, year = {2025}, }
• (2025). Learning robust brain tumor segmentation under label corruption and data scarcity. EAAI, 162, 112322. (www)

  @article{ , abstract = {Deep learning models for medical image segmentation often struggle with performance issues when datasets are affected by label noise or annotation errors, commonly introduced during manual process or lack of proficiency. These noisy annotations disrupt the loss function, leading to "partially incorrect" gradients that impair the model's learning and overall performance. Additionally, the limited availability of scanned data for training often makes it challenging to develop a robust model. A common approach to address this issue is to leverage similar large annotated datasets. However, differences in dataset distributions can also lead to inconsistencies, introducing erroneous gradients during training and further impacting model performance. To address these challenges, we propose MGR-DAS (Meta-Gradient Reweighting via Direction-Aware Similarity), a novel meta-learning-based approach that can automatically evaluate the reliability of training samples during training using a small, clean subset easily curated from the noisy dataset. Our method quantifies reliability by measuring the cosine similarity between the gradients of noisy training samples and those of the clean subset. Samples with higher gradient alignment are assigned greater weights during training, effectively reducing the impact of noisy labels and improving model robustness. We evaluate our method using three standard metrics for medical image segmentation: the Dice Similarity Coefficient (DSC), the 95th percentile Hausdorff Distance (HD95), and Intersection over Union (IoU). The proposed MGR-DAS achieved an overall 2.4 % improvement in the DSC on the brain tumor segmentation (BraTS, 2021) dataset. Remarkably, even with only 10 clean annotations used in the reweighting algorithm, our method yielded a 28.7 % gain in DSC. In real-world, data-scarce scenarios, our proposed MGR-DAS also improved the overall DSC score by 2.6 % on BraTS pediatric (BraTS-PEDs) and by 1.0 % on BraTS-Africa, demonstrating strong generalizability and robustness. Experimental results confirm that the proposed method reliably identifies noisy data, prioritizes clean data through adaptive weighting, and outperforms existing fine-tuning, curriculum learning techniques, and other meta-learning frameworks commonly employed in classification tasks.}, archive = {J_EAAI}, author = {Abdulkhalek Al-Fakih and Abbas Mohamed Rezk and Abdullah Shazly and Kanghyun Ryu and Mohammed A. Al-masni}, doi = {10.1016/j.engappai.2025.112322}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112322}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Learning robust brain tumor segmentation under label corruption and data scarcity}, volume = {162}, year = {2025}, }
• (2025). Zero-shot learning augmented slow feature analysis for semantic-aware industrial process fault detection. EAAI, 162, 112321. (www)

  @article{ , abstract = {Slow Feature Analysis (SFA) has shown considerable success in the field of industrial process fault detection. Nonetheless, due to its unsupervised nature, SFA relies solely on the normal training data and overlooks the incorporation of prior process knowledge, which consequently diminishes its efficacy in early fault detection. To mitigate this limitation, this paper introduces the concept of Zero-Shot Learning (ZSL) and proposes an improved SFA approach, referred to as ZSL-SFA. This novel method leverages fault semantic representations as auxiliary knowledge to enhance fault detection sensitivity in industrial process monitoring. The ZSL-SFA framework implements a dual-model collaborative monitoring system: (1) a primary SFA model is developed using normal operational data to capture the dynamic characteristics of the process; and (2) a semantic encoding mechanism, grounded in expert knowledge, is devised to build the auxiliary model, where a probabilistic attribute learner adaptively extracts semantic information from fault attribute descriptions, facilitating effective fault knowledge transfer through similarity analysis. The monitoring outcomes from both the primary and auxiliary models are integrated using a Bayesian fusion strategy, culminating in a comprehensive ZSL-SFA monitoring system. The main advantage of this method is its ability to fully exploit prior process knowledge to enhance the basic SFA model without the need for additional labeled fault samples. Experimental validations on the Tennessee-Eastman process simulation platform are performed to indicate that the proposed ZSL-SFA method surpasses the basic SFA method in terms of fault detection performance.}, archive = {J_EAAI}, author = {Wenjie Yang and Xiaogang Deng and Lumeng Huang and Yuping Cao}, doi = {10.1016/j.engappai.2025.112321}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112321}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Zero-shot learning augmented slow feature analysis for semantic-aware industrial process fault detection}, volume = {162}, year = {2025}, }
• (2025). Multi-scale embedding with guided attention for medical image analysis. EAAI, 162, 112319. (www)

  @article{ , abstract = {Accurate classification of medical images is pivotal for enhancing diagnostic accuracy and optimizing treatment strategies. Traditional methods encounter challenges in delineating clear inter-class boundaries within high-dimensional feature spaces affected by class overlap. This study introduces a Multi-Scale Embedding with Guided Attention (MSEGA) framework based on deep learning autoencoders that integrates innovative guided attention learning mechanisms without explicit target mask supervision for tumor detection and classification. The framework incorporates Multi-scale Feature Extraction Blocks and Depthwise Separable Convolution Blocks to comprehensively capture image features. Through Channel Attention and Spatial Attention mechanisms, the MSEGA method prioritizes critical tumor regions across scales. We also propose a novel interpretable embedding learning loss function to optimize image embeddings, highlighting crucial regions and refining category distinctions. Empirical evaluations on two brain tumor Magnetic Resonance Imaging (MRI) datasets demonstrate our approach surpasses conventional methods including Convolutional Neural Networks and Vision Transformers in classification accuracy and generalizability. These results underscore the framework’s potential as a versatile artificial intelligence-powered tool in medical image analysis.}, archive = {J_EAAI}, author = {Zeyan Li and Yifei Peng and Yizun Lin}, doi = {10.1016/j.engappai.2025.112319}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112319}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multi-scale embedding with guided attention for medical image analysis}, volume = {162}, year = {2025}, }
• (2025). Multimodality based deep learning method for cancer-related T-cell receptor sequence prediction. EAAI, 162, 112318. (www)

  @article{ , abstract = {T-cell receptor sequences (TCR-seq) are closely related to cancers, and in particular, cancer-related TCR-seq are crucial in cancer diagnosis and treatment. Current prediction methods for cancer-related TCR-seq often focus solely on the sequence structure, neglecting its spatial structure. Therefore, we propose a multimodal deep learning method based on parallel and residual structures (MDPR) for the detection of cancer-related TCR-seq. MDPR can effectively integrate the spatial and sequence structure of TCR-seq for accurately identifying cancer-related sequences. First, we introduce a TCR-seq encoding method based on atomic three-dimensional spatial coordinates, allowing for more effective extraction of the spatial structural features of TCR-seq. Second, we use high-dimensional word vectors instead of the amino acid feature vectors traditionally used by other researchers. Third, we pretrain the spatial feature extraction module and then conduct joint training with the sequence feature extraction module. This approach allows the model to better consider the relationship between the two modalities, thereby improving prediction accuracy. Finally, MDPR achieved an area under the curve (AUC) of 0.971 after ten rounds of three-fold cross-validation on the dataset. The AUC of MDPR is 5% higher than that of the previous best method. In short, we propose an artificial intelligence method called MDPR, and apply it to the biomedical field. MDPR can be obtained from https://github.com/biomg/MDPR .}, archive = {J_EAAI}, author = {Junjiang Liu and Shusen Zhou and Mujun Zang and Chanjuan Liu and Tong Liu and Qingjun Wang}, doi = {10.1016/j.engappai.2025.112318}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112318}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Multimodality based deep learning method for cancer-related T-cell receptor sequence prediction}, volume = {162}, year = {2025}, }
• (2025). A combined perspective self-supervised contrastive learning framework for human activity recognition integrating instance prediction and clustering. EAAI, 162, 112317. (www)

  @article{ , abstract = {Human activity recognition (HAR) is a significant application for wearable devices, which primarily identifies current human activities by analyzing sequential sensor data. The real-time data recording of wearable devices enables the collection of vast amount of unlabeled data. Utilizing this data for self-supervised contrastive pre-training of HAR models presents a feasible solution to the decline in recognition performance due to limited labeled data. However, traditional contrastive learning frameworks are primarily designed based on positive and negative sample pairs in the image domain. The relatively simple sequence data of HAR is prone to generating incorrect negative pairs, thus pre-training HAR models solely in this manner is unsatisfactory. Given the phenomena described above, this paper proposes an Instance Prediction and Clustering Self-supervised Contrastive Learning Framework (IPCSC) for HAR, considering the characteristics of human activity data. IPCSC circumvents negative sample pairs, instead extracting contrastive information at the instance perspective by prediction tasks among various augmented views of samples and integrating clustering concepts for contrastive learning from a holistic perspective. The primary objective is to enable the model to discern critical information within human activity data and distinguishable features between different activities, thereby improving the model’s pre-training efficacy and enhancing its downstream activity recognition performance. Numerous experimental analyses demonstrate that IPCSC outperforms other self-supervised methods, achieving an average F1-Score performance improvement of 5.65%, 4.11%, and 7.99% over supervised baselines on the UCI-HAR, MobiAct, and MotionSense datasets, respectively, with only 1% of the labeled data.}, archive = {J_EAAI}, author = {Zhixuan Yang and Kewen Li and Zongchao Huang and Zhifeng Xu and Xinyuan Zhu and Yuan Xiao}, doi = {10.1016/j.engappai.2025.112317}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112317}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A combined perspective self-supervised contrastive learning framework for human activity recognition integrating instance prediction and clustering}, volume = {162}, year = {2025}, }
• (2025). A self-supervised method for learning path-augmented knowledge graph embedding. EAAI, 162, 112315. (www)

  @article{ , abstract = {Knowledge graphs (KGs) consist of factual triples that describe relations between entities in the real world. Knowledge graph embedding (KGE) aims to map entities and relations into constantly low-dimensional vectors, which is important for lots of downstream tasks (e.g., KG completion and information retrieval). Current KGE methods primarily rely on explicit structural patterns, neglecting latent contextual semantics behind those structures and resulting in sub-optimal performance. While some methods incorporate additional data (e.g., textual descriptions), such dependencies limit applicability due to additional data requirements. Furthermore, most KGE models suffer from limited supervision with sparse labeled triples, restricting their capacity to learn comprehensive semantic features. Inspired by the simple but effective self-supervised language model word2vec, one interesting question is: Can KGE be performed as a simple self-supervised language model ? To achieve this, we innovatively propose a self-supervised KGE framework that learns entity and relation embeddings by adapting word2vec’s skip-gram objective to path sequences extracted from KGs. Our framework employs separate embedding spaces for entities and relations with an entity-relation mapping mechanism for effective interaction between the two embedding spaces. Further, to enhance the training efficiency, we introduce a markov chain-based negative sampling strategy, which generates semantically meaningful negative samples by preserving the structural contexts along KG paths. Our framework, which is the first attempt to follow the context-based self-supervised idea of language models to conduct KGE tasks, addresses the constraints of label-dependent supervised KGE techniques and obviates the requirement for external information, while simultaneously enabling effective extraction of the implicit contextual semantics inherent in triple structures. Experiments on two widely-used KGE datasets show state-of-the-art performance, demonstrating our framework’s ability to learn semantically rich representations solely from graph structure.}, archive = {J_EAAI}, author = {Tong Shen and Fu Zhang and Jingwei Cheng}, doi = {10.1016/j.engappai.2025.112315}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112315}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A self-supervised method for learning path-augmented knowledge graph embedding}, volume = {162}, year = {2025}, }
• (2025). A single-cell RNA sequencing data imputation method based on non-negative matrix factorization and multi-kernel similarity network fusion. EAAI, 162, 112313. (www)

  @article{ , abstract = {Artificial intelligence-based single-cell RNA sequencing (scRNA-seq) technology is widely used in cell type identification and disease research, but its data often contain a large number of missing values and zero values due to technical limitations and biological differences. These zero values not only affect downstream analysis, but also make it difficult to distinguish technical zero values from biological zero values. Therefore, this paper proposes a scRNA-seq data interpolation method (sc-MKNMF) based on non-negative matrix factorization and multi-kernel similarity network fusion for the first time. This method improves the accuracy of cell clustering by accurately filling some zero values. First, sc-MKNMF uses gene-cell dual-level analysis to distinguish technical zero values from biological zero values, and then calculates the similarity network of multi-kernel fusion of genes and cells respectively. Then, this method uses non-negative matrix factorization combined with similarity network to construct the objective function, and introduces sparse regularization terms to ensure the similarity between genes and cells and improve stability. In addition, sc-MKNMF is also equipped with an efficient optimization algorithm to promote its convergence by continuously updating the objective function. Finally, the verification and comparative experiments on 12 scRNA-seq datasets show that the sc-MKNMF method outperforms other advanced data interpolation methods. In addition, the extension of sc-MKNMF to the two tasks of cell trajectory inference and differentially expressed gene analysis showed significant improvement and excellent versatility.}, archive = {J_EAAI}, author = {Pei Liu and Cheng Chen and Hao Liu and Jin Gu and Xinya Chen and Ying Su and Zhiyuan Cheng and Xiaoyi Lv and Chen Chen}, doi = {10.1016/j.engappai.2025.112313}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112313}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A single-cell RNA sequencing data imputation method based on non-negative matrix factorization and multi-kernel similarity network fusion}, volume = {162}, year = {2025}, }
• (2025). A novel object detection model for sugar beet cercospora leaf spot in field scenarios based on large kernel decomposition and spatial channel interaction attention. EAAI, 162, 112311. (www)

  @article{ , abstract = {Cercospora leaf spot (CLS) is a widespread disease that seriously threatens beet yield and sugar quality. Timely detection enables farmers to take early control measures and reduce economic losses. Although artificial intelligence (AI)-based methods are replacing manual inspection in agriculture, CLS detection in complex field environments remains highly challenging due to subtle early-stage symptoms and severe occlusions caused by overlapping leaves and weeds. To address these challenges, this paper presents Cercospora Leaf Spot–You Only Look Once (CLS–YOLO), an enhanced detection model built upon You Only Look Once version 11 (YOLOv11), incorporating novel modules specifically designed for accurate CLS detection under challenging field conditions. To improve the detection of weak and early-stage symptoms, we design the Multi-Scale Large Kernel Decomposition (MSLKD) module, which enhances feature extraction for subtle lesions. Furthermore, we develop the Spatial-Channel Interaction Attention (SCIA) module to mitigate detection errors arising from occlusion and fragmented disease patterns by refining multi-scale feature representations. Experimental results demonstrate CLS–YOLO achieves superior performance, reaching an mAP@0.5 of 73.6% ± 0.2% and an mAP@0.5:0.95 of 40.6% ± 0.3% over five independent runs, outperforming twelve mainstream object detection algorithms while maintaining lightweight efficiency. To validate generalization capability across scenarios, crops, and diseases, we conducted comparative experiments on two public crop disease datasets, where our method achieved superior overall performance. In summary, this study provides an effective AI-driven solution for precise crop disease detection, contributing to the practical advancement of intelligent agriculture.}, archive = {J_EAAI}, author = {Hualong Dong and Yi Lu and Yurong Qian and Xuefei Ning and Ting Chen and Ke Tang}, doi = {10.1016/j.engappai.2025.112311}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112311}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A novel object detection model for sugar beet cercospora leaf spot in field scenarios based on large kernel decomposition and spatial channel interaction attention}, volume = {162}, year = {2025}, }
• (2025). ElecBench: A large language model benchmark in electric power domain. EAAI, 162, 112310. (www)

  @article{ , abstract = {Large language models (LLMs) have made substantial advancements in the field of natural language processing, necessitating the development of new benchmarks to accurately track their progress. In this paper, we introduce ElecBench, the first benchmark specifically designed for the electric power domain. ElecBench comprises 24 datasets spanning different scenarios, covering general electric power knowledge and four specific business applications, with a total of 34,030 data entries. Furthermore, we evaluate the performance of a series of open-source Chinese LLMs on ElecBench. Our experiments demonstrate that ElecBench serves as an effective benchmark for electric power scenarios and highlight that existing LLMs require further optimization to gain domain-specific knowledge and achieve better performance.}, archive = {J_EAAI}, author = {Sai Zhang and Qiaochu Huang and Qiang Zhang and Xiao Liang and Weiwei Liu and Kunlun Gao and Fei Zhou and Congcong Shi}, doi = {10.1016/j.engappai.2025.112310}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112310}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {ElecBench: A large language model benchmark in electric power domain}, volume = {162}, year = {2025}, }
• (2025). Reinforcement learning-based trajectory tracking optimal control for underactuated unmanned surface vehicles under asymmetric input saturation. EAAI, 162, 112307. (www)

  @article{ , abstract = {For underactuated unmanned surface vehicles (USVs) under asymmetric input saturation caused by thrust-limit characteristics, as well as unknown dynamics and ocean environmental disturbances, a trajectory tracking optimal control (TTOC) scheme is proposed using the reinforcement learning (RL) method. Through coordinate transformations and mathematical derivation, an underactuated USV motion model is transformed into the standard affine nonlinear form. To address the asymmetric input saturation of underactuated USVs, a new inverse hyperbolic tangent-type penalty function is designed for control inputs, relaxing the assumption of input saturation limits being symmetric. Based on RL methods and adaptive neural networks (NNs), an actor-critic NN framework is developed, with weight update laws designed for NNs. This framework learns the TTOC law for underactuated USVs through the online interaction of actor and critic NNs while adapting to unknown dynamics and disturbances. In particular, a robustifying term is designed and added to the output of an actor NN to compensate for the adverse effects of a lumped residual term, which enhances the robustness of the TTOC law and thereby achieves asymptotic regulation of trajectory tracking errors. Theoretical analyses and simulation results indicate that the proposed TTOC scheme enables underactuated USVs to asymptotically track the desired trajectory.}, archive = {J_EAAI}, author = {Ziping Wei and Jialu Du}, doi = {10.1016/j.engappai.2025.112307}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112307}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Reinforcement learning-based trajectory tracking optimal control for underactuated unmanned surface vehicles under asymmetric input saturation}, volume = {162}, year = {2025}, }
• (2025). Feature-enhanced edge-INverse attention network for skin lesion segmentation. EAAI, 162, 112306. (www)

  @article{ , abstract = {Skin cancer, particularly melanoma, is one of the most aggressive and deadly forms of cancer with its incidence rising globally. Early detection is crucial for improving survival rates, but the traditional dermatoscopy method is a highly time-consuming and subjective process. To resolve this issue, we propose a novel Feature-Enhanced Edge-INverse attention network (FEEINnet) model that helps to segment the skin lesion region more accurately. FEEINnet consists of three sub-networks: Feature Enhanced Mechanism (FEM) learns and extracts the fine-grained enhanced features from informative channels, the Edge Attention Mechanism (EAM) helps to precisely identify the edges of the lesion region and the INverse Attention Mechanism (INAM) generates inverse attention maps which emphasize the less confident or ambiguous regions thereby increasing the segmentation accuracy iteratively. These three sub-networks collectively help to improve feature extraction, enhance boundary detection, and refine segmentation maps, even in challenging scenarios with varying lesion sizes, shapes and pigmentation. FEEINnet consistently outperforms existing models, achieving a F1-score of 95.55%, 95.53%, and 94.52%; Intersection over Union (IoU) of 92.76%, 92.43%, and 91.34%; and Structural Similarity Index Measure (SSIM) of 94.63%, 93.51%, and 91.85% on the Human Against Machine 10000 (HAM10000), Pedro Hispano Hospital ( P H 2 ), and International Skin Imaging Collaboration 2018 (ISIC2018) datasets, respectively. The obtained results demonstrate that the proposed model has a greater ability to segment complex skin lesions more accurately.}, archive = {J_EAAI}, author = {Shivamm Warambhey and Aravindkumar Sekar}, doi = {10.1016/j.engappai.2025.112306}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112306}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Feature-enhanced edge-INverse attention network for skin lesion segmentation}, volume = {162}, year = {2025}, }
• (2025). A severity indicator for unsupervised fault severity shift detection of heating, ventilation, and air conditioning sub-system faults using a novel adaptive feature weighing method. EAAI, 162, 112305. (www)

  @article{ , abstract = {Fault-free functioning of Heating, Ventilation, and Air Conditioning (HVAC) systems is essential for reducing energy waste in modern-day buildings. Hence, data-driven approaches for HVAC fault detection have gained popularity. Faults become more severe with time. Fault detection reveals the presence of an anomaly, but it does not convey how critical the fault severity is. Fault severity indication provides this essential context, enabling urgent resource allocation to more severe faults, adding practical significance. However, faults being rare, obtaining substantial data at different severity levels to train supervised Machine Learning models is a realistic challenge. Therefore, we propose a method for estimating fault severity in an unsupervised setting. We define a robust Severity Indicator (SI) that reflects the shift in the severity levels of a fault. First, we define a healthy domain boundary for fault-free data using One-Class Support Vector Machines. SI scores are then computed using a novel adaptive feature weighing algorithm that assigns weights to individual features, adaptively, for every fault. We focus on detecting the shift in severity, rather than quantifying it. The study of the robustness of SI for different faults in HVAC subsystems, chillers, and air handling units (AHUs) yields consistently promising results. Our comparative analysis shows that our method outperforms the unweighted approach and existing state-of-the-art techniques for fault severity estimation. Notably, our method excels in detecting low-severity faults, addressing a common limitation in current methods.}, archive = {J_EAAI}, author = {Ramnath V. Prabhu Bam and Rajesh S. Prabhu Gaonkar and Clint Pazhayidam George}, doi = {10.1016/j.engappai.2025.112305}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112305}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A severity indicator for unsupervised fault severity shift detection of heating, ventilation, and air conditioning sub-system faults using a novel adaptive feature weighing method}, volume = {162}, year = {2025}, }
• (2025). An efficient anchor-free model for ore particle size detection. EAAI, 162, 112304. (www)

  @article{ , abstract = {Accurate detection of ore size is crucial in mineral processing, directly impacting equipment efficiency and product quality. However, traditional anchor-based models often struggle with the irregular shapes and varying scales of ore particles, resulting in limited performance. To overcome these challenges, an anchor-free detection framework was proposed. It incorporates a cross-stage partial bottleneck and a spatial pyramid pooling cross-stage partial connections (SPPCSCP-DualConv), both enhanced with dual convolution, to improve feature extraction and multi-scale fusion. In the backbone, the dual convolution module combines group convolution with heterogeneous convolution to improve feature diversity. The SPPCSCP-DualConv module further enhances feature representation in complex backgrounds. Additionally, a simplified path aggregation network (simPANet) feature fusion module is employed in the neck to refine the integration of multi-scale features. The proposed model was trained using a combination of binary cross-entropy, complete intersection over union (IoU), and distribution focal loss to optimize detection accuracy. The proposed model achieved a mean average precision of 86.80 % at an IoU threshold of .5 and 78.50 % across IoU thresholds from .5 to .95, surpassing existing methods while maintaining a lightweight architecture with only 10.10 million parameters and 89.45 giga floating point operations per second. Ablation studies confirmed the effectiveness of the simPANet and SPPCSPC-DualConv modules in enhancing feature representation. Generalization tests across mining sites with similar distributions demonstrated strong performance, although limitations remain for exceptionally large ore blocks due to dataset bias. The proposed model significantly improved the accuracy and efficiency of ore particle size detection, providing reliable real-time insights to improve grinding control and mineral processing operations.}, archive = {J_EAAI}, author = {Kanghui Zhang and Qingkai Wang and Guobin Zou and Jiawei Yang and Tao Song and Yang Liu and Daoxi Liu}, doi = {10.1016/j.engappai.2025.112304}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112304}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An efficient anchor-free model for ore particle size detection}, volume = {162}, year = {2025}, }
• (2025). Propeller fault-detection method for electric-propulsion aircraft using motor signals and generative model-based semi-supervised learning. EAAI, 162, 112301. (www)

  @article{ , abstract = {Failures in propulsion components, such as propellers, can critically affect flight safety; thus, early failure detection, preferably before flight, is essential. Traditional fault-diagnosis methods typically rely on additional sensors or operational data, which may not be available or practical in all situations. This study addresses these challenges by introducing motor-electric-signal-based fault diagnosis that is independent of airframe configuration and can detect faults, even when the aircraft is not in operation. However, difficulties arise owing to poor class variance in motor-electric-signal data and the challenge of obtaining fault data. To overcome these issues, a semi-supervised learning model based on a modified variational autoencoder-generative adversarial network (VAE-GAN) is proposed, which predicts faults using only normal motor-electric-signal data. Additionally, a new preprocessing method and patch-based ensemble inference technique are introduced to improve the poor class-variance characteristics of the data, thereby enhancing the prediction performance. This work demonstrates that propeller faults can be successfully diagnosed using motor-electric signals without the need for additional sensors or fault-data acquisition.}, archive = {J_EAAI}, author = {Sanga Lee and Dohyeong Kim and Minkyun Noh and Shinkyu Jeong and Jikang Kong and Youngjun Yoo}, doi = {10.1016/j.engappai.2025.112301}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112301}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Propeller fault-detection method for electric-propulsion aircraft using motor signals and generative model-based semi-supervised learning}, volume = {162}, year = {2025}, }
• (2025). A lightweight wood defect segmentation network via multi-dimension boundary perception and guidance. EAAI, 162, 112300. (www)

  @article{ , abstract = {Wood surface defect segmentation is extremely critical for defect refinement and quality control of wooden products. However, it is a challenging task to develop an efficient method with current algorithms due to the complicated characteristics of wood defects with obscure boundary, intraclass difference and interclass similarity. To address these issues, a lightweight network via multi-dimension boundary perception and guidance is proposed for precise segmentation of wood defects. At first, based on the Segformer, a boundary prediction branch is added to enrich detailed boundary information in the encoder, and supervised by the Gaussian signal and cosine similarity, to balance the effect of the boundary gradient information. Then, a double-flow enhancing module is designed to integrate the adjacent level features, by embedding two enhancing paths, to adaptively generate discriminative information of the defects. Finally, a binary segmentation head following the predicted map is introduced to strengthen the penalty for the false prediction results of the boundary. Experimental results demonstrate the proposed method outperforms the state-of-the-arts on our wood surface defect dataset, as well as on three public datasets.}, archive = {J_EAAI}, author = {Yuhang Zhu and Ye Lin and Zhezhuang Xu and Dan Chen and Kunxin Zheng and Yazhou Yuan}, doi = {10.1016/j.engappai.2025.112300}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112300}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A lightweight wood defect segmentation network via multi-dimension boundary perception and guidance}, volume = {162}, year = {2025}, }
• (2025). Sparse view tomographic reconstruction of elongated objects using learned primal-dual networks. EAAI, 162, 112295. (www)

  @article{ , abstract = {In the wood industry, logs are commonly quality screened by discrete X-ray scans on a moving conveyor belt from a few source positions. Typically, the measurements are obtained in a single two-dimensional (2D) plane (a “slice”) by a sequential scanning geometry. The data from each slice alone does not carry sufficient information for a three-dimensional tomographic reconstruction in which biological features of interest in the log are well preserved. In the present work, we propose a learned iterative reconstruction method based on the Learned Primal-Dual neural network, suited for sequential scanning geometries. Our method accumulates information between neighbouring slices, instead of only accounting for single slices during reconstruction. Evaluations were performed by training U-Nets on segmentation of knots (branches), which are crucial features in wood processing. Our quantitative and qualitative evaluations show that with as few as five source positions our method yields reconstructions of logs that are sufficiently accurate to identify biological features like knots (branches), heartwood and sapwood.}, archive = {J_EAAI}, author = {Buda Bajić and Johannes A.J. Huber and Benedikt Neyses and Linus Olofsson and Ozan Öktem}, doi = {10.1016/j.engappai.2025.112295}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112295}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Sparse view tomographic reconstruction of elongated objects using learned primal-dual networks}, volume = {162}, year = {2025}, }
• (2025). A deep Q-network-driven multi-objective evolutionary algorithm for distributed heterogeneous hybrid flow shop scheduling with worker fatigue. EAAI, 162, 112292. (www)

  @article{ , abstract = {The hybrid flow shop scheduling problem (HFSP) is a prominent challenge in advanced manufacturing systems. Existing research often overlooks the impact of workers in production shops or treats worker fatigue as a static parameter, failing to capture its nonlinear accumulation and recovery effects on processing efficiency. However, with the advent of Industry 5.0, there has been a growing emphasis on the critical role of human factors in production scheduling. As a result, designing an effective algorithm for HFSP that considers human factors has become a prominent research focus. In this paper, an extended distributed heterogeneous hybrid flow shop scheduling problem with the dynamic effects of worker fatigue (DHHFSP-WF) is investigated. To address this problem, a Deep Q-Network-based multi-objective optimization algorithm (DQNMOEA) is designed to minimize makespan, total energy consumption (TEC), and total worker idle time (WIT). In DQNMOEA, a four-dimensional vector encoding scheme considering worker allocation represents solution, and a reconstruction strategy ensures initial population quality and diversity. Moreover, an improved order crossover, two-point crossover, and a segment-based recombination mutation method are proposed to enhance the global search performance of the algorithm. Then, a problem-specific local search strategy is designed for each layer of the vector, allowing the Deep Q-Network (DQN)-based adaptive decision-making mechanism to perform local perturbations on the current non-dominated solutions in the most suitable dimensions. Finally, seven algorithms are adopted to make a comparison on 36 sets of instances, the experimental results indicate that DQNMOEA exhibits competitive performance in solving DHHFSP-WF.}, archive = {J_EAAI}, author = {Jianlin Zhang and Longbin Ma and Wu Zhao and Jie Cao and Zuohan Chen and Tianpeng Xu}, doi = {10.1016/j.engappai.2025.112292}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112292}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A deep Q-network-driven multi-objective evolutionary algorithm for distributed heterogeneous hybrid flow shop scheduling with worker fatigue}, volume = {162}, year = {2025}, }
• (2025). An angle-enhanced deep learning framework for thermal defect diagnosis in overhead transmission line composite insulators. EAAI, 162, 112285. (www)

  @article{ , abstract = {Due to long-term outdoor exposure, composite insulators are susceptible to degradation and abnormal temperature rise, making Unmanned Aerial Vehicle (UAV)-based infrared inspections essential for effective monitoring. However, traditional manual interpretation of these images is inefficient and subjective. To improve detection automation and accuracy, we propose an intelligent detection method for composite insulators in infrared images based on an improved You Only Look Once version 11 (YOLOv11) model. The proposed approach introduces Oriented Bounding Boxes (OBBs) for annotation and designs an Angle-Enhanced Probabilistic Intersection over Union (AE-ProbIoU) loss function to enhance the model's ability to detect rotated objects. Experimental results demonstrate that the proposed Angle-Enhanced You Only Look Once (AE-YOLO) model achieves a mAP50:95 of 94.0 % and an angle prediction accuracy of 94.3 %. In addition, a temperature extraction module based on the OBBs is developed to accurately derive the temperature profile of the insulator core rod. This method significantly enhances the intelligence level of infrared image analysis for composite insulators and provides technical support for condition assessment and fault prediction in power transmission lines.}, archive = {J_EAAI}, author = {Xinzhe Yu and Zhenan Zhou and Yu Deng and Kun Zhang and Chen Gu and Zheyuan Liu and Songsong Zhou}, doi = {10.1016/j.engappai.2025.112285}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112285}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {An angle-enhanced deep learning framework for thermal defect diagnosis in overhead transmission line composite insulators}, volume = {162}, year = {2025}, }
• (2025). Bayesian bidirectional long short-term memory-based kinematics-dynamics fusion for fault-tolerant vehicle state estimation under yaw rate sensor failures. EAAI, 162, 112283. (www)

  @article{ , abstract = {Accurate estimation of vehicle states is a fundamental component of vehicle stability control systems. To address the issue of inaccurate estimation of vehicle state parameters resulting from yaw rate sensor failures, this study proposes a three-mode collaborative fault-tolerant state estimation method based on Bayesian Bidirectional Long Short-Term Memory (BiLSTM) kinematics-dynamics fusion. First, the kinematics-based method is established using the kinematics model. Second, the dynamics-based method is designed by integrating the Unscented Kalman Filter (UKF) with the dynamics model. Subsequently, a BiLSTM network fusion model based on Bayesian optimization is presented. The model utilizes estimates from kinematic and kinetic methods as a priori inputs and combines the bidirectional information capturing capability of BiLSTM with hyperparameter tuning from Bayesian optimization. The results indicate that when the yaw rate sensor fails, the proposed method achieves an average Root Mean Square Error (RMSE) of 0.0276 km per hour (km/h) for longitudinal speed, 0.0008 radian (rad) for side slip angle, and 0.0072 radian per second (rad/s) for yaw rate across all scenarios. This performance demonstrates a superiority over various maneuvers. This paper combines kinematics, dynamics, and deep learning to provide a reliable solution for fault-tolerant estimation of vehicle states.}, archive = {J_EAAI}, author = {Min Gao and Jiaqi Li and Wei Wang and Renguang Wang and Jin Luo and Jing Li}, doi = {10.1016/j.engappai.2025.112283}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112283}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Bayesian bidirectional long short-term memory-based kinematics-dynamics fusion for fault-tolerant vehicle state estimation under yaw rate sensor failures}, volume = {162}, year = {2025}, }
• (2025). Hierarchical binary diffing with inductive code representation learning with graph sampling-and-aggregate. EAAI, 162, 112279. (www)

  @article{ , abstract = {Binary program diffing, or simply binary diffing, is a type of program analysis technique that quantifies the similarity between two binary programs to derive their differences. In particular, binary diffing is an essential technique for uncovering vulnerabilities and potential attack vectors in industrial control systems, where patch deployment is complicated by closed and restricted environments. Studies on binary diffing can be broadly categorized into dynamic analysis-based, static analysis-based, and neural network-based approaches. Each category of existing studies has its shortcomings, including limited coverage, low accuracy, and issues with on-demand learning. In this paper, we propose the binary diffing with sampling-and-aggregate, a hierarchical binary diffing model that generates inductive code representations based on graph sampling-and-aggregate. Our model sequentially produces instruction-level embedding, block-level embedding, and function-level embedding from the inter-procedural control flow graph of a given program, and then performs hierarchical code diffing based on these embeddings. We formally define the detailed models and present the algorithm of hierarchical binary diffing. Additionally, we conduct a thorough analysis of this algorithm, deriving several advantages. We implemented a prototype and evaluated it on a large-scale dataset in a cross-version, cross-optimization, and obfuscation settings. Our prototype showed F1-scores up to 0.96 and 0.968 in cross-version setting for function and basic block diffing, respectively. Also, our method demonstrated its robustness over several binary obfuscations. In conclusion, our proposal, which generates basic block- and function-level embedding by considering the control flow, has solid advantages on binary diffing and shows the robustness on the binary tampering.}, archive = {J_EAAI}, author = {Seungho Jeon and Kijong Koo and Daesung Moon and Jung Taek Seo}, doi = {10.1016/j.engappai.2025.112279}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112279}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Hierarchical binary diffing with inductive code representation learning with graph sampling-and-aggregate}, volume = {162}, year = {2025}, }
• (2025). Nonlinear excavation load prediction of hydraulic excavator based on gated recurrent unit neural network. EAAI, 162, 112278. (www)

  @article{ , abstract = {Excavator arms are integral to the mining and construction industries, where real-time excavation load prediction is a critical element for the advancement of automated excavation technology. This study presents a novel Physics-guided Neural Network (PGNN) designed to predict the excavating force of hydraulic cylinders used in earthwork excavation. The PGNN model synergizes the physical load model of excavators with a Gated Recurrent Unit (GRU) neural network and is optimized using the Hyperband algorithm to attain both high-speed and precise forecasting. Through comparative experiments, the study validates the PGNN model's ability to achieve optimal response speed and precision in predicting excavation loads. Additionally, the predictive performance of the PGNN model is assessed via a Hardware-in-the-loop (HIL) test, conducted within the context of an actual excavation experiment. This research introduces a promising approach that seamlessly integrates physics-based modeling with machine learning techniques, facilitating real-time load forecasting for excavators. The findings pave the way for more efficient and precise excavation processes, with implications for the broader fields of mining and construction automation.}, archive = {J_EAAI}, author = {Jinshi Chen and Yue Yu and Dongyang Huo and Han Zhang and Jingyan Wang}, doi = {10.1016/j.engappai.2025.112278}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112278}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Nonlinear excavation load prediction of hydraulic excavator based on gated recurrent unit neural network}, volume = {162}, year = {2025}, }
• (2025). Plug-and-play fine grained neural cognitive diagnosis framework. EAAI, 162, 112276. (www)

  @article{ , abstract = {Cognitive diagnosis (CD) is a core task in intelligent education, which accurately assesses students’ mastery of specific knowledge concepts (KCs) by analyzing their answer records. However, existing methods mainly rely on explicit interaction data and use diagnostic models for automatic knowledge proficiency inference. These methods lack systematic optimization for fine-grained knowledge level representation, making it difficult to fully reflect students’ true learning status. To address this, this paper introduces a Plug-and-Play F ine Grained N eural C ognitive D iagnosis Framework (FNCD) with Knowledge-Level Constraint Awareness . The framework combines a knowledge proficiency evaluation module with students’ answer records and a Q-matrix to statically assess knowledge mastery. It uses a student similarity construction method based on random grouping to reveal latent learning pattern associations. Additionally, it employs a multi-scale relational learning strategy and a Top-k attention-enhanced graph network mechanism to dynamically adjust the student similarity relationship network, accurately modeling the complex learning relationships between students. Ultimately, a joint training mechanism is used to optimize the outputs of each module, significantly improving the rationality, interpretability, and accuracy of CD. The experimental results demonstrate that FNCD, as an artificial intelligence-driven plug-and-play module, can be effectively integrated into existing CD models to enhance the modeling of fine-grained knowledge mastery and improve diagnostic accuracy, showcasing the application potential of artificial intelligence in personalized education.}, archive = {J_EAAI}, author = {Xinjie Sun and Qi Liu and Kai Zhang and Weiyin Gong and Shuanghong Shen and Fei Wang and Yan Zhuang and Meikai Bao and Shijin Wang and Yuling Ma and Enhong Chen}, doi = {10.1016/j.engappai.2025.112276}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112276}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Plug-and-play fine grained neural cognitive diagnosis framework}, volume = {162}, year = {2025}, }
• (2025). Open-vocabulary object detection via neighboring region attention alignment. EAAI, 162, 112270. (www)

  @article{ , abstract = {The nature of diversity in real-world environments necessitates neural network models to expand from closed category settings to accommodate novel emerging categories. In this paper, we study open-vocabulary object detection (OVD), which facilitates the detection of novel object classes under the supervision of only base annotations and open-vocabulary knowledge. However, we find that the inadequacy of distilled information from the detector head during the alignment process inevitably constrains the performance of recent distillation-based OVD strategies. To this end, we propose Neighboring Region Attention Alignment (NRAA), which performs alignment within the attention mechanism to boost the open-vocabulary inference. Specifically, for a given proposal region, we randomly explore the neighboring boxes to capture the surrounding contextual vocabulary knowledge. Then, a set of regional token features, encompassing both the proposal and neighboring regions, utilize our proposed Neighboring Region Attention (NRA) to extract interaction information. Finally, this information is seamlessly provided to the distillation procedure to assist the alignment between the detector and the pre-trained vision-language models (VLMs). Extensive experiments validate that our proposed model exhibits superior performance on open-vocabulary benchmarks.}, archive = {J_EAAI}, author = {Sunyuan Qiang and Xianfei Li and Yanyan Liang and Wenlong Liao and Tao He and Pai Peng}, doi = {10.1016/j.engappai.2025.112270}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112270}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Open-vocabulary object detection via neighboring region attention alignment}, volume = {162}, year = {2025}, }
• (2025). A time and frequency convolutional autoencoder for anomaly detection in industrial robots based on inertial measurement unit error calibration. EAAI, 162, 112269. (www)

  @article{ , abstract = {In the realm of industrial robots, ensuring operational reliability and Long-Term Autonomy hinges on the accurate detection of anomalies. However, this sample difference due to noise, joint random errors and sensor errors increases the challenge of robot anomaly detection. To address this problem, an unsupervised deep learning method based on inertial measurement unit (IMU) error calibration is proposed. Firstly, the attitude signals acquired by the IMU from the end of the robot were calibrated using Kalman filtering. The three dimensional (3D) free acceleration was corrected based on the calibrated attitude signal and the calibrated 3D free acceleration signal was used as a signal sample. Secondly, a time and frequency convolutional autoencoder model (TFCAE) is proposed. And the distribution of the different component signals is fitted by stacking multiple encoder modules and 3D-TFCAE is used for 3D free acceleration signal reconstruction model. Then, the error sphere radius is calculated based on the reconstruction error of the 3D free acceleration signal. And the error sphere radius is used as the anomaly detection threshold to realize the robust detection of different types of anomalies. The model was evaluated on a constructed anomaly dataset. This study contributes an innovative 3D-TFCAE architecture, integrating Kalman filtering with time-frequency feature fusion, markedly enhancing anomaly detection in complex signal environments. Experimental findings reveal that 3D-TFCAE significantly outperforms 18 baseline models, improving detection accuracy by about 20 %–40 %, offering an effective solution for high-precision anomaly detection in industrial robots. The code for this project is available at https://github.com/LJlong977/3DTFCAE .}, archive = {J_EAAI}, author = {Jianlong Li and Xiaoqin Liu and Xing Wu and Dongxiao Wang and Kai Xu and Yashan Li}, doi = {10.1016/j.engappai.2025.112269}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112269}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A time and frequency convolutional autoencoder for anomaly detection in industrial robots based on inertial measurement unit error calibration}, volume = {162}, year = {2025}, }
• (2025). A lightweight citrus detection and counting method based on deep learning model. EAAI, 162, 112268. (www)

  @article{ , abstract = {Picking robots have become an important development direction of smart agriculture, and the accurate detection, counting and lightweight deployment of fruits are the technical basis for realizing robot picking. However, due to complex weather conditions and the possible mutual occlusion between branches and citrus, it is challenging to accurately detect and count citrus in orchards. This study proposes a lightweight small target detection model for detecting and counting citrus, and deploys it on the citrus detection platform. The model first introduces FasterNet Block into the cross-stage partial feature fusion module of the backbone network to reduce the number of parameters and calculations while improving the detection accuracy of the network. Secondly, a multi-scale attention mechanism is added to the backbone network to enhance the feature extraction ability of the network. Finally, a bounding box loss function based on a dynamic non-monotonic focusing mechanism is used to increase the model convergence speed and further improve the model accuracy. Experimental results show that the model has an accuracy of 92.7%, an average precision of 91.7%, and a model size of only 5.37 megabytes. The lightweight model is applied to the citrus detection platform. Based on this application, a citrus counting method is proposed, which obtains a mean absolute error (MAE) of 0.92, a root mean square error (RMSE) of 1.28, a determination coefficient ( R 2 ) of 0.98, and a frame rate of 80.6 per second, which meets the requirements of real-time citrus detection and counting. This provides technical support for the subsequent deployment and counting research of picking robots.}, archive = {J_EAAI}, author = {Jiqing Chen and Mingchang Zhang and Bin Lu and Quan Chen and Zhiwu Jiang and Peilin Li and Jingyao Gai}, doi = {10.1016/j.engappai.2025.112268}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112268}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A lightweight citrus detection and counting method based on deep learning model}, volume = {162}, year = {2025}, }
• (2025). Medical image fusion for high-level analysis: A mutual enhancement framework for unaligned photoacoustic tomography and magnetic resonance imaging. EAAI, 162, 112259. (www)

  @article{ , abstract = {Photoacoustic tomography (PAT) offers optical contrast, whereas magnetic resonance imaging (MRI) excels in imaging soft tissue and organ anatomy. The fusion of PAT with MRI holds promising application prospects due to their complementary advantages. Existing image fusion has made considerable progress in pre-registered images, yet spatial deformations are difficult to avoid in medical imaging scenarios. More importantly, current algorithms focus on visual quality and statistical metrics, thus overlooking the requirements of high-level tasks. To address these challenges, we propose an unsupervised fusion model, termed PAMRFuse+, which integrates image generation and registration. Specifically, a cross-modal style transfer network is introduced to simplify cross-modal registration to single-modal registration. Subsequently, a multi-level registration network is employed to predict displacement vector fields. Furthermore, a dual-branch feature decomposition fusion network is proposed to address the challenges of cross-modal feature modeling and decomposition by integrating modality-specific and modality-shared features. PAMRFuse+ achieves satisfactory results in registering and fusing unaligned PAT–MRI datasets. Moreover, for the first time, we evaluate the performance of medical image fusion with multi-organ instance segmentation. Extensive experimental demonstrations reveal the advantages of PAMRFuse+ in improving the performance of medical image analysis tasks.}, archive = {J_EAAI}, author = {Yutian Zhong and Jinchuan He and Zhichao Liang and Shuangyang Zhang and Qianjin Feng and Lijun Lu and Li Qi}, doi = {10.1016/j.engappai.2025.112259}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112259}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Medical image fusion for high-level analysis: A mutual enhancement framework for unaligned photoacoustic tomography and magnetic resonance imaging}, volume = {162}, year = {2025}, }
• (2025). Max–Min pooling and squeeze excitation lightweight bidirectional mamba for image classification. EAAI, 162, 112246. (www)

  @article{ , abstract = {To address challenges stemming from the quadratic computational complexity, slow execution speed, and high memory consumption of Transformer models, we propose a novel image classification method: Max–Min Pooling and Squeeze Excitation Lightweight Bidirectional Mamba(MMPSELMamba). The core artificial intelligence innovations include: (1) We design a max–min pooling mechanism that synergistically preserves high-activation foreground features through max-pooling and low-intensity contextual details via min-pooling. This approach addresses the information loss problem in conventional single-mode pooling methods; (2) Inspired by squeeze-enhanced Axial Transformer(SeaFormer), we design an axial squeeze excitation module that compresses redundant features along both vertical and horizontal dimensions while enhancing discriminative feature refinement; (3) Building upon recent advances in sequence modeling, we replace self-attention with a bidirectional Mamba architecture based on state space models (SSM), achieving linear complexity in the model of long-range dependencies; (4) Our novel multi-scale integration unit combines upsampling, concatenation, and downsampling operations to optimize feature fusion while minimizing computational overhead. For engineering applications, MMPSELMamba is specifically designed for resource-constrained environments such as edge devices and mobile vision systems. By integrating depthwise separable convolutions and lightweight SSM operations, it achieves a 36% parameter reduction and a 16% lower computational load compared to SeaFormer, while maintaining competitive accuracy. Experiments on public datasets validate its deployment potential in real-world scenarios like autonomous drones and embedded surveillance. Confusion matrices and heatmap visualizations further confirm the superior performance of the MMPSELMamba method. Our code can be gained from: https://github.com/yalemitter/MMPSELMamba-main .}, archive = {J_EAAI}, author = {Senlin Chi and Zhiwen Wang and Lianyuan Jang and Mengsi Gong}, doi = {10.1016/j.engappai.2025.112246}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112246}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Max–Min pooling and squeeze excitation lightweight bidirectional mamba for image classification}, volume = {162}, year = {2025}, }
• (2025). Stacked machine learning-based probabilistic seismic demand and risk assessment of railway embankments with variable slopes. EAAI, 162, 112245. (www)

  @article{ , abstract = {Accurate seismic risk assessment of railway embankments is critical for risk mitigation, seismic design, and emergency planning. However, conventional methods often suffer from computational inefficiency and complexity. This study proposes a novel machine learning (ML) framework to rapidly and accurately evaluate probabilistic seismic demand and risk for railway embankments. Latin hypercube sampling is utilised to generate representative soil parameter samples to construct numerical models for simulating dynamic responses under near-fault pulse-like ground motions. The peak permanent settlement (PPS) of the embankment surface is used as the key performance metric. Multiple ML models, including decision trees, random forests (RFs), extreme gradient boosting (XGBoost), artificial neural networks (ANNs), and a stacked ML model that integrates RFs, XGBoost, and ANNs, are trained and compared. The stacked ML model outperforms the other models and achieves the highest predictive accuracy for the PPS. SHapley Additive exPlanations are used to identify the velocity spectrum intensity (VSI) and the internal friction angle of the embankment as the most influential factors. Seismic fragility and risk curves are subsequently developed. The VSI and a power-law seismic hazard function are combined to estimate the annual exceedance probabilities for three seismic design criteria levels. The proposed ML framework significantly enhances the efficiency of seismic risk analysis while maintaining high precision, thereby providing a transformative approach for the seismic assessment of railway embankments.}, archive = {J_EAAI}, author = {Pan Si and Liang Tang and Shuang Tian and Xianzhang Ling and Yanfang Liu}, doi = {10.1016/j.engappai.2025.112245}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112245}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Stacked machine learning-based probabilistic seismic demand and risk assessment of railway embankments with variable slopes}, volume = {162}, year = {2025}, }
• (2025). Quantization-based deep diversified ensemble for medical image segmentation. EAAI, 162, 112242. (www)

  @article{ , abstract = {Recent advancements in fully convolutional networks (FCNs) have significantly improved medical image segmentation. Ensemble methods are often used to further enhance performance, with diversity among learners being a critical factor. However, many current approaches focus on diversifying training samples or predictions while overlooking the diversity of internal multi-scale features. This oversight can lead to high correlations among features across different learners, limiting overall effectiveness. Additionally, traditional quantization methods aim to minimize accuracy loss by maintaining a rigid quantization process. This rigidity can eliminate the randomness introduced by quantization, further reducing ensemble diversity and effectiveness. In this paper, we propose a novel approach called Quantization-based Deep Diversified Ensemble (QDD-Ens) for medical image segmentation. Our method enhances the diversity of internal features among ensemble learners through two mechanisms: deep diversified loss, which focuses on feature diversity rather than segmentation accuracy, and deep diversified quantization, which preserves beneficial randomness in quantization process. Furthermore, QDD-Ens facilitates a deeper form of ensemble learning by employing a meta-learner to integrate diversified features at multiple resolution levels from various base learners, which are diversified by two above diversify enhancement mechanisms. Extensive experiments on five public medical image segmentation datasets show that our method significantly improves segmentation accuracy and outperforms existing ensemble techniques. The source code is publicly available to support future research. ( https://github.com/JerRuy/QDD-Ens )}, archive = {J_EAAI}, author = {Jiawei Zhang and Jialin Wang and Qi Wang and Yanchun Zhang and Weihong Han and Yangyang Mei and Yiyu Shi and Jian Zhuang and Meiping Huang and Xiaowei Xu}, doi = {10.1016/j.engappai.2025.112242}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112242}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Quantization-based deep diversified ensemble for medical image segmentation}, volume = {162}, year = {2025}, }
• (2025). Machine learning methods comparison by using statistical tests in solar energy forecasting based on weather features. EAAI, 162, 112239. (www)

  @article{ , abstract = {Climate change necessitates precise solar forecasting due to its weather-dependent intermittency. Key parameters - temperature, visibility, altitude, pressure, and wind speed - were analyzed using non-parametric tests. We prioritized short-term weather patterns over random data splitting for enhanced accuracy.Non-parametric tests, such as the Kolmogorov-Smirnov test, were used to assess data normality and select highly correlated features. Principal Component Analysis (PCA) reduces dataset dimensionality while preserving critical trends. Various machine learning approaches were evaluated, including: weighted linear regression (both with and without dimensionality reduction), boosted regression trees, and deep learning architectures-comprising both fundamental models (Convolutional Neural Networks [CNNs] and Recurrent Neural Networks [RNNs]) and advanced hybrid architectures (Temporal Convolutional Networks (TCN) Convolutional Neural Network-Long Short-Term Memory network (CNN-LSTM). All models were optimized through systematic hyperparameter tuning to enhance predictive performance, reduce computational complexity, and improve learning convergence rates. Special attention was given to addressing vanishing gradient problems in deep neural network implementations. Results show TCN outperform other deep learning models, achieving lower training and testing errors with fewer parameters and reduced time complexity. CNN-LSTM models, designed for spatial-sequence prediction, perform well but require more parameters and computational time. The lowest test and training errors belong to CNN-LSTM and TCN, with approximately 9 % and 2 % lower than the maximum amount, respectively. A trade-off between model complexity, error rates, and computational efficiency must be considered when selecting the optimal approach. Since relevant weather features vary by location, the proposed methodology serves as an adaptable algorithm for solar energy prediction in diverse geographical regions.}, archive = {J_EAAI}, author = {Mohammadreza pourmir and Seyedeh Mohadeseh Miri}, doi = {10.1016/j.engappai.2025.112239}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112239}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Machine learning methods comparison by using statistical tests in solar energy forecasting based on weather features}, volume = {162}, year = {2025}, }
• (2025). Adaptive chemical industrial processes fault detection model based on sparse filtering-based improved mixed-gaussian probabilistic principal component analysis considering low-probability events. EAAI, 162, 112236. (www)

  @article{ , abstract = {Probabilistic Principal Component Analysis (PPCA) is widely used in process monitoring. However, its underlying assumption that data follows a Gaussian distribution limits its effectiveness in handling Low Probability Events (LPEs), which often deviate from this assumption. To address this challenge, we propose a novel method called Sparse Filtering-based Improved Mixed-Gaussian Probabilistic Principal Component Analysis (SFIMPPCA) for enhanced LPEs detection. First, a Sparse Filtering (SF) preprocessing technique with an incremental structure is employed to extract the most discriminative features. Second, to address the distortion caused by LPEs, a dynamic ratio correction mechanism based on statistical variability is introduced, followed by a newly designed Mixed-Gaussian Probabilistic Principal Component Analysis (MPPCA). Third, a Bayesian Optimization Algorithm (BOA) is applied to automatically adjust control limits, enhancing the accuracy and reliability of fault detection. The effectiveness of the proposed method is validated using the Tennessee Eastman (TE) process and the Tin Chemical Process (TCP). Experimental results demonstrate that the proposed method significantly improves performance under LPEs conditions, achieving a 10%–12% improvement in most cases.}, archive = {J_EAAI}, author = {Chuangyan Yang and Jiande Wu and Peng Li and Xun Lang and Mingxi Ai and Hancheng Wang}, doi = {10.1016/j.engappai.2025.112236}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112236}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Adaptive chemical industrial processes fault detection model based on sparse filtering-based improved mixed-gaussian probabilistic principal component analysis considering low-probability events}, volume = {162}, year = {2025}, }
• (2025). Dynamic graph neural network with historic-sequential information representation. EAAI, 162, 112234. (www)

  @article{ , abstract = {In today’s interconnected world, networks, whether social, technological, or biological, are constantly evolving, with relationships forming, shifting, and dissolving over time. Traditional models struggle to capture this fluidity, treating networks as static snapshots rather than living systems. While existing research has made strides in analyzing either spatial–temporal patterns or temporal sequences separately, these approaches often fall short in scalability and fail to unify discrete and continuous-time perspectives. To bridge this gap, we introduce DyGHS (Dynamic Graph Historical-Sequential), an innovative framework that harnesses dynamic graph neural networks to model how nodes, edges, and their historical interactions evolve together. By seamlessly integrating discrete-time and continuous-time graph representations, DyGHS not only captures the richness of real-world networks but also efficiently predicts future connections and node behaviors. Our experiments reveal that combining continuous-time Fourier transform (CTFT) with graph neural networks significantly boosts prediction accuracy, outperforming current methods in tasks like link prediction and node classification. This advancement opens new doors for understanding and anticipating the ever-changing tapestry of networked systems.}, archive = {J_EAAI}, author = {Adam Abakar Hamid and Anping Zhao and Alladoumbaye Ngueilbaye}, doi = {10.1016/j.engappai.2025.112234}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112234}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dynamic graph neural network with historic-sequential information representation}, volume = {162}, year = {2025}, }
• (2025). MAE-diff: Masked-AutoEncoder-guided diffusion framework for source-free domain adaptive medical image segmentation. EAAI, 162, 112219. (www)

  @article{ , abstract = {Domain gaps can often cause dramatic performance deterioration when applying medical image segmentation models trained on the source domain to the target domain. Although unsupervised domain adaptation methods can address the domain gap challenge to some extent, their reliance on accessing source images largely hampers their practical applicability, as source data are often inaccessible due to privacy concerns. Moreover, the low-quality characteristic of medical images can further degrade the domain adaptation performance of segmentation models. To address these issues, we propose the Masked-AutoEncoder-guided Diffusion (MAE-Diff) framework for source-free domain adaptive medical image segmentation. MAE-Diff mainly consists of a Masked AutoEncoder (MAE) Module for effective feature extraction and domain adaptation, and a Diffusion Module for effective segmentation of low-quality medical images. On source images, the MAE encoder is trained to extract image-specific features, and the Diffusion Module is trained to generate segmentation maps following a gradual denoising strategy, under the guidance of features extracted by the MAE encoder. Training on the target domain involves only fine-tuning MAE (trained on the source images) with target images, allowing MAE-Diff to adapt to the target domain distribution. Inference on target images can then be made by the source-based Diffusion Module, under the guidance of features extracted by the MAE encoder fine-tuned on the target images. Extensive experiments on three datasets demonstrate the effectiveness of the proposed framework for source-free domain-adaptive medical image segmentation. The code of MAE-Diff is available at https://github.com/xuss804/MAEDiff .}, archive = {J_EAAI}, author = {Shanshan Xu and Le Xu and Yeqing Yang and Lixia Tian}, doi = {10.1016/j.engappai.2025.112219}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112219}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {MAE-diff: Masked-AutoEncoder-guided diffusion framework for source-free domain adaptive medical image segmentation}, volume = {162}, year = {2025}, }
• (2025). A hierarchical reinforcement learning framework with imitation learning and bayesian Actor–Critic for distributed unmanned underwater vehicle encirclement in dynamic maritime environments. EAAI, 162, 112214. (www)

  @article{ , abstract = {The rapid development of Unmanned Underwater Vehicles (UUVs) has introduced potential threats to critical infrastructure, with existing methods facing challenges in multi-agent collaboration and dynamic environment adaptation. To address these challenges, we propose HRL-IL-BAC—a Hierarchical Reinforcement Learning framework equipped with an Imitation-Learning (IL) high-level policy and a Bayesian Actor–Critic (BAC) low-level controller. The framework decomposes the encirclement mission into four sequential phases: submergence, interception, encirclement, and standoff tracking. At the high level, multi-agent collaboration and long-horizon autonomous decision-making are orchestrated by the IL-guided policy, whereby strategy convergence is accelerated and phase selection is rendered more precise. At the low level, environmental and model uncertainties are explicitly modeled by the BAC controller, so that adaptability and control accuracy are markedly boosted under dynamic ocean conditions. Validation through simulations and physical experiments demonstrates that the HRL-IL-BAC framework achieves 23.6% faster encirclement efficiency and 52.0% enhanced system stability compared to conventional methods, while maintaining superior adaptability to dynamic maritime conditions. This work provides an innovative and effective solution for underwater defense and marine security, offering new insights into multi-agent systems for complex maritime operations.}, archive = {J_EAAI}, author = {Hanbin Zhang and Wenchuan Zang and Peng Yao and Jiangli Cao and Dalei Song}, doi = {10.1016/j.engappai.2025.112214}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112214}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A hierarchical reinforcement learning framework with imitation learning and bayesian Actor–Critic for distributed unmanned underwater vehicle encirclement in dynamic maritime environments}, volume = {162}, year = {2025}, }
• (2025). Dynamic-static siamese Takagi–Sugeno-kang fuzzy system with inductive-reflection deep fuzzy rule. EAAI, 162, 112199. (www)

  @article{ , abstract = {The first-order Takagi–Sugeno–Kang (TSK) fuzzy classifiers are famous for their high computational efficiency and strong interpretability, but they often struggle to learn from complex and large-scale datasets, and perform not very well compared to higher-order TSK fuzzy classifiers. To address this issue, in this paper we propose a novel Dynamic-Static Siamese TSK Fuzzy classifier with Inductive-Reflection Deep Fuzzy rule. It aims to enhance the model’s self-learning capabilities by utilizing Siamese network to integrate deep fuzzy knowledge and fine-grained knowledge without the need for a teacher model. The innovations of this study are as follows: (1) The deep fuzzy rules in the proposed classifier are enriched with an “Inductive-Reflection” process, which reduces constraints on traditional basic fuzzy rule and aligns rule acquisition more closely with general human thinking manners; (2) The proposed method includes a mechanism for self-learning and improvement from both deep and fine-grained fuzzy knowledge, eliminating the complexity of retraining a new teacher model; (3) An adaptive learning function is developed to effectively adjust the learning process, adapting to tasks with different complexities. Extensive experiments results on benchmark datasets, as well as two real-world datasets, demonstrate the effectiveness of the proposed classifier in terms of classification accuracy and weighted F1-score.}, archive = {J_EAAI}, author = {Xiongtao Zhang and Qihuan Shi and Yunliang Jiang and Qing Shen and Jungang Lou and Ruiqin Wang}, doi = {10.1016/j.engappai.2025.112199}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112199}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Dynamic-static siamese Takagi–Sugeno-kang fuzzy system with inductive-reflection deep fuzzy rule}, volume = {162}, year = {2025}, }
• (2025). Enhancing anomaly detection with few-shot fine-tuned long text-to-image models. EAAI, 162, 112174. (www)

  @article{ , abstract = {Industrial anomaly detection plays a crucial role in the industrial manufacturing field. Currently, utilizing generated data to improve the performance of the anomaly detection model is an effective approach. However, most existing methods often rely on mask-guided synthesis, where the distribution of the generated defects is limited by masks that are typically random or learned by a model. In addition, the scarcity of real anomalous samples makes it difficult for generative models to capture genuine defect patterns and align with the real anomaly distribution. To tackle these issues, we propose DefectGen, the first long-text-guided few-shot text-to-image data generation pipeline for industrial anomaly detection. To improve distribution alignment under limited anomaly samples, DefectGen incorporates a Prompt Generation and Variation Module, which uses MLLMs (Multimodal Large Language Models) to expand few-shot image–text pairs into diverse and semantically rich prompts, and DoKr (Weight- D ecomposed L o w-Rank Adaptation with Kr onecker product), a lightweight fine-tuning strategy with structured low-rank adaptation. To ensure the quality of synthetic data, DefectGen further introduces the Real-Guided Clustering Filter, which selects high-quality generated samples by comparing their features with those of real anomalies. Experiments on the MVTec AD(MVTec AnomalyDetection) dataset show that DefectGen generates more diverse and realistic synthetic anomalies and achieves a 5.58% average improvement in anomaly classification accuracy compared to state-of-the-art methods. Code and data are available at: https://anonymous.4open.science/r/DefectGen-CD04/ .}, archive = {J_EAAI}, author = {Jiachen Liu and Jiajia An and Junbin Lu and Zhuoqin Yang and Jinbao Wang and Ping Lu and Yuying Wang and Linlin Shen}, doi = {10.1016/j.engappai.2025.112174}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112174}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Enhancing anomaly detection with few-shot fine-tuned long text-to-image models}, volume = {162}, year = {2025}, }
• (2025). A database of dentition images of indian breed cattle and estimation of cattle’s age using deep learning algorithms. EAAI, 162, 112172. (www)

  @article{ , abstract = {Accurate age estimation in livestock is crucial in agricultural management, influencing breeding, healthcare, and production planning. The primary method entails visually inspecting the teeth, a procedure susceptible to human fallibility. Recent deep learning (DL) algorithms are highly efficient in automating age prediction based on dentition images, offering faster and more accurate results. To our knowledge, no dataset exists for Indian livestock, hindering DL algorithm development for teeth segmentation and age estimation. Therefore, we created a database of dentition images for Indian livestock, covering an age range of 1 to 15 years, using 2,883 subjects. In this research, we employed a hybrid model based on You Only Look Once version 8 (YOLOv8) for instance segmentation of raw dentition images. Segmentation achieved 73.59% mean Average Precision (mAP) 50 and 56.44% mAP50–90, indicating strong performance in varying localization thresholds. These segmented images were then used in various DL algorithms, including convolutional neural network (CNN)-based transformers and vision transformers (ViTs), to develop DL models for age estimation. We conducted three age estimation experiments with increasing granularity: four age groups (4-year intervals), seven age groups (2-year intervals), and fifteen age groups (1-year intervals). InceptionV3 achieved the highest accuracy in the first two experiments with 73.72% and 62.41%, respectively. In the third experiment, MobileNet performed best with an accuracy of 43.87%. Our results demonstrate the effectiveness of these intricate DL models in enhancing livestock age estimation, making the process more streamlined and reliable. The study may assist farmers in making informed and efficient agricultural management decisions.}, archive = {J_EAAI}, author = {Chinmay Vijay Patil and Ankit Ashokrao Bhurane and Preeti Ghasad and Vipin Kamble and Manish Sharma and Anand Singh and Nareshkumar Nandeshwar and Ru-San Tan and Rajendra Acharya}, doi = {10.1016/j.engappai.2025.112172}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112172}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A database of dentition images of indian breed cattle and estimation of cattle’s age using deep learning algorithms}, volume = {162}, year = {2025}, }
• (2025). Physics-informed fine-tuning for physics discovery from random and sparse data. EAAI, 162, 112132. (www)

  @article{ , abstract = {Although significant advances have been made in both numerical methods and machine learning approaches for solving differential equations across various scientific sectors, these methods often rely on complete information about the differential equations, including precise parameter values, which are not easily obtainable in real-world scenarios. To address this challenge, data-driven methods for discovering differential equations have gained growing popularity in recent years. However, many existing approaches demand unrealistic prerequisites, such as extensive high-fidelity data or carefully designed low-fidelity data and functions. In this paper, we propose a novel method: P hysics- I nformed F ine- T uning ( PIFT ) to discover the unknown parameters in differential equations when only randomly distributed sparse data points are available. PIFT consists of three stages; (i) generating low fidelity data from prior knowledge under realistic settings, (ii) pre-training a single neural network with the generated low fidelity data, and (iii) fine-tuning the pre-trained model using physics-informed loss function. PIFT is evaluated on seven scientific problems including five ordinary differential equations and two partial differential equations. We also demonstrate the robustness and generalizability of PIFT to out-of-distribution tasks. PIFT exhibits high accuracy and robustness in discovering unknown parameters of differential equations from randomly distributed sparse data points.}, archive = {J_EAAI}, author = {Yong Jin Jeong and Taesup Moon}, doi = {10.1016/j.engappai.2025.112132}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112132}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Physics-informed fine-tuning for physics discovery from random and sparse data}, volume = {162}, year = {2025}, }
• (2025). Deep Q-learning with feature extraction and prioritized experience replay for edge node overload in edge computing. EAAI, 162, 112124. (www)

  @article{ , abstract = {Keeping track of the edge nodes’ status information is crucial, which is the condition of their available compute capacity as measured by their Age-of-Information. In Internet of Things-oriented edge computing systems, the computational and software-defined infrastructure resources are heterogeneous and subject to rapid change. Edge computing systems often face dynamic workloads and limited computational resources, leading to frequent node overload scenarios. These overloads degrade system responsiveness and service availability, especially in latency-sensitive applications. The scheduling of computation tasks would consider both current resource availability and predicted overload risks. An intelligent, adaptive method that learns optimal task allocation under resource constraints has the potential to boost the operational efficiency of Internet of Things-oriented edge computing systems. Addressing edge node overload is critical for the sustainable and scalable deployment of edge-based infrastructures. This research designs a resource-overloaded detection model specifically for diverse workloads in edge computing systems. The proposed Deep Reinforcement Learning model explores two significant challenges: the selection of pertinent feature sets from the workload resource utilization storage, and their classification of overload and detection of fatal failure of edge computing nodes. We propose a Deep-Q Network with a prioritized experience replay framework for edge node resource overload. The framework relies on feature learning using Linear Discriminant Analysis and Deep Q Network with a prioritized experience replay to efficiently indicate the overload status of edge nodes and reward the system with actions that enhance edge resources allocation. Deep-Q Network is well-suited for sequential decision-making in dynamic environments, while prioritized experience replay improves sample efficiency by focusing on updating on high-priority transitions with larger temporal-difference errors. Features are learned automatically from the edge node resource profiling data generated on a real edge-based container infrastructure. Linear Discriminant Analysis reduces the high-dimensional state space by emphasizing the most discriminative features for scheduling decisions. The infrastructure executes an intelligent inference of containerized applications considered as resource-intensive applications. When the feature extraction is added to the proposed deep reinforcement learning model, the overload classifier’s performance is improved. Comparing the model with selection to the one without it, the total accuracy and F1-score were improved by 1.3% and 1.4%, respectively.}, archive = {J_EAAI}, author = {Lionel Nkenyereye and Boon Giin Lee and Wan-Young Chung}, doi = {10.1016/j.engappai.2025.112124}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112124}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Deep Q-learning with feature extraction and prioritized experience replay for edge node overload in edge computing}, volume = {162}, year = {2025}, }
• (2025). STEval: A framework for evaluating spatio-temporal crime prediction models. EAAI, 162, 112123. (www)

  @article{ , abstract = {Spatio-Temporal predictive models are crucial for forecasting where and when crimes will occur, aiding public security organizations in resource allocation and crime prevention. Despite numerous literature proposals, a lack of standardized evaluation criteria hinders comparability and reliability. To address this, we propose STEval, a comprehensive and flexible evaluation framework for spatio-temporal predictive models. STEval consists of four modules: data preparation, spatial structure definition, model training, and model evaluation. The framework’s robustness was demonstrated using a 40-million-record crime dataset from Minas Gerais State (Brazil) across five experimental scenarios, including variations in temporal granularity, spatial resolution, and distribution shifts. Results demonstrate that no single model is universally superior, and the most appropriate model depends on the specific application context. For instance, Spatio-Temporal Kernel Density Estimation (STKDE) consistently achieved high Hit Rates (HR), often exceeding 0.98 in fine spatial resolutions (e.g., 100-square meters grid) for violent crimes, while Spatial-Temporal Autoregressive Integrated Moving Average (STARIMA) demonstrated strong performance in temporal granularity tests, reaching HRs of up to 0.65 for theft predictions. Conversely, Extra Tree Regressor, though exhibiting significantly lower HRs (e.g., as low as 0.02 in some spatial tests), consistently provided the fastest execution times, often under 5 s, contrasting with STKDE’s execution times that could extend to thousands of seconds in dense spatial grids. The framework’s detailed analysis provides important insights for informed model selection and optimization, revealing each model’s strengths and limitations, and providing a robust foundation for future advancements in spatio-temporal crime prediction research, leveraging Machine Learning (ML) techniques.}, archive = {J_EAAI}, author = {Gabriel Amarante and Matheus Pimenta and Yan Andrade and Matheus Senna and Rainer Menezes and Antônio Hot Faria and Marcelo Vilas-Boas and Frederico Martins de Paula Neto and João Paulo da Silva and Everton Renato de Sousa and Jamicel da Silva and Wagner Meira Jr. and George Teodoro and Leonardo Rocha and Renato Ferreira}, doi = {10.1016/j.engappai.2025.112123}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112123}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {STEval: A framework for evaluating spatio-temporal crime prediction models}, volume = {162}, year = {2025}, }
• (2025). A new design of arithmetic and logic unit for enhancing the security of future internet of things devices using quantum-dot technology. EAAI, 162, 112113. (www)

  @article{ , abstract = {The Internet of Things (IoT) is a network of interconnected devices that collect, monitor, analyze, and exchange data. This technology plays a crucial role in the smart city infrastructure by seamlessly interconnecting various nodes. The extensive application and recognition of IoT across multiple city domains, such as healthcare, transportation, energy, education, and agriculture, bring significant challenges, with security among the most pressing. Traditional hardware technologies like Complementary Metal Oxide Semiconductor (CMOS) and Very Large Scale Integration (VLSI) suffer from limitations such as high power consumption and insufficient scalability, which hinder secure and sustainable IoT deployment. Such limitations have prompted the need to seek other technologies that would serve the dual purpose of providing security as well as energy. Quantum-based technologies can become adequate candidates offering promising solutions to make IoT devices and sustainable systems more secured. Quantum-dot Cellular Automata (QCA) has been proposed as a nanotechnology with the potential of consuming ultra-low powers, less area, and high-speed operation. QCA enhances security through sustainable computing objectives by minimizing energy usage. To improve the future security and efficiency of IoT hardware, this paper suggests a QCA-based Arithmetic Logic Unit (ALU). This ALU can generate more than 12 logical and arithmetic operations. Designed together with the majority gates, XOR gates, multiplexers, and full adders, the ALU is simulated using the QCA-Designer 2.0.3. Simulated results indicate improvements in the number of cells and reduced occupied area relative to the earlier designs. These results indicate the potential of QCA technology in enabling secure, energy-efficient, and compact computing architecture applicable in the future IoT.}, archive = {J_EAAI}, author = {Maryam Zaker and Seyed Sajad Ahmadpour and Nima Jafari Navimipour and Muhammad Zohaib and Neeraj Kumar Misra and Sankit Kassa and Ahmad Habibizad Navin and Arash Heidari and Mehdi Hosseinzadeh and Omar I. Alsaleh}, doi = {10.1016/j.engappai.2025.112113}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112113}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {A new design of arithmetic and logic unit for enhancing the security of future internet of things devices using quantum-dot technology}, volume = {162}, year = {2025}, }
• (2025). Prescribed-time convergence noise-tolerant zeroing neural network for multi-robot position management and coordination. EAAI, 162, 112072. (www)

  @article{ , abstract = {A zeroing neural network (ZNN) model with prescribed-time convergence and noise tolerance is constructed for the first time to address multi-robot position planning (MPP) tasks. Unlike traditional ZNN models, which converge within finite, fixed, or predefined times, this model ensures that system errors converge precisely within the predefined time T p . Furthermore, it significantly enhances noise tolerance while maintaining excellent convergence performance. Through rigorous mathematical analysis and detailed numerical simulations, the proposed model demonstrates exceptional convergence and robustness, even under noise disturbances. In a noise-free environment, the convergence time accuracy (CTA) of this model when solving the MPP task reach over 90%, which is approximately 30% higher than traditional predefined-time convergence neural networks.}, archive = {J_EAAI}, author = {Tinglei Wang and Yufei Wang and Cheng Hua and Xinwei Cao and Bolin Liao and Shuai Li}, doi = {10.1016/j.engappai.2025.112072}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {112072}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Prescribed-time convergence noise-tolerant zeroing neural network for multi-robot position management and coordination}, volume = {162}, year = {2025}, }
• (2025). Inland waterway object detection in multi-environment: Dataset and approach. EAAI, 162, 111994. (www)

  @article{ , abstract = {Deep learning has advanced intelligent ship visual perception, but the scarcity of dedicated inland waterway vessels dataset limits system adaptability in complex environments. Narrow waterways, variable weather, and urban interference challenge the robustness of existing object detection systems. To address these issues, this paper constructs the Multi-environment Inland Waterway Vessels Dataset (MEIWVD), comprising 32,478 high-quality images from diverse Yangtze River basin scenarios, including sunny, rainy, foggy, and artificially lit conditions. The diversity and multi-scale characteristics of MEIWVD establish it as a rigorous benchmark for vessel detection. To leverage the characteristics of the MEIWVD, this paper proposes a scene-guided image enhancement module for multi-environment scenarios, which adaptively enhances water surface images based on environmental conditions to improve detector performance in complex scenarios. Additionally, a parameter-limited dilated convolution is introduced to enhance the representation of salient features of inland waterway vessels by leveraging their geometric characteristics. Finally, a multi-scale dilated residual fusion method is proposed to effectively integrate multi-scale features and improve the detection of multi-scale objects. Comprehensive statistical analysis and experiments on the MEIWVD demonstrate that it poses higher demands on object detection algorithms compared to existing water surface datasets, owing to its diverse and challenging scenarios. The proposed methods, including scene-guided image enhancement, parameter-limited dilated convolution, and multi-scale dilated residual fusion, advance research in multi-environment dataset, achieving a mean average precision over intersection over union thresholds from 0.5 to 0.95 of 81.6 % on the MEIWVD, outperforming state-of-the-art object detection algorithms.}, archive = {J_EAAI}, author = {Shanshan Wang and Haixiang Xu and Hui Feng and Xiaoqian Wang and Pei Song and Sijie Liu and Jianhua He}, doi = {10.1016/j.engappai.2025.111994}, journal = {Engineering Applications of Artificial Intelligence}, month = {12}, pages = {111994}, shortjournal = {Eng. Appl. Artif. Intell.}, title = {Inland waterway object detection in multi-environment: Dataset and approach}, volume = {162}, year = {2025}, }

EJOR - 24

• (2026). Optimistic and pessimistic approaches for cooperative games. EJOR, 328(2), 725-733. (www)

  @article{ , abstract = {Cooperative game theory explores how to fairly allocate the joint value generated by a group of decision-makers, but its application is compromised by the large number of counterfactuals needed to compute the value of all coalitions, a problem made even more complicated when externalities are present. We provide a theoretical foundation for a simplification used in many applications, in which the value of a coalition is computed assuming that they either select before or after the complement set of agents, providing optimistic and pessimistic values on what a coalition should receive. In a vast set of problems exhibiting what we call feasibility externalities, we show that ensuring a coalition does not receive more than its optimistic value is always at least as difficult as ensuring it receives its pessimistic value. Furthermore, under the presence of negative externalities, we establish the existence of stable allocations that respect these bounds. Finally, we examine well-known optimization-based applications and their corresponding cooperative games to show how our results lead to new insights and allow the derivation of further results from the existing literature.}, archive = {J_EJOR}, author = {Ata Atay and Christian Trudeau}, doi = {10.1016/j.ejor.2025.09.002}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {725-733}, shortjournal = {Eur. J. Oper. Res.}, title = {Optimistic and pessimistic approaches for cooperative games}, volume = {328}, year = {2026}, }
• (2026). Sustainable product development under profit-sharing crowdfunding: An analytical approach to market structure and government policy. EJOR, 328(2), 704-724. (www)

  @article{ , abstract = {This study develops an integrated analytical framework to examine how crowdfunding, market structure, and government policy interact to shape environmentally sustainable product development (SPD). Focusing on profit-sharing and securities-based crowdfunding, we model how investor opportunity costs, risk preferences, platform fees, and regulatory schemes (voluntary vs. mandatory under fiscal vs. non-fiscal policy regimes) influence firm strategies and outcomes across economic, social, and environmental (ESE) dimensions. Firm behavior is analyzed under monopoly and duopoly settings to explore variation in market power and competitive intensity. Findings reveal that voluntary greening can achieve strong ESE outcomes in monopolistic markets with low financial frictions and environmentally aware consumers. In contrast, competitive or uncertain environments often require benchmark-based regulation and fiscal instruments to sustain environmental investments. Two dominant firm profiles emerge: the Voluntary sustainability leader, which performs well under favorable market and investor conditions without policy intervention, and the Policy-driven strategist, which depends on regulatory standards and fiscal tools to overcome competitive pressures and risk constraints. By formalizing investor-entrepreneur interactions and embedding environmental quality as a strategic variable, this research advances the literature on crowdfunding and market-driven sustainability. It provides actionable insights for aligning crowdfunding design and policy frameworks with the broader goals of green innovation and public sustainability.}, archive = {J_EJOR}, author = {Raziyeh Reza-Gharehbagh and Madeleine Pullman}, doi = {10.1016/j.ejor.2025.08.020}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {704-724}, shortjournal = {Eur. J. Oper. Res.}, title = {Sustainable product development under profit-sharing crowdfunding: An analytical approach to market structure and government policy}, volume = {328}, year = {2026}, }
• (2026). Optimal dividend and scale of business strategies with reinsurance and premium pricing for insurance company. EJOR, 328(2), 694-703. (www)

  @article{ , abstract = {This paper investigates the optimal dividend and business scale strategies aimed at maximizing the value of an insurance company. While prior studies typically assume that insurers can only adjust their business scale through reinsurance, this study extends the framework by allowing the insurer to control the premium rate. Under more realistic market assumptions, we examine the joint optimization problem for two common types of reinsurance — proportional and excess-of-loss — across both arbitrage and non-arbitrage scenarios. We derive the optimal strategies for dividends and premium pricing, along with their corresponding value functions. The results show that the insurer should decrease the premium rate and reduce reinsurance coverage as the surplus increases. The optimal dividend policy follows a barrier strategy. Economic interpretations and numerical examples are provided to illustrate the findings.}, archive = {J_EJOR}, author = {Dingjun Yao and Bo Yang and Xin Xu and Youwei Li and Yizhi Wang}, doi = {10.1016/j.ejor.2025.07.039}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {694-703}, shortjournal = {Eur. J. Oper. Res.}, title = {Optimal dividend and scale of business strategies with reinsurance and premium pricing for insurance company}, volume = {328}, year = {2026}, }
• (2026). Anticipating delays in recruitment: Explainable machine learning for the prediction of hard-to-fill online job vacancies. EJOR, 328(2), 680-693. (www)

  @article{ , abstract = {Online job vacancy (OJV) platforms have transformed the labor market by enabling employers to advertise jobs to a wide audience. Particularly in tight labor markets, quickly identifying vacancies likely to suffer prolonged durations is crucial. This study utilizes data from the Flemish public employment service's OJV platform to examine the effectiveness of machine learning in predicting hard-to-fill vacancies. We achieve notable predictive performance with XGBoost in forecasting recruitment delays and demonstrate the importance of capturing non-linear patterns in OJV data. SHAP (SHapley Additive exPlanations) values reveal that the textual content of vacancies and latent company characteristics are key predictors of hiring delays. Counterfactual-SHAP insights provide practical guidance for refining recruitment strategies, enhancing labor market forecasts, and informing targeted policies.}, archive = {J_EJOR}, author = {Wouter Dossche and Sarah Vansteenkiste and Bart Baesens and Wilfried Lemahieu}, doi = {10.1016/j.ejor.2025.06.027}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {680-693}, shortjournal = {Eur. J. Oper. Res.}, title = {Anticipating delays in recruitment: Explainable machine learning for the prediction of hard-to-fill online job vacancies}, volume = {328}, year = {2026}, }
• (2026). Using diet optimization and machine learning for the design of healthy and acceptable menu plans. EJOR, 328(2), 668-679. (www)

  @article{ , abstract = {The success of dietary plans relies on understanding and modelling consumer acceptance, yet quantifying this poses a challenge due to the complexity of individual preferences. Recent research is focused on deriving acceptability constraints directly from data, as demonstrated by its application in designing food baskets with a limited number of commodities. In this study, we applied diet optimization with machine learning to the more complex task of menu planning. This involved considering hundreds of potential food alternatives and assessing their compatibility within a meal using a recipe completion algorithm. Compared to the traditional diet modelling approach of food group filtering, the recipe completion model delivered diets with either higher nutritional adequacy or greater substitute acceptability, depending on the number of food groups used in the traditional method. While more research is needed to further improve the acceptability of substitutions, combining diet optimization with recipe completion presents a promising approach to enhance the nutritional adequacy of individual diets while maintaining the acceptability of food combinations within meals.}, archive = {J_EJOR}, author = {Dominique van Wonderen and Johanna C. Gerdessen and Alida Melse-Boonstra and Marleen C. Onwezen}, doi = {10.1016/j.ejor.2025.06.015}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {668-679}, shortjournal = {Eur. J. Oper. Res.}, title = {Using diet optimization and machine learning for the design of healthy and acceptable menu plans}, volume = {328}, year = {2026}, }
• (2026). Project monitoring and control with an empirically grounded budget-release model. EJOR, 328(2), 646-667. (www)

  @article{ , abstract = {Project monitoring and control (PMC) is a process of measuring a project’s progress and taking corrective action when necessary to ensure successful project completion. However, most existing models lack empirical validation of their assumptions and effectiveness, which limits their practical use. We fill in this gap by using empirical data from 97 real projects to calibrate activity-duration distributions and assess activity-duration dependencies, integrating these empirical foundations into an enhanced PMC model. We further improve the model by incorporating budget-release timing constraints and introducing two new policies for crashing and fast-tracking based on a project’s specific time and cost characteristics. Extensive computational experiments using empirical and artificial data evaluate the effectiveness of these policies. Because the budget-release policies and corrective action types depend on project characteristics such as activity-duration dependencies and topological network structure, key insights from this study can be usefully applied by project managers as heuristics even without a detailed model of their project.}, archive = {J_EJOR}, author = {Jie Song and Jinbo Song and Tyson Browning and Mario Vanhoucke}, doi = {10.1016/j.ejor.2025.06.007}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {646-667}, shortjournal = {Eur. J. Oper. Res.}, title = {Project monitoring and control with an empirically grounded budget-release model}, volume = {328}, year = {2026}, }
• (2026). The continuous roll-on roll-off dual cycling problem with tugs and driver-handled cargo units. EJOR, 328(2), 633-645. (www)

  @article{ , abstract = {Roll-on roll-off vessels are a popular mode of transport in short-sea shipping. In this domain, appropriate stevedoring procedures are crucial to enhance efficiency. This includes dual cycling, where tugs simultaneously load and unload the vessel. Dual cycling reduces turnaround time, thereby giving the vessel more time to travel and allowing for slow steaming and reduced emissions. We extend the roll-on roll-off dual cycling problem by incorporating a continuous time horizon and differentiating cargo units that are handled by their own drivers and units that must be handled by a tug. We propose a mixed integer linear programming model for generating an efficient schedule that minimizes overall makespan by optimizing the sequence of cargo units and the assignment of cargo units to tugs. To solve instances of real-world size with acceptable computational effort, we provide a range of heuristics, including a biased random-key genetic algorithm. Compared to the linear programming model and on instances of real-world size, the genetic algorithm finds good solutions quickly. We derive managerial insights from a sensitivity analysis and show that dual cycling and strategic positioning of driver-handled units can reduce turnaround time by 14.5%, reducing emissions of the considered vessel by more than 8%. We demonstrate the robustness of these insights in uncertain environments through a simulation study.}, archive = {J_EJOR}, author = {Teresa Marquardt and Arne Heinold and Catherine Cleophas and Frank Meisel}, doi = {10.1016/j.ejor.2025.05.050}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {633-645}, shortjournal = {Eur. J. Oper. Res.}, title = {The continuous roll-on roll-off dual cycling problem with tugs and driver-handled cargo units}, volume = {328}, year = {2026}, }
• (2026). Optimizing treatment allocation in the presence of interference. EJOR, 328(2), 620-632. (www)

  @article{ , abstract = {In Influence Maximization (IM), the objective is to — given a budget — select the optimal set of entities in a network to target with a treatment so as to maximize the total effect. For instance, in marketing, the objective is to target the set of customers that maximizes the total response rate, resulting from both direct treatment effects on targeted customers and indirect, spillover, effects that follow from targeting these customers. Recently, new methods to estimate treatment effects in the presence of network interference have been proposed. However, the issue of how to leverage these models to make better treatment allocation decisions has been largely overlooked. Traditionally, in Uplift Modeling (UM), entities are ranked according to estimated treatment effect, and the top entities are allocated treatment. Since, in a network context, entities influence each other, the UM ranking approach will be suboptimal. The problem of finding the optimal treatment allocation in a network setting is NP-hard, and generally has to be solved heuristically. To fill the gap between IM and UM, we propose OTAPI: Optimizing Treatment Allocation in the Presence of Interference to find solutions to the IM problem using treatment effect estimates. OTAPI consists of two steps. First, a causal estimator is trained to predict treatment effects in a network setting. Second, this estimator is leveraged to identify an optimal treatment allocation by integrating it into classic IM algorithms. We demonstrate that this novel method outperforms classic IM and UM approaches on both synthetic and semi-synthetic datasets.}, archive = {J_EJOR}, author = {Daan Caljon and Jente Van Belle and Jeroen Berrevoets and Wouter Verbeke}, doi = {10.1016/j.ejor.2025.09.015}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {620-632}, shortjournal = {Eur. J. Oper. Res.}, title = {Optimizing treatment allocation in the presence of interference}, volume = {328}, year = {2026}, }
• (2026). Soft regression trees: A model variant and a decomposition training algorithm. EJOR, 328(2), 607-619. (www)

  @article{ , abstract = {Decision trees are widely used for classification and regression tasks in a variety of application fields due to their interpretability and good accuracy. During the past decade, growing attention has been devoted to globally optimized decision trees with deterministic or soft splitting rules at branch nodes, which are trained by optimizing the error function over all the tree parameters. In this work, we propose a new variant of soft multivariate regression trees (SRTs) where, for every input vector, the prediction is defined as the linear regression associated to a single leaf node, namely, the leaf node obtained by routing the input vector from the root along the branches with higher probability. SRTs exhibit the conditional computational property, i.e., each prediction depends on a small number of nodes (parameters), and our nonlinear optimization formulation for training them is amenable to decomposition. After showing a universal approximation result for SRTs, we present a decomposition training algorithm including a clustering-based initialization procedure and a heuristic for rerouting the input vectors along the tree. Under mild assumptions, we establish asymptotic convergence guarantees. Experiments on 15 well-known datasets indicate that our SRTs and decomposition algorithm yield higher accuracy and robustness compared with traditional soft regression trees trained using the nonlinear optimization formulation of Blanquero et al. (2021), and a significant reduction in training times as well as a slightly better average accuracy compared with the mixed-integer optimization approach of Bertsimas and Dunn (2019). We also report a comparison with the Random Forest ensemble method.}, archive = {J_EJOR}, author = {Antonio Consolo and Edoardo Amaldi and Andrea Manno}, doi = {10.1016/j.ejor.2025.08.050}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {607-619}, shortjournal = {Eur. J. Oper. Res.}, title = {Soft regression trees: A model variant and a decomposition training algorithm}, volume = {328}, year = {2026}, }
• (2026). An explainable machine learning framework for recurrent event data analysis. EJOR, 328(2), 591-606. (www)

  @article{ , abstract = {This paper introduces a novel explainable temporal point process (TPP) model, Stratified Hawkes Point Process (SHPP), for modelling recurrent event data (RED). Unlike existing approaches that treat temporal influence as a black box or rely on post-hoc explanations, SHPP structurally decomposes event intensities into semantically meaningful components for describing self-, Markovian, and joint influences. This decomposition enables direct quantification of how past events contribute to future event risks, termed as influence values. We further provide a sufficient condition for mean-square stability based on kernel decay, ensuring long-term boundedness of intensities and realistic behavioural predictions. Experiments and an e-commerce case study demonstrate SHPP’s ability to deliver accurate, interpretable, and stable modelling of complex event-driven systems.}, archive = {J_EJOR}, author = {Qi Lyu and Shaomin Wu}, doi = {10.1016/j.ejor.2025.09.005}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {591-606}, shortjournal = {Eur. J. Oper. Res.}, title = {An explainable machine learning framework for recurrent event data analysis}, volume = {328}, year = {2026}, }
• (2026). Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization. EJOR, 328(2), 574-590. (www)

  @article{ , abstract = {Finding a set with a good approximation to the Pareto-optimal solutions in the multiobjective optimization problem (MOP) is a challenging task in terms of convergence toward and diversity across the Pareto optimal front (PoF). In some cases, solving MOPs requires satisfying certain constraints, which significantly increases the complexity of the problem. Such problems are constrained multiobjective optimization problems (CMOPs) and pose considerable computational challenges. Many constrained multiobjective evolutionary algorithms (CMOEAs) face challenges in avoiding becoming trapped in local optima, which impacts convergence, and offer solutions that lack good coverage of the PoF, implying weak diversity. All these nonoptimal or partially optimal solutions in the objective space are essentially clustered in local optimality dilemmas in the decision space. To better eliminate the convergence and diversity challenges caused by clustered solutions, this paper proposes a decision space dynamic niching-based (DSDN) method to better address CMOPs. Specifically, the DSDN method adds a dynamic decision space niche as an additional criterion to the traditional Pareto-constrained dominance principle (Pareto-CDP). The better preserved solutions must satisfy the Pareto-CDP and the condition within the niche radius of other solutions, which strictly meets the original dominance relationship requirement while relaxing the nondominance threshold. As a result, the dynamic adjustment of the niche radius ( N R ) effectively balances the exploitation and exploration of solutions in the decision space while enhancing both convergence and diversity in the objective space. Experiments conducted on four widely recognized test suites and three real-world case studies have demonstrated that the DSDN method yields significantly better results than the original Pareto-CDP algorithms. Furthermore, the proposed approach is competitive with or comparable to seven other state-of-the-art CMOEAs.}, archive = {J_EJOR}, author = {Fan Yu and Qun Chen and Jinlong Zhou}, doi = {10.1016/j.ejor.2025.07.002}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {574-590}, shortjournal = {Eur. J. Oper. Res.}, title = {Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization}, volume = {328}, year = {2026}, }
• (2026). Impact of technology spillovers and subsidies on innovation consortia dynamics. EJOR, 328(2), 560-573. (www)

  @article{ , abstract = {In innovation consortia, governments and enterprises view technology spillovers and subsidies differently, which reduces the effectiveness of policies and undermines cooperation. This work investigates the dynamics of cooperation among leading enterprises (LEs) and small/medium enterprises (SMEs), using an evolutionary game model with intrinsic, extrinsic and mixed strategies. We show that there may exist more than one evolutionary equilibrium of enterprise cooperation under multi-strategy choices. A high subsidy may induce enterprises to speculate and reach a suboptimal evolutionary equilibrium. Furthermore, our findings indicate that SMEs are particularly sensitive to changes in subsidy levels, income distribution ratios, and project income, with their speculative behavior exhibiting a lagging effect. Also, increasing the income distribution ratio of LEs can promote active cooperation between the groups and reduce the speculative tendency of SMEs. This occurs because it magnifies the effect of technology spillover on the income of SMEs and enhances the income of the leading enterprises. Our work improves understanding of cooperative factors and provides new recommendations for government and leading enterprises to improve cooperation and managerial performance.}, archive = {J_EJOR}, author = {Zheng Yang and Lin Li and Nicholas G. Hall and Yongzeng Lai and Yijiang Zhou}, doi = {10.1016/j.ejor.2025.06.031}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {560-573}, shortjournal = {Eur. J. Oper. Res.}, title = {Impact of technology spillovers and subsidies on innovation consortia dynamics}, volume = {328}, year = {2026}, }
• (2026). Online quality endorsement to improve consumer trust: Blockchain or self-hosted livestream?. EJOR, 328(2), 545-559. (www)

  @article{ , abstract = {Online products have long suffered from consumer distrust, putting them at a disadvantage when online brands compete with offline brands. To address this issue, many online brands have adopted blockchain as a means of quality endorsement to improve consumer trust. Alternatively, livestream e-commerce has shown the capability of both quality endorsement and demand creation by real-time interactions with consumers because the application of AR/VR technology and the use of online sales force can effectively induce the herding mentality. For many small and medium-sized online brands, it remains unclear which approach is better, so we formulate the key tradeoffs in the online brand's choice to improve consumer trust in the presence of offline brand's competition. Our research delves into the influence of three key factors on livestream e-commerce: the cost associated with adopting blockchain technology, the strength of positive network externality, and the potential downside of consumer returns. Contrary to conventional wisdom, we find that when the return cost is high and the network externality in livestream is weak, opting for livestream as a quality endorsement can actually benefit the online brand. We also find that the online brand is capable of mitigating the return cost by transferring it to consumers through charging a high retail price, which increases the likelihood of favoring livestream. Our findings shed light on the building and improvement of online consumer trust, contributing to the high-quality development of online-offline business in the new era of consumption.}, archive = {J_EJOR}, author = {Baozhuang Niu and Jian Dong and Xinhu Yu and Yulan Wang}, doi = {10.1016/j.ejor.2025.04.010}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {545-559}, shortjournal = {Eur. J. Oper. Res.}, title = {Online quality endorsement to improve consumer trust: Blockchain or self-hosted livestream?}, volume = {328}, year = {2026}, }
• (2026). Production trade-offs in free disposal hull technologies. EJOR, 328(2), 530-544. (www)

  @article{ , abstract = {In data envelopment analysis, production trade-offs are value judgements that represent simultaneous changes to the inputs and outputs assumed to be technologically possible for any production unit in the technology. The specification of production trade-offs generally leads to an enlargement of the model of technology and increasing its discriminating power on efficiency. In conventional convex variable and constant returns-to-scale models, production trade-offs are the dual forms of weight restrictions. In this paper, we extend the use of production trade-offs to the free disposal hull model of technology and its constant, non-increasing and non-decreasing returns-to-scale variants, in a single unifying development. We provide an axiomatic definition of the new nonconvex technologies, explore the notion of consistent trade-offs in such technologies and develop methods for its testing. We further develop different computational approaches for nonconvex models with production trade-offs. We illustrate the new models by an application in the context of higher education.}, archive = {J_EJOR}, author = {Mahmood Mehdiloo and Grammatoula Papaioannou and Victor V. Podinovski}, doi = {10.1016/j.ejor.2025.06.032}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {530-544}, shortjournal = {Eur. J. Oper. Res.}, title = {Production trade-offs in free disposal hull technologies}, volume = {328}, year = {2026}, }
• (2026). Price optimization for round trip car sharing. EJOR, 328(2), 511-529. (www)

  @article{ , abstract = {Car sharing, car clubs and short-term rentals could support the transition toward net zero but their success depends on them being financially sustainable for service providers and attractive to end users. Dynamic pricing could support this by incentivizing users while balancing supply and demand. We describe the usage of a round trip car sharing fleet by a continuous time Markov chain model, which reduces to a multi-server queuing model where hire duration is assumed independent of the hourly rental price. We present analytical and simulation optimization models that allow the development of dynamic pricing strategies for round trip car sharing systems; in particular identifying the optimal hourly rental price. The analytical tractability of the queuing model enables fast optimization to maximize expected hourly revenue for either a single fare system or a system where the fare depends on the number of cars on hire, while accounting for stochasticity in customer arrival times and durations of hire. Simulation optimization is used to optimize prices where the fare depends on the time of day or hire duration depends on price. We present optimal prices for a given customer population and show how the expected revenue and car availability depend on the customer arrival rate, willingness-to-pay distribution, dependence of the hire duration on price, and size of the customer population. The results provide optimal strategies for pricing of car sharing and inform strategic managerial decisions such as whether to use time- or state-dependent pricing and optimizing the fleet size.}, archive = {J_EJOR}, author = {Christine S.M. Currie and Rym M’Hallah and Beatriz Brito Oliveira}, doi = {10.1016/j.ejor.2025.06.024}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {511-529}, shortjournal = {Eur. J. Oper. Res.}, title = {Price optimization for round trip car sharing}, volume = {328}, year = {2026}, }
• (2026). The development strategy of supply chain intelligent technology considering technology development uncertainty. EJOR, 328(2), 496-510. (www)

  @article{ , abstract = {It’s crucial for both manufacturing and logistics industries to improve logistics efficiency and reduce logistics loss during transportation, storage, and other processes through the development and application of intelligent technology. By focusing on three potential modes of intelligent technology development cooperation between a manufacturer and its logistics provider, we examine the impact of such collaboration on reducing Logistics loss, as well as explore the optimal mode of cooperation for both firms. Our analytical results indicate that compared to independent technology development, collaborative development of intelligent technology can mitigate the adverse effects of double-marginalization. Comparing the three modes of cooperation, we find that higher development cost can incentivize the collaboration between two firms, while higher integration cost and price elasticity may make the cost sharing mode preferable. It is noteworthy that the uncertainty of intelligent technology development exerts a significant moderating effect on the choice of cooperation mode. Heightened technology development uncertainty tends to incentivize both firms to pursue joint development in order to alleviate the negative impact of the uncertainty.}, archive = {J_EJOR}, author = {Peng Han and Yanfang Huo and Weihua Liu and Ershi Qi and Helen Cai}, doi = {10.1016/j.ejor.2025.07.026}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {496-510}, shortjournal = {Eur. J. Oper. Res.}, title = {The development strategy of supply chain intelligent technology considering technology development uncertainty}, volume = {328}, year = {2026}, }
• (2026). Optimal price, quantity, and return policy decisions of a two-period newsvendor with product reviews. EJOR, 328(2), 477-495. (www)

  @article{ , abstract = {Online retailers (e-tailers) have high product return rates. To decrease product returns and consumers’ purchase risk, e-tailers can increase available product information through product reviews and/or offer money back guarantees (MBGs). We examine the rational expectations equilibrium of an e-tailer selling to myopic and strategic consumers over two periods. By the end of period 1, product reviews become available, providing a signal to strategic consumers who may wait to purchase in period 2. The e-tailer decides order quantity, prices, and return policy. We find that under both no returns and MBG, as strategic consumers’ patience increases, the optimal range of having them purchase in period 2 increases. For low signal accuracy, it is optimal to have strategic consumers purchase in period 1, whereas for high signal accuracy, it is optimal to have them purchase in period 2. However, under no returns and for a low signal accuracy, it may be optimal to have strategic consumers purchase in period 2 if their proportion is medium and they are patient. We also find that as consumers’ patience increases, the range where MBG dominates no returns increases. For heterogeneous signal accuracy among strategic consumers, equilibrium strategies are similar to the homogeneous case, except that when consumers’ patience is low, high heterogeneity allows the e-tailer to price discriminate, making low-signal accuracy consumers purchase in period 1 and high-signal accuracy consumers purchase in period 2. Also, as the proportion of low-signal accuracy consumers increases, price discrimination increases. Therefore, heterogeneity increases profit.}, archive = {J_EJOR}, author = {Huirong Fan and Moutaz Khouja and Jing Zhou}, doi = {10.1016/j.ejor.2025.06.023}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {477-495}, shortjournal = {Eur. J. Oper. Res.}, title = {Optimal price, quantity, and return policy decisions of a two-period newsvendor with product reviews}, volume = {328}, year = {2026}, }
• (2026). Probabilistic forecast aggregation with statistical depth. EJOR, 328(2), 460-476. (www)

  @article{ , abstract = {This paper considers aggregation methods for interval forecasts and forecasts of cumulative distribution functions (CDFs) when there are many forecasters, and past forecast accuracy may not be known. For aggregation, the median and trimmed means have been proposed as simple and robust alternatives to the mean, with some trimmed mean approaches enabling recalibration to widen or narrow the resulting interval or CDF forecast. For interval forecast aggregation, the median and trimming are applied to each bound separately. To try to use the available information better, we treat the bounds as a bivariate point with statistical depth used to order the points in terms of centrality. The deepest point can be viewed as the median interval forecast, and the depth of each point can be used as the basis for trimming. For CDF forecasts, the literature presents aggregation methods for which the median or trimmed mean are obtained for each point on the domain of the distribution. However, if one part of a CDF forecast is outlying, the appeal of using the rest of the CDF forecast is perhaps reduced. We use functional depth to provide a measure of centrality for each CDF forecast, and hence identify the deepest function, which can be viewed as the median forecast. We also use functional depth as the basis for trimming, and consider weighted depth to control the width of the resulting aggregated interval or CDF forecast. We provide empirical illustration using data from surveys of professional macroeconomic forecasters, and an application to growth-at-risk.}, archive = {J_EJOR}, author = {James W. Taylor}, doi = {10.1016/j.ejor.2025.06.028}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {460-476}, shortjournal = {Eur. J. Oper. Res.}, title = {Probabilistic forecast aggregation with statistical depth}, volume = {328}, year = {2026}, }
• (2026). A data-driven approach for strategic inventory placement in multi-echelon supply networks. EJOR, 328(2), 446-459. (www)

  @article{ , abstract = {This paper provides a data-driven solution for optimizing inventory buffers in large-scale supply networks. We study the placement and sizing of strategic inventories in multi-echelon supply chains where the decision maker faces uncertain demand with an unknown distribution influenced by explanatory variables. State-of-the-art multi-echelon inventory optimization models, such as the well-known guaranteed-service model (GSM), are non-linear and typically informed by distributional and parametric assumptions. They often rely on dynamic programming and are difficult to solve for large networks. We adapt the GSM to introduce a nonparametric, feature-driven approach to supply chain safety stock optimization that is based on mixed-integer linear programming (MILP). The MILP formulation sets cost-optimal base stocks, which are learned as linear functions of feature data under consideration of service level requirements. This integrated estimation and optimization approach is solved with commercial mathematical programming solvers and is enhanced by a Benders decomposition method for large networks. We extend the literature on data-driven inventory control by a multi-period and multi-echelon approach for safety stock planning in general, acyclic networks. On the real-world networks from Willems (2008), we find that incorporating feature information when setting safety stocks in large supply chains, on average, reduces operational costs out-of-sample. This value of feature information that the proposed model offers to decision-makers increases in demand volatility and is dependent on certain network characteristics.}, archive = {J_EJOR}, author = {Josef Svoboda and Stefan Minner}, doi = {10.1016/j.ejor.2025.06.022}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {446-459}, shortjournal = {Eur. J. Oper. Res.}, title = {A data-driven approach for strategic inventory placement in multi-echelon supply networks}, volume = {328}, year = {2026}, }
• (2026). Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages. EJOR, 328(2), 430-445. (www)

  @article{ , abstract = {We investigate a network maintenance scheduling problem where maintenance tasks are carried out on the arcs of a network within flexible time windows. During maintenance, an arc is interrupted and no flow can pass through it. Such arc outages introduce flow loss and thus affect network capacity and service capability. For some public services operated on networks, possible blackouts and serious flow loss introducing extreme risks are generally unacceptable. The problem is to find a feasible schedule of maintenance tasks so that the maximum flow loss during the planning horizon is minimized. We introduce a mixed integer programming formulation and a Benders reformulation for the problem. A Benders decomposition algorithm based on a branch-and-cut framework is designed. Strengthened initial cuts and effective cuts are introduced to reduce feasible region so that the exact algorithm is accelerated. An efficient separation procedure is proposed to generate Benders optimality cuts. Computational experiments were conducted on a set of benchmark instances and a set of simulated instances based on telecommunication networks. Computational results show that our algorithm performs much better than applying a solver to the formulation and an existing Benders decomposition algorithm for a related problem. Optimal schedules can reduce extreme risks caused by large flow loss on the network. Since multiple optimal solutions may exist, hierarchical optimization is used to further select a desirable schedule, by either minimizing total flow loss or minimizing the duration of maximum flow loss. With adaptations, our algorithm also performs well for two extensions.}, archive = {J_EJOR}, author = {Shuang Jin and Ying Liu and Jing Zhou and Qian Hu}, doi = {10.1016/j.ejor.2025.07.056}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {430-445}, shortjournal = {Eur. J. Oper. Res.}, title = {Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages}, volume = {328}, year = {2026}, }
• (2026). Stochastic quay partitioning problem. EJOR, 328(2), 415-429. (www)

  @article{ , abstract = {In this paper we consider the problem of dividing a quay of a container terminal into berth segments so that the quality of service for future ship arrivals is as good as possible. Since future arrivals are unknown, the alternative solutions are evaluated on various arrival scenarios generated for certain arrival intensity from a stochastic model referred to as a ship traffic model (STM). This problem will be referred to as a stochastic quay partitioning problem (SQPP). SQPP is defined by an STM, arrival intensity, quay length and a set of admissible berth lengths. Evaluation of an SQPP solution on one scenario is a problem of scheduling the arriving vessels on the berths, which is a classic berth allocation problem (BAP). In SQPP the sizes of BAP instances that must be solved by far exceed capabilities of the methods presented in the existing literature. Therefore, a novel approach to solving BAP is applied. Tailored portfolios of algorithms capable of solving very large BAP instances under limited runtime are used. Features of SQPP solutions are studied experimentally: patterns in selected berth lengths, dispersion of solutions quality and solutions similarity. We demonstrate, that partitioning a quay into equal-length berths is not the best approach. The largest vessel traffic is dominating in defining best quay partitions, but dedicating quays for shorter vessels give lower dispersion of solution quality. A set of algorithms to partition a quay is proposed and evaluated: methods based on integer linear programming (ILP) to match vessel classes arrival intensities with berth availability, hill climber, tabu search and a greedy approach. Only under high arrival intensity can these methods show their prowess. ILP methods have an advantage of low solution evaluation cost. Tabu is most flexible, but at high evaluation costs. To the best of our knowledge, SQPP is posed and solved for the first time in the operations research.}, archive = {J_EJOR}, author = {Jakub Wawrzyniak and Maciej Drozdowski and Éric Sanlaville}, doi = {10.1016/j.ejor.2025.07.043}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {415-429}, shortjournal = {Eur. J. Oper. Res.}, title = {Stochastic quay partitioning problem}, volume = {328}, year = {2026}, }
• (2026). Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities. EJOR, 328(2), 407-414. (www)

  @article{ , abstract = {A new batch scheduling problem, name mixed batch scheduling problem, is received attentions recently. In a mixed batch scheduling model, the processing time of a job batch H is defined as α max j ∈ H { p j } + ( 1 − α ) ∑ j ∈ H p j , where α ∈ [ 0 , 1 ] is a constant. In other words, the processing time of a job batch is the weighted sum of the maximum processing time and the total processing time of jobs in the batch. In this paper, we study the problem of scheduling mixed batch machines with non-identical capacities under inclusive processing set restrictions, where the objective is to minimize the makespan of finishing all the jobs. We present a fast approximation algorithm with a performance ratio of 4 / 3 + α for the problem, which improves up the existing performance bounds in the literature. By providing a technical lemma, we are able to develop the first polynomial time approximation scheme (PTAS) for the problem. We also design linear-time approximation schemes for two important special cases of the problem.}, archive = {J_EJOR}, author = {Jinwen Ou and Weidong Li}, doi = {10.1016/j.ejor.2025.07.012}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {407-414}, shortjournal = {Eur. J. Oper. Res.}, title = {Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities}, volume = {328}, year = {2026}, }
• (2026). A matheuristic approach for the robust coloured travelling salesman problem with multiple depots. EJOR, 328(2), 390-406. (www)

  @article{ , abstract = {In this work, a special type of the travelling salesman problem (TSP) called the coloured TSP (CTSP) is considered. The CTSP, which has many real-world applications, involves a set of salesmen, each assigned a specific colour, and cities that may have one or multiple colours. Salesmen are restricted to visiting only cities that share their colour. We consider a specific depot for each salesman, and the edge weights are uncertain, meaning that there is a set of possible scenarios for their values. A robust objective is considered and minimised using an artificial intelligence (AI)-driven matheuristic approach due to the high computational complexity of the problem. This approach integrates a variable neighbourhood search (VNS) framework with genetic algorithm (GA) and simulated annealing (SA) operators. More importantly, local improvements based on mathematical programming are applied to different parts of a proportion of the solutions using the concept of partial optimisation metaheuristic under special intensification conditions (POPMUSIC). A key innovation of our method is the use of an artificial neural network to guide the POPMUSIC procedure by selecting only solution segments with high improvement potential, thereby reducing computation time. Extensive computational experiments demonstrate the effectiveness of the proposed algorithm, which outperforms four state-of-the-art methods in solution quality and runs faster than three of them. We also investigate the contribution of individual algorithmic components and the cost of robustness. Furthermore, our method improves upon the best-known results for the single-depot deterministic version of the CTSP from the literature.}, archive = {J_EJOR}, author = {Abtin Nourmohammadzadeh and Stefan Voß}, doi = {10.1016/j.ejor.2025.06.018}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {390-406}, shortjournal = {Eur. J. Oper. Res.}, title = {A matheuristic approach for the robust coloured travelling salesman problem with multiple depots}, volume = {328}, year = {2026}, }
• (2026). Fifty years of research on resource-constrained project scheduling explored from different perspectives. EJOR, 328(2), 367-389. (www)

  @article{ , abstract = {The resource-constrained project scheduling problem is one of the most investigated problems in the project scheduling literature, and has a rich history. This article provides a perspective on this challenging scheduling problem, without having the ambition to provide a complete overview. Instead, the article does aim to summarize a number of reasons why this problem has been so intensely investigated from different perspectives. It will be shown that this scheduling problem has many faces, and therefore deserves a lot of research time from a computational and theoretical point of view as well as from a practical point of view. An overview of possible extensions to other problems and a detailed overview of the used (both heuristic and exact) solution methods will be given. In addition, the data used will be discussed and interesting avenues for further research will be mentioned throughout the different sections.}, archive = {J_EJOR}, author = {Christian Artigues and Sönke Hartmann and Mario Vanhoucke}, doi = {10.1016/j.ejor.2025.03.024}, journal = {European Journal of Operational Research}, month = {1}, number = {2}, pages = {367-389}, shortjournal = {Eur. J. Oper. Res.}, title = {Fifty years of research on resource-constrained project scheduling explored from different perspectives}, volume = {328}, year = {2026}, }

ESWA - 327

• (2026). GRAG-ProSafe QAS: Graph retrieval-augmented generation for process production safety intelligent question and answer system. ESWA, 298, 129947. (www)

  @article{ , abstract = {To address the frequent occurrence of safety accidents in process industries and the inadequacy of traditional safety management approaches in coping with complex risk scenarios, this study proposed an intelligent question answering system based on graph retrieval-augmented generation, named GRAG-ProSafe QAS. The system adopted a four-stage framework to extract structured knowledge from accident reports using Large Language Models and constructed a dynamic knowledge graph. This graph is utilized to support multi-hop retrieval and chain-of-thought reasoning strategies, thereby enhancing the trustworthiness of the generated responses. Taking 198 accident reports from the iron and steel industry as the dataset, the experiments demonstrated that the model achieved efficient structured knowledge extraction, and the constructed knowledge graph covers 1637 nodes with 2285 edges, which can provide semantic support for multi-hop causal reasoning. Ablation experiments validated the effectiveness of each core module in the system such as structured graph retrieval. In the multi-turn question answering scenario focused on explosion accidents, the system achieved strong overall performance, with a Faithfulness Score of 0.8684, Answer Relevancy of 0.8241, and Factual Correctness of 0.8050. The developed GRAG-ProSafe QAS realized the integration of knowledge extraction, graph construction and intelligent QA, which provides a feasible path for the intelligent management and control of safety risks in the process industry.}, archive = {J_ESWA}, author = {Jianrong Zhang and Wei Zhang and Qingwen Wei and Huayu Zhong and Yu Miao}, doi = {10.1016/j.eswa.2025.129947}, journal = {Expert Systems with Applications}, month = {3}, pages = {129947}, shortjournal = {Expert Syst. Appl.}, title = {GRAG-ProSafe QAS: Graph retrieval-augmented generation for process production safety intelligent question and answer system}, volume = {298}, year = {2026}, }
• (2026). Relevance-based adaptive differential private spiking neural networks. ESWA, 298, 129934. (www)

  @article{ , abstract = {Spiking Neural Networks (SNNs) have achieved widespread attention recently due to biological plausibility and ultra-low energy consumption. However, the training process of SNNs can potentially cause data privacy leaks. Attackers can use models to infer sensitive features of data, therefore, protecting sensitive information in training data is crucial. Differential Privacy (DP) is an effective method for protecting data privacy from attacks. The existing differential private SNN models are not satisfactory due to adding the same amount of noise to gradient parameters, which affects the trade-off between model utility and privacy protection. To address these issues, a Relevance-based Adaptive Differential Private SNN (RADP-SNN) framework is proposed, which dynamically perturbs gradients based on the relevance between input features and model outputs. It adjusts the Gaussian noise added to the gradients according to each neuron’s relevance to the model outputs. Additionally, based on the interpretability of the Layer-wise Relevance Propagation (LRP) algorithm, an SNNLRP algorithm is designed, which uses surrogate gradients to approximate the backpropagation of spiking neurons. It integrates the spikes and membrane potential information across time steps in SNNs. Then, the impact of Leaky-Integrated and Fire and Integrated and Fire neuron models on privacy protection is explored. Results show that the proposed framework can maintain high model performance while providing effective privacy assurance. RADP-SNN has broad potential applications in image, robot control, and scenarios requiring time series data processing.}, archive = {J_ESWA}, author = {Junxiu Liu and Xiwen Luo and Qiang Fu and Yuling Luo and Sheng Qin and Xue Ouyang}, doi = {10.1016/j.eswa.2025.129934}, journal = {Expert Systems with Applications}, month = {3}, pages = {129934}, shortjournal = {Expert Syst. Appl.}, title = {Relevance-based adaptive differential private spiking neural networks}, volume = {298}, year = {2026}, }
• (2026). EDPDet: Efficient dense pedestrian detectors with multi-scale feature extraction, enhancement and aggregation. ESWA, 298, 129933. (www)

  @article{ , abstract = {Pedestrian detection is one of the key tasks in the field of computer vision. However, in dense scenes, pedestrians may be confused with the background or obstructed to varying degrees, and factors such as shooting distance can affect the scale of pedestrians in images, increasing the difficulty of pedestrian detection tasks. To address these issues, we propose the efficient dense person detectors called EDPDet. On the one hand, we propose the Multi-scale Contour Feature Enhancement Module (MCFEM) with multi-scale feature extraction and contour feature enhancement, which can improve the network’s ability to perceive pedestrian objects at different scales and distinguish pedestrians from complex backgrounds. On the other hand, we propose the Efficient Cross-scale Path Aggregation Network (ECPAN) that realizes the integration of semantic information and spatial information among different feature layers of the network. Furthermore, we implemented the end-to-end deployment of the detectors using the non-maximum suppression-free (NMS-free) training strategy. Finally, we construct three detectors of different sizes, EDPDet-N, EDPDet-S and EDPDet-L. Our method achieves 91.4% and 92.5% AP on the CrowdHuman and WiderPerson datasets, respectively, demonstrating superior performance.}, archive = {J_ESWA}, author = {Yangxi Yu and Wentao Lyu and Qing Guo and Zhijiang Deng and Weiqiang Xu}, doi = {10.1016/j.eswa.2025.129933}, journal = {Expert Systems with Applications}, month = {3}, pages = {129933}, shortjournal = {Expert Syst. Appl.}, title = {EDPDet: Efficient dense pedestrian detectors with multi-scale feature extraction, enhancement and aggregation}, volume = {298}, year = {2026}, }
• (2026). SketchFormer3D: Generating 3D shapes from sketches with implicit SDF priors via diffusion models. ESWA, 298, 129931. (www)

  @article{ , abstract = {As an intuitive and highly efficient means of conveying information, sketches are widely used in three-dimensional design and modeling tasks. However, due to the highly abstract and visually sparse nature of sketches, directly reconstructing structurally clear and topologically sound 3D models from single-view sketches remains a significant challenge. Existing approaches often overlook the cross-modal semantic associations between sketches and 3D geometry and fail to effectively utilize prior knowledge of three-dimensional spatial geometry, resulting in deficiencies in the structural coherence and topological validity of the generated 3D models. To address these issues, we propose a 3D reconstruction method based on a Signed Distance Function (SDF) diffusion model, aiming to enhance the stability and accuracy of model generation through implicit geometric priors and cross-modal semantic information. Specifically, we first employ an SDF-based implicit neural network to construct high-quality geometric representations and capture spatial priors of target shapes; this component is then incorporated as a fixed module into the diffusion process, guiding the network to gradually recover accurate 3D structures from noise under sketch conditions. Meanwhile, we design a sketch-aware semantic encoding module and a cross-modal attention mechanism to deeply integrate sketch images with geometric priors, thereby strengthening the model’s ability to represent structural consistency and local details. Experimental results demonstrate that our method outperforms existing approaches across multiple sketch-based modeling datasets. In terms of quantitative metrics, compared to the latest method Doodle Your 3D, our Chamfer Distance (CD) decreases from 9.41 × 10 − 3 to 6.53 × 10 − 3 , the Earth Mover’s Distance (EMD) decreases from 10.68 × 10 − 2 to 7.59 × 10 − 2 , and the Voxel-IoU increases from 46.19 × 10 − 2 to 48.72 × 10 − 2 . These improvements further validate that our approach is capable of stably generating 3D mesh models that are both structurally coherent and geometrically precise.}, archive = {J_ESWA}, author = {Yang Ding and Huamin Yang and Cheng Han and Chao Zhang and Yu Liu}, doi = {10.1016/j.eswa.2025.129931}, journal = {Expert Systems with Applications}, month = {3}, pages = {129931}, shortjournal = {Expert Syst. Appl.}, title = {SketchFormer3D: Generating 3D shapes from sketches with implicit SDF priors via diffusion models}, volume = {298}, year = {2026}, }
• (2026). Modeling trust in human–Robot collaborative construction: An improved cloud bayesian network. ESWA, 298, 129928. (www)

  @article{ , abstract = {Trust developed by workers towards robotic systems is critical to the successful implementation of human-robot collaboration (HRC) in construction, directly influencing operational efficiency and safety outcomes. To accurately evaluate trust risks within HRC scenarios, this study proposes an integrated method combining an improved Cloud Model (CM) with Bayesian Networks (BNs) for dynamic trust risk analysis. Initially, key factors influencing trust risks in HRC were identified through literature review and expert elicitation. The improved CM was then employed to capture inherent uncertainties and fuzziness in trust state definitions, facilitating the discretization of continuous expert evaluations into appropriate risk states. Subsequently, the BN was developed to perform forward reasoning, sensitivity analysis, and backward diagnosis, enabling proactive trust risk prediction, critical factor identification, and targeted interventions. The primary contributions of this research include: (a) identifying 11 trust factors from human, organizational, and robotic perspectives, offering a comprehensive basis for analyzing HRC trust risk in construction; (b) employing an optimized cloud entropy approach to accurately capture fuzziness and randomness in expert evaluations, thereby producing robust prior probabilities; and (c) developing a hybrid CBN framework to assess HRC trust risk in construction, demonstrating superior performance in risk perception, analysis, and control. Overall, this study provides valuable insights into safer and more effective HRC through dynamic evaluation of trust risk.}, archive = {J_ESWA}, author = {Lei Wang and Mingyu Zhang and Heng Li and Yinong Hu and Jie Ma and Waleed Umer and Xin Fang}, doi = {10.1016/j.eswa.2025.129928}, journal = {Expert Systems with Applications}, month = {3}, pages = {129928}, shortjournal = {Expert Syst. Appl.}, title = {Modeling trust in human–Robot collaborative construction: An improved cloud bayesian network}, volume = {298}, year = {2026}, }
• (2026). Automated emotional design generation for NEV wheel hubs: Integrating StyleGAN2-ADA and WOA-SVR within kansei engineering. ESWA, 298, 129927. (www)

  @article{ , abstract = {Wheel hub design is significant in the New Energy Vehicle’s (NEV) aesthetics and user emotional connection. However, the existing design process faces two main challenges: traditional concept methods suffer from efficiency bottlenecks, and designers’ subjective judgments make it difficult to capture users’ emotional preferences. Recently, Generative Adversarial Networks (GANs) have been introduced to industrial design. However, conventional GAN-based methods typically require large-scale datasets to achieve high-quality design generation, which limits their applicability in vertical product domains where data are scarce. To overcome these challenges, this paper proposes an emotional design generation approach for NEV wheel hubs by combining StyleGAN2 with Adaptive Discriminator Augmentation (StyleGAN2-ADA) and Whale Optimisation Algorithm-Support Vector Regression (WOA-SVR). First, the StyleGAN2-ADA is trained on a limited NEV wheel hub dataset to achieve automated design generation. Second, Ward hierarchical clustering dentifies representative samples, while morphological analysis deconstructs design features. Subsequently, Factor Analysis (FA) categorises Kansei words to extract principal emotions. After collecting users’ emotional ratings of wheel hubs, WOA-SVR constructs a “design features-emotional needs” mapping model. Finally, the generated images are used to validate the implementation of the generation and prediction models. The case study demonstrates that the proposed method not only generates diverse design alternatives aligned with users’ emotional preferences but also provides reliable predictions of their emotional responses, thereby systematically improving the NEV wheel hub design process while preserving its emotional impact.}, archive = {J_ESWA}, author = {Yi Wang and Meiyu Zhou and Zhengyu Wang and Weilin Cai and Xin Sun and Huijuan Zhu}, doi = {10.1016/j.eswa.2025.129927}, journal = {Expert Systems with Applications}, month = {3}, pages = {129927}, shortjournal = {Expert Syst. Appl.}, title = {Automated emotional design generation for NEV wheel hubs: Integrating StyleGAN2-ADA and WOA-SVR within kansei engineering}, volume = {298}, year = {2026}, }
• (2026). DiffAD: Diffusion augmentation for influenza virus antigenic distance prediction. ESWA, 298, 129925. (www)

  @article{ , abstract = {Continuous monitoring of the antigenic phenotypes of circulating influenza viruses is essential for both vaccine evaluation and development. However, traditional serology-based methods for antigenicity assessment, such as hemagglutination inhibition assays, are inherently low-throughput and labor-intensive. As a result, the available antigenicity data remain sparse and limited, posing a significant challenge to the development of accurate and scalable computational models. To address this, we have curated a influenza antigenicity dataset from authoritative sources and propose DiffAD, a novel diffusion-based data augmentation framework for antigenic distance prediction to enhance data availability and model performance. DiffAD introduces a forward noising process and a timestep-aware reverse denoising network incorporating pre-normalized residual blocks to enable precise noise estimation across diffusion steps. This design facilitates the generation of biologically plausible HA feature vectors that introduce meaningful variability and augment existing datasets. These augmented data are then used to enhance the accuracy of antigenic distance estimation between viral strains. Experimental results on four influenza subtypes (H1N1, H3N2, B/Victoria, and B/Yamagata), using two widely adopted antigenic distance metrics. Experimental results show that DiffAD significantly outperforms existing methods, reducing the MAE to 0.6402 and 0.6795, and increasing the R 2 to 0.7412 and 0.6969 on the H1N1 and H3N2 datasets, respectively, using the SLT-based distance metric. Furthermore, visualization analysis reveals that the low-dimensional embeddings of virus strains exhibit clear clustering patterns, and the synthetic strains generated by DiffAD closely align with original antigenic clusters. These findings demonstrate that DiffAD not only improves prediction performance but also learns biologically meaningful characteristics of viral strains.}, archive = {J_ESWA}, author = {Qingbo Liu and Yuanling Xia and Yanbu Guo and Weihua Li}, doi = {10.1016/j.eswa.2025.129925}, journal = {Expert Systems with Applications}, month = {3}, pages = {129925}, shortjournal = {Expert Syst. Appl.}, title = {DiffAD: Diffusion augmentation for influenza virus antigenic distance prediction}, volume = {298}, year = {2026}, }
• (2026). Learning to select cutting planes in mixed integer linear programming solving. ESWA, 298, 129924. (www)

  @article{ , abstract = {Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for cut selection, which require extensive expert knowledge and cannot be generalized to MILP problems with varying instance sizes across different domains. Therefore, learning-based methods for cut selection are considered a promising direction. State-of-the-art learning-based methods formulate cut selection as a sequence-to-sequence problem, easily handled by sequence models. However, the existing sequence models need help with the following issues: (1) the model only captures cut information while neglecting the Linear Programming (LP) relaxation; (2) the sequence model utilizes positional information of the input sequence, which may influence cut selection. To address these challenges, we design a novel model HGTSM for better cut selection. We encode MILP problem state as a heterogeneous tripartite graph, utilizing heterogeneous graph networks to fully capture the underlying structure of MILP problems. Simultaneously, we propose a novel sequence model whose architecture is tailored to handle inputs in different orders. Experimental results demonstrate that our model outperforms heuristic methods and learning-based baselines on multiple challenging MILP datasets. The code of HGTSM can be found at https://github.com/aqi007/Learn2Cut-HGTSM.}, archive = {J_ESWA}, author = {Xuefeng Zhang and Liangyu Chen and Zhengfeng Yang and Zhenbing Zeng}, doi = {10.1016/j.eswa.2025.129924}, journal = {Expert Systems with Applications}, month = {3}, pages = {129924}, shortjournal = {Expert Syst. Appl.}, title = {Learning to select cutting planes in mixed integer linear programming solving}, volume = {298}, year = {2026}, }
• (2026). A machine learning-based medical device recall initiator prediction framework: From supply chain risk management and resilience view. ESWA, 298, 129922. (www)

  @article{ , abstract = {Persistent quality problems with medical devices and the associated recall present potential health risks to users, bringing extra costs and disturbances to the supply chain. Classical medical device recall strategy neglects the significance of the failure detection process in the premarket phase, increasing the medical device recall risks. This research first established the theoretical foundation for the medical device recall reasons detection problem by reconstructing the medical device recall strategy from the supply chain risk and resilience view and reinforced the importance of failure detection and quality inspection work in the premarket stage. Moreover, existing medical device failure reason prediction research was limited in practicality and scalability. To address this problem, we developed a machine learning-based medical device recall initiator prediction system framework to conduct proactive failure detection based on the industrial case. By redesigning in dataset, clustering method and input feature selection, an accuracy rate of 88.85% is achieved, which indicates the potential of the proposed framework in assisting manufacturers with asset predictive failure detection for reducing recall. A comparative analysis of prediction performance between our framework and the most similar research that utilized the same prediction algorithms was presented. The comparison results showed that our distinctive design in the dataset, clustering method, and key input features chosen are valid and efficient. Before redesigning the prediction algorithms that require higher technical investment, our elaborate research design in selecting the dataset, cluster method, and key input features can be the antecedents of better prediction performance for manufacturers. The proposed predictive framework obtains higher accuracy, scalability, practicality, with accessibility.}, archive = {J_ESWA}, author = {Yang Hu and Davy Monticolo and Pezhman Ghadimi}, doi = {10.1016/j.eswa.2025.129922}, journal = {Expert Systems with Applications}, month = {3}, pages = {129922}, shortjournal = {Expert Syst. Appl.}, title = {A machine learning-based medical device recall initiator prediction framework: From supply chain risk management and resilience view}, volume = {298}, year = {2026}, }
• (2026). Predicting last-mile delivery route deviations using machine learning. ESWA, 298, 129921. (www)

  @article{ , abstract = {Route planning in last-mile delivery is a complex task with many challenges, directly impacting delivery efficiency and costs. Drivers often deviate from optimized planned routes based on their knowledge. Using the properties of machine learning, this study aims to determine whether machine learning techniques can effectively predict deviations by drivers from planned routes and quantify the extent of such deviations. We propose to predict route deviations by analyzing a logistics company’s historical data of planned and actual routes using deep neural networks, with the dataset made publicly available. Our methodology incorporates both regression and classification models. The regression model estimates the degree of deviation, while the classification model aims to predict whether the deviation from a planned route will exceed a given threshold, based on different deviation metrics. As the input, we leverage the sequential structure of the route with route properties and drivers information. The computational experiments explore extending the given input to the models and testing various state-of-art neural network architectures. Our results demonstrate strong performance on both tasks, with our models achieving 9 − 19 % improvements in regression metrics and 3 − 15 % improvements in classification metrics compared to specified benchmarks, with statistical tests confirming the significance of these improvements.}, archive = {J_ESWA}, author = {Anna Konovalenko and Lars Magnus Hvattum and Kim Aleksander Hammer Iversen}, doi = {10.1016/j.eswa.2025.129921}, journal = {Expert Systems with Applications}, month = {3}, pages = {129921}, shortjournal = {Expert Syst. Appl.}, title = {Predicting last-mile delivery route deviations using machine learning}, volume = {298}, year = {2026}, }
• (2026). PDHG: An ethereum phishing detection approach via heterogeneous graph transformer. ESWA, 298, 129919. (www)

  @article{ , abstract = {Phishing scams have emerged as a significant threat within the Ethereum ecosystem. Cutting-edge Ethereum phishing scams detection techniques mostly treat accounts in Ethereum as homogeneous nodes in transaction graphs. Existing detection approaches model Ethereum transaction records as homogeneous transaction graphs and use graph representation learning for account classification. However, those approaches often overlook the heterogeneity between accounts and transactions, making it difficult to capture the diversity of interactions and features among accounts. In this paper, a heterogeneous graph transformer (HGT)-based phishing account identification approach called PDHG is proposed. Specifically, PDHG models the transaction network between accounts as a heterogeneous graph based on different attributes of Ethereum accounts, allowing for a more comprehensive description of the structure and behavioral patterns of the transaction network. To enhance the explainability, PDHG leverages PDHGexplainer as the explainer for the detection results. We compare PDHG with other existing detection models. The experimental results demonstrate that PDHG achieves an AUC score of 96.04 % and a recall score of 89.87 %, surpassing the state-of-the-art approaches.}, archive = {J_ESWA}, author = {Lei Wang and Yihan Mi and Yanan Zhang and Jialin Zhang}, doi = {10.1016/j.eswa.2025.129919}, journal = {Expert Systems with Applications}, month = {3}, pages = {129919}, shortjournal = {Expert Syst. Appl.}, title = {PDHG: An ethereum phishing detection approach via heterogeneous graph transformer}, volume = {298}, year = {2026}, }
• (2026). Multi-graph fusion guided robust adaptive learning for subspace clustering. ESWA, 298, 129918. (www)

  @article{ , abstract = {Subspace clustering is an advanced technique that identifies clusters embedded within a union of low-dimensional subspaces of the original data space, thereby revealing its intrinsic structure. Spectral clustering-based methods have gained significant attention in computer vision, image processing and pattern recognition due to their promising performance. However, existing approaches, which typically rely on self-representation for representation coefficient learning, often lack robustness and struggle to comprehensively characterize complex data structures. Traditional reconstruction loss based on the Frobenius or ℓ 1 norm are susceptible to noise and outliers. Furthermore, many methods underutilize inherent data characteristics for capturing local geometric structures and adapting to intricate data relationships. To address these limitations, this paper proposes a novel subspace clustering approach, named Multi-graph Fusion Guided Robust Adaptive Learning (MFGRAL), which integrates robust adaptive representation and multi-graph fusion within a unified framework. Specifically, a non-convex logarithmic loss function is adopted to enhance robustness against noise and outliers. To better preserve local manifold structures, a multi-graph fusion strategy is developed to guide the adaptive graph learning process. This facilitates the learning of more discriminative low-dimensional embeddings and enhances the capacity to capture complex neighborhood relationships. An effective and efficient optimization algorithm based on Alternating Direction Method of Multipliers (ADMM) is developed to solve the proposed model. Extensive experimental results on several benchmark datasets demonstrate the effectiveness of the proposed MFGRAL and its superiority over state-of-the-art methods.}, archive = {J_ESWA}, author = {Jianyu Miao and Xiaochan Zhang and Chao Fan and Tiejun Yang and Yingjie Tian and Yong Shi and Mingliang Xu}, doi = {10.1016/j.eswa.2025.129918}, journal = {Expert Systems with Applications}, month = {3}, pages = {129918}, shortjournal = {Expert Syst. Appl.}, title = {Multi-graph fusion guided robust adaptive learning for subspace clustering}, volume = {298}, year = {2026}, }
• (2026). Enhancing storage efficiency for cloud-based vehicle data based on advanced lossless compression algorithm. ESWA, 298, 129917. (www)

  @article{ , abstract = {Cloud-based vehicle data is being produced in various forms at an unparalleled speed, which requires efficient compression mechanisms to better store, transmit and process such data. In this article, we devise a novel, hybrid, adaptation-enabled framework, RTLAE, built on a neural network (NN) predictor and an adaptive arithmetic coding (AC) encoder, which enables outstanding lossless compression performance on non-stationary (unanticipated contextual changes) or randomly mixed vehicle datasets without requiring any domain-specific prior knowledge (lacking optimal hyperparameter settings). This framework integrates a tailor-made redundancy reduction filter, a temporal convolutional network, a long short-term memory network, and a multi-order adaptive arithmetic encoder to preprocess data sequences, generate accurate estimations, and learn optimal character encoding. Validation results on real-life datasets indicate that the proposed framework has achieved quite superior results on various datasets, with an average performance improvement of about 26%, 46%, 27%, and 12% over AC, Gzip, block-sorting compression algorithm, and DeepZip, respectively, and with a runtime cost that is slightly better than other NN-based compressors. This work emphasizes the potential of NNs and combinatorial modeling to improve general-purpose compressors, and highlights the research prospect of resource utilization of big data platforms based on vehicle-cloud collaborative interconnection.}, archive = {J_ESWA}, author = {Zheng Yifan and Cao Rui and Liu Chaohui and Liu Qixing and Luo Zixuan and Yang Dong and Zhang Kun and Zhou Sida and Yang Shichun}, doi = {10.1016/j.eswa.2025.129917}, journal = {Expert Systems with Applications}, month = {3}, pages = {129917}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing storage efficiency for cloud-based vehicle data based on advanced lossless compression algorithm}, volume = {298}, year = {2026}, }
• (2026). Complex forecasting and investment strategy optimization via chain-of-thought of large language models. ESWA, 298, 129913. (www)

  @article{ , abstract = {This paper pioneers the application of chain-of-thought (CoT) prompting in large language models (LLMs) for financial forecasting and portfolio optimization. Leveraging anonymized financial statements from 608 Chinese A-share listed companies (2010–2023), we benchmark ChatGPT 4.0 against human analysts in earnings direction prediction. The CoT-enhanced model achieved superior accuracy (64.35% vs. 58.37%) and generated a 17.14% alpha with a Sharpe ratio of 1.5959 in backtests, demonstrating LLMs’ capacity to automate financial reasoning while reducing reliance on specialized expertise. Our findings bridge AI and quantitative finance by validating LLMs’ cross-domain adaptability using purely numerical data, offering practical implications for AI-driven investment decision systems.}, archive = {J_ESWA}, author = {Meiqun Yin and Mengzhu Guo}, doi = {10.1016/j.eswa.2025.129913}, journal = {Expert Systems with Applications}, month = {3}, pages = {129913}, shortjournal = {Expert Syst. Appl.}, title = {Complex forecasting and investment strategy optimization via chain-of-thought of large language models}, volume = {298}, year = {2026}, }
• (2026). KMHBO: A knowledge-guided multi-niche hybrid breeding optimization algorithm for high-dimensional multimodal feature selection. ESWA, 298, 129911. (www)

  @article{ , abstract = {Multimodal feature selection aims to identify multiple feature subsets with similar discriminative capabilities, providing diverse and interchangeable solutions for intelligent decision-making. However, most existing multimodal feature selection methods based on metaheuristic algorithms are designed for low or medium dimensional data, and their search efficiency significantly degrades in high-dimensional spaces. To address this challenge, we propose a knowledge-guided multi-niche hybrid breeding optimization algorithm (KMHBO) with dual dynamic grouping, which enhances both solution diversity and overall search performance. KMHBO introduces a two-level dynamic grouping mechanism: at the outer level, a dual similarity-guided niche partitioning strategy adaptively adjusts the size and distribution of each niche to improve the global exploration; at the inner level, the population is divided into three subpopulations based on historical evolutionary behaviors, namely the maintainer, the restorer, and the sterile. Each subpopulation is assigned specific search tasks to strengthen the local exploitation and increase structural diversity among solutions. Additionally, a mutation mechanism based on feature selection frequency is introduced to promote information exchange between niches, while an improved external archive updating mechanism ensures the preservation of diverse equivalent solutions. Extensive experiments on ten high-dimensional benchmark datasets demonstrate that KMHBO significantly outperforms state-of-the-art methods in terms of classification accuracy. Notably, KMHBO achieves 100% classification accuracy on the ALLAML and GLI_85 datasets and identifies nearly 50 structurally distinct yet functionally equivalent feature subsets under a fixed archive size, showcasing its superior performance and strong potential in high-dimensional multimodal feature selection tasks.}, archive = {J_ESWA}, author = {Zhiwei Ye and Ying Zeng and Ting Cai and Jun Shen and Wen Zhou and Qiyi He and Mengqing Mei and Yi Cen}, doi = {10.1016/j.eswa.2025.129911}, journal = {Expert Systems with Applications}, month = {3}, pages = {129911}, shortjournal = {Expert Syst. Appl.}, title = {KMHBO: A knowledge-guided multi-niche hybrid breeding optimization algorithm for high-dimensional multimodal feature selection}, volume = {298}, year = {2026}, }
• (2026). A fault-tolerant task offloading framework via large-scale multi-objective evolutionary optimization and game-based decision mechanism. ESWA, 298, 129910. (www)

  @article{ , abstract = {Large-scale multi-access edge computing (MEC) optimization is challenging due to high-dimensional decision spaces, conflicting objectives, nonstationary conditions, and failure-prone infrastructure. This paper presents an adaptive Mahalanobis distance-based large-scale multi-objective evolutionary algorithm with knowledge transfer and a two-layer encoding ( ALC-LSMOEA-KT ). The task-offloading model optimizes latency, energy, load balance, and failure risk under communication and computation constraints. A two-layer sparse encoding separates variable activation from value search, and a phase-aware evolution with Mahalanobis-guided covariance adaptation exploits inter-variable correlations while preserving diversity. A Stackelberg-based fault-tolerant migration module reassigns disrupted tasks to sustain robustness. Experiments on scalable multi-objective optimization Problems(SMOP)/large-scale multi-objective optimization problem(LSMOP) benchmarks and a realistic MEC simulator with dynamic arrivals, bandwidth variation, and injected failures show consistent gains in inverted generational distance (IGD), solution diversity, and robustness. The results indicate a scalable and reliable approach to MEC optimization under high dimensionality and uncertainty.}, archive = {J_ESWA}, author = {Tingting Dong and Jinbu Wen and Fei Xue and Yuge Geng and Xingjuan Cai}, doi = {10.1016/j.eswa.2025.129910}, journal = {Expert Systems with Applications}, month = {3}, pages = {129910}, shortjournal = {Expert Syst. Appl.}, title = {A fault-tolerant task offloading framework via large-scale multi-objective evolutionary optimization and game-based decision mechanism}, volume = {298}, year = {2026}, }
• (2026). A computational learning pipeline for glaucoma progression detection based on the prediction of visual field changes from fundus photographs. ESWA, 298, 129907. (www)

  @article{ , abstract = {Detection of glaucoma progression is crucial to managing patients, permitting individualized care plans and treatment. It is a challenging task requiring the assessment of structural changes to the optic nerve head and functional changes based on visual field testing. Artificial intelligence, especially deep learning techniques, has shown promising results in many applications, including glaucoma diagnosis. This paper proposes a two-stage computational learning pipeline for detecting glaucoma progression using only fundus photographs. In the first stage, a deep learning model takes a time series of fundus photographs as input and outputs a vector of predictions where each element represents the overall rate of change in visual field (VF) sensitivity values for a sector (region) of the optic nerve head (ONH). We implemented two deep learning models—ResNet50 and InceptionResNetV2—for this stage. In the second stage, a binary classifier (weighted logistic regression) takes the predicted vector as input to detect progression. We also propose a novel method for constructing annotated datasets from temporal sequences of clinical fundus photographs and corresponding VF data suitable for machine learning. Each dataset element comprises a temporal sequence of photographs together with a vector-valued label. The label is derived by computing the pointwise linear regression of VF sensitivity values at each VF test location, mapping these locations to eight ONH sectors, and assigning the overall rate of change in each sector to one of the elements of the vector. We used a retrospective clinical dataset with 82 patients collected at multiple timepoints over five years in our experiments. The InceptionResNetV2-based implementation yielded the best performance, achieving detection accuracies of 97.28 ± 1.10 % for unseen test data (i.e., each dataset element is unseen but originates from the same set of patients appearing in the training dataset), and 87.50 ± 0.70 % for test data from unseen patients (training and testing patients are entirely different). The testing throughput was 11.60 ms per patient. These results demonstrate the efficacy of the proposed method for detecting glaucoma progression from fundus photographs.}, archive = {J_ESWA}, author = {Md.Reduanul Haque and Andrew Mehnert and William Huxley Morgan and Graham Mann and Ferdous Sohel}, doi = {10.1016/j.eswa.2025.129907}, journal = {Expert Systems with Applications}, month = {3}, pages = {129907}, shortjournal = {Expert Syst. Appl.}, title = {A computational learning pipeline for glaucoma progression detection based on the prediction of visual field changes from fundus photographs}, volume = {298}, year = {2026}, }
• (2026). Symmetric difference consistent semi-supervised brain stroke lesion segmentation with uncertainty guidance. ESWA, 298, 129900. (www)

  @article{ , abstract = {The sudden onset of stroke is a leading cause of death and disability worldwide. Automatic segmentation of stroke lesions is crucial for the timely formulation of clinical treatment strategies. However, the extensive variations in size, shape, and intensity of stroke lesions present significant challenges for precise segmentation, particularly in the absence of a large set of meticulously annotated data for model training. In this paper, we propose a symmetric difference consistent semi-supervised learning method (SDC-SSL) to leverage readily available unlabeled data for stroke lesion segmentation. We first design a symmetric difference network (SD-Net) that incorporates anatomical symmetry priors, with two key modules: difference awareness extraction (DAE) and symmetric feature fusion (SFF), to accurately segment diverse lesions. Specifically, DAE extracts more discriminative features by exploring multi-scale bilateral differences, while SFF adaptively integrates symmetric features enriched with salient pathological information. To excavate meaningful representations from unlabeled data, SD-Net is then embedded into a novel dual-level consistency mean teacher framework, where uncertainty estimation progressively guides the student in acquiring reliable knowledge from the teacher. In addition to pixel-level consistency regularization, we introduce a difference-aware attention consistency loss at feature level to capture robust semantic information. Finally, we specifically develop pseudo-labels driven symmetric contrastive learning to amplify bilateral differences caused by stroke lesions, further enhancing semi-supervised segmentation. Experimental results show that our SDC-SSL consistently outperforms state-of-the-art semi-supervised methods and achieves performance comparable to fully-supervised approaches with only 20% of labeled data, highlighting its potential clinical value in reducing reliance on extensive data annotation.}, archive = {J_ESWA}, author = {Yongliang Zhang and Wei Wang and Lei Li and Qi Wu and Haoquan Sun and Ao Li and Minghui Wang and Feng Gao}, doi = {10.1016/j.eswa.2025.129900}, journal = {Expert Systems with Applications}, month = {3}, pages = {129900}, shortjournal = {Expert Syst. Appl.}, title = {Symmetric difference consistent semi-supervised brain stroke lesion segmentation with uncertainty guidance}, volume = {298}, year = {2026}, }
• (2026). Operator learning-based springback behavior prediction for complex-shaped tube free-bending forming. ESWA, 298, 129899. (www)

  @article{ , abstract = {Free-bending (FB) technology enables the efficient processing of spatially complex-shaped tubes. Springback causes variations in curvature and torsion of the tube axis during the FB process. The mapping relationship of bent tube curvature and torsion from ideal to actual values can be abstracted as nonlinear physical operators. This paper first proposes a novel six-axis FB processing method that can control geometric features of tube transition segments. Then, an operator learning-based springback behavior prediction (OL-SBP) framework is presented, which includes an OL module and an SBP module. A feature-information-enhanced deep operator network (FIE-DeepONet) is integrated into the first module to learn tube springback operators. The curvature and torsion predicted by the OL module are then fed into the SBP module to calculate the overall shape of the springback axis. This paper also introduces a set of similarity evaluation indicators that are independent of the curve’s spatial attitude. Planar and spatial bent tubes are selected as case studies. Results show that the framework yields more accurate predictions compared to the analytical model. The framework also exhibits excellent generalization performance. Once FIE-DeepONet has learned the springback operators, it can accurately predict the springback curvature and torsion, even for tube shapes not present during training.}, archive = {J_ESWA}, author = {Yongzhe Xiang and Zili Wang and Shuyou Zhang and Le Wang and Caicheng Wang and Yaochen Lin and Jianrong Tan}, doi = {10.1016/j.eswa.2025.129899}, journal = {Expert Systems with Applications}, month = {3}, pages = {129899}, shortjournal = {Expert Syst. Appl.}, title = {Operator learning-based springback behavior prediction for complex-shaped tube free-bending forming}, volume = {298}, year = {2026}, }
• (2026). A multi-label chest X-ray image classification agorithm based on multi-scale and attribute-aware semantic graph. ESWA, 298, 129898. (www)

  @article{ , abstract = {Multi-label Chest X-Ray classification is crucial for intelligent diagnosis, yet existing algorithms usually ignore lesion-scale heterogeneity and attribute-conditioned label dependencies, limiting their clinical generalizability. To address these issues, this paper proposes MSASG, a multi-label Chest X-Ray image classification algorithm based on Multi-Scale and Attribute-aware Semantic Graph which enhances discriminative power and semantic consistency. Firstly, a Multi-scale Feature Partitioning and Reconstruction method is proposed to capture lesion patterns at different scales. Secondly, a Label-guided Multi-scale Semantic Alignment method is proposed to improve visual-semantic alignment by integrating label embeddings into feature extraction and using a Transformer to model high-order cross-modal dependencies. Finally, an Attribute-aware Graph Convolutional Network method is proposed to construct attribute-specific label co-occurrence matrices and dynamically select relevant structures during inference, enabling personalized characterization of label dependencies. Experiments on ChestX-ray14 and CheXpert show that MSASG outperforms state-of-the-art methods in recognizing complex lesion co-occurrence and adapting to heterogeneous populations.}, archive = {J_ESWA}, author = {Qian Wang and Zhijuan Wu and Jiyu Gao and Hongnian Yu and Yongqiang Cheng}, doi = {10.1016/j.eswa.2025.129898}, journal = {Expert Systems with Applications}, month = {3}, pages = {129898}, shortjournal = {Expert Syst. Appl.}, title = {A multi-label chest X-ray image classification agorithm based on multi-scale and attribute-aware semantic graph}, volume = {298}, year = {2026}, }
• (2026). ABE-mamba: Few-shot medical image segmentation via adversarial bidirectional enhanced mamba. ESWA, 298, 129897. (www)

  @article{ , abstract = {Traditional Few-Shot Medical Image Segmentation (FSMIS) methods primarily focus on mining information from support image to guide query image segmentation, while insufficiently exploring the contextual information within the query image itself. Due to significant anatomical variability and differences in imaging conditions, the targets in support and query images may exhibit substantial discrepancies, even within the same class. Consequently, inadequate utilization of query context limits the model’s ability to adapt to intra-class variations, reducing its generalization capability. To address this issue, inspired by Mamba’s capacity for context modeling with linear complexity, we propose ABE-Mamba, a novel query-focused FSMIS framework. ABE-Mamba enhances the model’s adaptability to intra-class variations by effectively mining the query image’s contextual information, and introduces an adversarial training mechanism to improve high-order consistency between the predicted mask and the ground truth. Firstly, a Bidirectional Enhanced Mamba module is introduced into the generator to fully mine the rich semantics in query images by facilitating bidirectional enhancement of both local and global context. Secondly, a cross 2D Selective Scan (cross-SS2D) block is designed and incorporated into the discriminator to improve its capability in distinguishing subtle differences between real and generated masks, thereby enhancing the alignment between predicted masks and ground truths. Thirdly, a pyramid structure is integrated into the generator to facilitate multi-scale feature extraction, thereby improving robustness to objects of varying sizes. Extensive experiments on four widely used datasets (Syn-CT, CHAOS-MRI, Card-MRI, and P-MRI) demonstrate that ABE-Mamba achieves competitive performance.}, archive = {J_ESWA}, author = {Bingjie Guo and Wenhui Huang and Xiaoyan Wang}, doi = {10.1016/j.eswa.2025.129897}, journal = {Expert Systems with Applications}, month = {3}, pages = {129897}, shortjournal = {Expert Syst. Appl.}, title = {ABE-mamba: Few-shot medical image segmentation via adversarial bidirectional enhanced mamba}, volume = {298}, year = {2026}, }
• (2026). Exact reliability of cold chain networks with multi-state travel time and transport capacity. ESWA, 298, 129892. (www)

  @article{ , abstract = {Post-pandemic lifestyle changes have increased reliance on e-commerce, boosting the logistics sector. One of the most highly regarded industries is cold chain logistics, especially for vaccines and refrigerated foods. In cold chain networks, transport routes have varying capacities based on customer orders, and travel times fluctuate due to traffic and weather. Thus, this study focuses on evaluating network reliability, i.e., the probability to meet given demands within the specified time threshold, of cold chain networks considering the two multi-state factors: travel time and transport capacity. To account for practical situations, a multi-state cold chain network (MCCN) is constructed with retailers, third-party logistics companies, and suppliers as nodes, and transportation routes as arcs. The concept of minimal path is used to determine the transport flow that complies with the time threshold and to determine the transport capacity vectors that satisfy the demands. An algorithm is proposed to resolve different characteristics of time thresholds and demand requirements for efficient assessment. Network reliability is successfully calculated, as shown in the case and sensitivity analysis. This allows managers to grasp the performance of MCCN and make informed decisions based on the achieved network reliability.}, archive = {J_ESWA}, author = {Thi-Phuong Nguyen and Chin-Lung Huang and Louis Cheng-Lu Yeng and Yi-Kuei Lin}, doi = {10.1016/j.eswa.2025.129892}, journal = {Expert Systems with Applications}, month = {3}, pages = {129892}, shortjournal = {Expert Syst. Appl.}, title = {Exact reliability of cold chain networks with multi-state travel time and transport capacity}, volume = {298}, year = {2026}, }
• (2026). Dual-tensor collaborative facilitation for multi-view clustering. ESWA, 298, 129883. (www)

  @article{ , abstract = {In multi-view clustering methods, tensor is often used to capture higher-order information among multi-view data and characterize the feature space structure of the original data. In this paper, we propose the D ual- T ensor C ollaborative F acilitation for M ulti- V iew C lustering approach. DTCF-MVC collaboratively facilitates the multi-view representation tensor through the original data projection tensor, and then finally obtains the multi-view optimal representation through rank-based adaptive weighted fusion. Secondly we design new solutions for tensor rank and tensor sparsity respectively. Therefore, we design a new tensor projection norm to handle the projection tensor. In addition, since there may be large differences between multi-view features, we design a new Weighted Arctangent Coupled tensor nuclear norm. This enables weighted arctangent coupling of singular values of different sizes in the tensor-singular value decomposition, which adequately approximates the true rank of the singular value matrix generated by the representation tensor in the frequency domain decomposition. The superiority of the proposed method is demonstrated by extensive experiments on different datasets.}, archive = {J_ESWA}, author = {Jie Zhang and Xiaoqian Zhang and Yongyi Yang and Jinghao Li and Zhenwen Ren and Rong Tang and Dong Wang}, doi = {10.1016/j.eswa.2025.129883}, journal = {Expert Systems with Applications}, month = {3}, pages = {129883}, shortjournal = {Expert Syst. Appl.}, title = {Dual-tensor collaborative facilitation for multi-view clustering}, volume = {298}, year = {2026}, }
• (2026). PFL-TEnet: Personalized federated learning for wind power forecasting via time-series embedding and hypernetwork modeling. ESWA, 298, 129881. (www)

  @article{ , abstract = {As wind power occupies an increasingly important position in the global energy structure, improving its power prediction accuracy has become the key to guarantee the stable operation of the power system and the efficient consumption of new energy. However, wind energy is driven by complex nonlinear meteorological factors, exhibiting significant time series dependency and heterogeneity among wind farms, while also facing practical requirements for data privacy protection. These factors present numerous challenges for personalized modeling across multiple wind farms. To address these challenges, this paper proposes a personalized federated learning model, PFL-TEnet, which utilizes time-series embedding network to extract critical temporal features and dynamically generates personalized model parameters through hypernetwork. Under the premise of protecting data privacy, this model balances personalized adaptability and generalization capability. Experimental results demonstrate that the proposed method significantly outperforms existing mainstream methods on multiple real wind farm datasets and demonstrates notable advantages in prediction accuracy and personalized performance.}, archive = {J_ESWA}, author = {Yi Li and Chenguang Zhang and Yan Zhang and Jianming Hu}, doi = {10.1016/j.eswa.2025.129881}, journal = {Expert Systems with Applications}, month = {3}, pages = {129881}, shortjournal = {Expert Syst. Appl.}, title = {PFL-TEnet: Personalized federated learning for wind power forecasting via time-series embedding and hypernetwork modeling}, volume = {298}, year = {2026}, }
• (2026). Edge-guided semi-supervised 6D pose estimation with cross-domain alignment for robotic grasping. ESWA, 298, 129880. (www)

  @article{ , abstract = {Accurately estimating 6D poses of objects is crucial for robotic grasping, and existing pose estimation methods generally require large amount of labeled data from same domain, which is difficult for real-world cases. Although some feature transfer methods have been proposed, the gap between source and target scenes still exists. To solve these limitations, we construct a virtual environment with scanned object models and further propose a novel edge-guided semi-supervised 6D pose estimation approach for robotic grasping, where labeled virtual images and unlabeled real images are required, substantially reducing reliance on annotated real data. The designed edge guidance module is able to highlight fine-grained edges of objects and weaken their surface textures, effectively mitigating negative transfer. In addition, a simple yet effective domain mixture mechanism is introduced to align pose-specific features of virtual and real domains from implicit and explicit perspectives, facilitating smoother feature alignment transitions. Comparative experiments are extensively conducted on two pairs of datasets, and the results indicate that the proposed method outperforms other approaches and transfer strategies by 4.1 % and 7.2 %, respectively. The real-world pose estimation and robotic grasping experiments also prove its effectiveness in diverse scenarios.}, archive = {J_ESWA}, author = {Lu Chen and Jiajie Wen and Yan Gao and Jing Yang and Chao Zhang and Shan An and Peng Wu}, doi = {10.1016/j.eswa.2025.129880}, journal = {Expert Systems with Applications}, month = {3}, pages = {129880}, shortjournal = {Expert Syst. Appl.}, title = {Edge-guided semi-supervised 6D pose estimation with cross-domain alignment for robotic grasping}, volume = {298}, year = {2026}, }
• (2026). Multi-source multi-label feature selection with missing features. ESWA, 298, 129879. (www)

  @article{ , abstract = {Feature dimensionality reduction on Multi-Source Multi-Label (MSML) data is a critical and challenging task. Because practical situations always produce massive MSML data, but they usually contain more missing feature values in the high-dimensional feature space and present severely skewed label distributions in the multi-label space, which aggravate the difficulties in the tackling of high-dimensional feature selection on MSML data. However, much attention in feature selection has been directed either toward multi-label data or multi-source data, while little attention is focused on MSML data, not to mention those containing missing features. Motivated by this, we present a new feature selection method for MSML data with missing features, called MMFSMF. Specifically, to overcome the issue of feature missing, we first supplement the feature matrix by constructing a feature correlation matrix during the modeling process of multi-label learning. At the meanwhile, we utilize a multi-label oversampling mechanism to address the persistent problem of label skewness in multi-label data. Secondly, in terms of the above processing, we introduce a refined infinite feature selection algorithm to perform feature dimensionality reduction in each multi-label data source, considering both label correlations and label-specific features. Thirdly, to address feature redundancy among multiple data sources, we apply a new inter-source feature fusion method. Finally, experiments conducted on nine synthetic MSML datasets with missing features demonstrate that MMFSMF achieves superior performances compared to all competing ones.}, archive = {J_ESWA}, author = {Yabo Shi and Peipei Li and Xiulan Yuan and You Wu and Haiping Wang}, doi = {10.1016/j.eswa.2025.129879}, journal = {Expert Systems with Applications}, month = {3}, pages = {129879}, shortjournal = {Expert Syst. Appl.}, title = {Multi-source multi-label feature selection with missing features}, volume = {298}, year = {2026}, }
• (2026). An RL-NSGA-DP algorithm for optimization of robot placement and trajectory allocation in mobile robotic grinding of wind turbine blades. ESWA, 298, 129876. (www)

  @article{ , abstract = {Mobile robot machining, offering a more flexible and reconfigurable approach compared to fixed-base robots, has therefore become a promising solution for efficiently machining large and complex wind turbine blades. In this context, determining proper machining placements and allocating machining trajectories are two pivotal factors in the mobile robotic automation grinding of wind turbine blades, directly affecting machining efficiency and quality. However, the highly nonlinear performance distribution of the robot in the task space, combined with the complexity of the machining surface, presents significant challenges. To address these challenges, this paper presents a general optimization model of this problem with the objectives of completion time and robot manipulability, considering singularity avoidance and collision avoidance. Based on this model, an improved non-dominated sorting genetic algorithm integrated with reinforcement learning and dual population co-evolution (RL-NSGA-DP) is developed. In RL-NSGA-DP, each solution is coded using a novel two-layer metavariable encoding scheme, and a tailored dominated-recessive crossover operator is designed. Moreover, a dual-population collaborative search strategy employing different operators and an adaptive switching environmental selection mechanism based on reinforcement learning are implemented to ensure the convergence and maintain population diversity. Comparative experiments on test instances and a practical case study demonstrate that RL-NSGA-DP outperforms five well-known multi-objective evolutionary algorithms, and effectively addresses robot placement and trajectory allocation problem in mobile robotic machining systems.}, archive = {J_ESWA}, author = {Yi Hua and Xuewu Wang}, doi = {10.1016/j.eswa.2025.129876}, journal = {Expert Systems with Applications}, month = {3}, pages = {129876}, shortjournal = {Expert Syst. Appl.}, title = {An RL-NSGA-DP algorithm for optimization of robot placement and trajectory allocation in mobile robotic grinding of wind turbine blades}, volume = {298}, year = {2026}, }
• (2026). Adaptive GNSS-5G hybrid positioning based on time offset optimization estimation and multi-rate measurement fusion. ESWA, 298, 129875. (www)

  @article{ , abstract = {The fusion positioning of the Global Navigation Satellite System and Fifth-Generation Mobile Communication Network is a key direction for breaking through the performance bottleneck of a single system. However, it faces two core challenges: inconsistent spatiotemporal benchmarks and multi-rate measurement fusion. To address these issues, this paper proposes a joint time offset estimation and phased fusion strategy: An adaptive time-varying offset model is established, and an adaptive relative time offset estimation algorithm based on pseudo-measurements is designed. The high-precision time benchmark provided by GNSS is used to realize the indirect estimation of the 5G absolute time offset, solving the problem of offset accumulation in dynamic scenarios. A two-stage filtering framework is proposed, which processes the coordinate conversion error of 5G polar coordinate measurements through a modified unbiased converted measurement Kalman filter, combines with a Kalman filter to estimate the target state, and constructs a time offset pseudo-measurement based on velocity estimation for efficient solutions. A phased multi-rate fusion strategy is designed: At GNSS sampling moments, adaptive weighted fusion is used to correct the accumulated errors of 5G high-frequency data; at non-GNSS moments, 5G high-frequency measurements and motion state equation predictions are used to maintain tracking accuracy for high-dynamic targets. Simulation results show that the proposed algorithm significantly outperforms eight mainstream algorithms such as SPP, EKF, and UKF in positioning accuracy, with a total average error of 1.66 m and a total root mean square error of 2.02 m. Moreover, the error distribution is more concentrated and stability is stronger, which can effectively adapt to the needs of high-dynamic scenarios and provide reliable solutions for GNSS-5G hybrid positioning.}, archive = {J_ESWA}, author = {Huiyu Chen and Yu Lu and Yao Xing and Xu Zhang and Jiongqi Wang}, doi = {10.1016/j.eswa.2025.129875}, journal = {Expert Systems with Applications}, month = {3}, pages = {129875}, shortjournal = {Expert Syst. Appl.}, title = {Adaptive GNSS-5G hybrid positioning based on time offset optimization estimation and multi-rate measurement fusion}, volume = {298}, year = {2026}, }
• (2026). RAFN: A risk-aware feature network for identifying risk factors in supply chain finance. ESWA, 298, 129874. (www)

  @article{ , abstract = {As supply chain finance businesses expand, traditional risk assessment systems, which rely heavily on manual processes and static rule-based frameworks, are increasingly unable to keep up with the complexity and dynamism of modern risk patterns. This often leads to delayed responses and inefficiencies in risk management. To address key challenges such as difficulties in integrating heterogeneous data, low detection rates for hidden risks, and limited ability to capture dynamic risk patterns, this paper introduces a novel Risk-Aware Feature Network (RAFN) driven by an adaptive attention mechanism. The RAFN model is designed with a dual-channel architecture to process numerical and categorical data separately, employs gated linear units to dynamically merge heterogeneous data streams, and incorporates a multi-head attention mechanism with dynamic coefficients to focus on risk-sensitive features adaptively. Experiments conducted on both public and proprietary datasets show that RAFN outperforms mainstream algorithms, achieving a 1.73%-5.81% improvement in accuracy, recall, and F1-score, while maintaining a strong balance between specificity and recall. Furthermore, this study proposes a closed-loop risk management framework based on RAFN, which integrates “smart contract triggering, off-chain model evaluation, and on-chain consensus validation.” This approach offers an efficient technical solution to break down data silos and enhance the precision of risk identification in supply chain finance, paving the way for more effective and reliable risk control systems.}, archive = {J_ESWA}, author = {Yang Zhang and Yating Zhao and Wenjuan Lian and Bin Jia}, doi = {10.1016/j.eswa.2025.129874}, journal = {Expert Systems with Applications}, month = {3}, pages = {129874}, shortjournal = {Expert Syst. Appl.}, title = {RAFN: A risk-aware feature network for identifying risk factors in supply chain finance}, volume = {298}, year = {2026}, }
• (2026). Task-free continual generative modelling via dynamic teacher-student framework. ESWA, 298, 129873. (www)

  @article{ , abstract = {Continually learning and acquiring new concepts from a dynamically changing environment is an important requirement for an artificial intelligence system. However, most existing deep learning methods fail to achieve this goal and suffer from significant performance degeneration under continual learning. We propose a new unsupervised continual learning framework combining Long- and Short-Term Memory management for training deep learning generative models. The former memory system employs a dynamic expansion model (Teacher), while the latter uses a fixed-capacity memory buffer to store the update-to-date information. A novel Teacher model expansion approach, called the Knowledge Incremental Assimilation Mechanism (KIAM) is proposed. KIAM evaluates the probabilistic distance between the already accumulated information and that from the Short Term Memory (STM). The proposed KIAM adaptively expands the Teacher’s capacity and promotes knowledge diversity among the Teacher’s experts. As Teacher experts, we consider generative deep learning models such as : the Variational Autocencoder (VAE), the Generative Adversarial Network (GAN) or the Denoising Diffusion Probabilistic Model (DDPM). We also extend the KIAM-based model to a Teacher-Student framework in which we use a data-free Knowledge Distillation (KD) process to train a VAE-based Student without using any task information. The results on Task Free Continual Learning (TFCL) benchmarks show that the proposed approach outperforms other models.}, archive = {J_ESWA}, author = {Fei Ye and Adrian G. Bors}, doi = {10.1016/j.eswa.2025.129873}, journal = {Expert Systems with Applications}, month = {3}, pages = {129873}, shortjournal = {Expert Syst. Appl.}, title = {Task-free continual generative modelling via dynamic teacher-student framework}, volume = {298}, year = {2026}, }
• (2026). Trend-aware structure relearning framework for water quality prediction with coupled noise governance. ESWA, 298, 129872. (www)

  @article{ , abstract = {Urban river water quality monitoring is an essential initiative for promoting sustainable and green societal development. Water quality prediction, by effectively modeling the spatiotemporal dependencies between different monitoring sites, holds significant practical value for sites where historical data is difficult to obtain. However, despite progress in spatiotemporal (ST) dependency modeling methods, existing models face challenges in accurately capturing the complex ST dependencies of water quality changes due to the coupled effects of numerical and structural noise. To address this, we propose TaSRef, a T rend- a ware S tructure Re learning F ramework for water quality prediction with coupled noise governance. Specifically, we first separate structural noise and relearn the water topology by analyzing the trend features and relationships of neighboring historical water quality data. Then, based on the relearned topologies and the original noisy data, we thoroughly extract spatiotemporal features to isolate numerical noise. Finally, we achieve robust prediction of water quality in complex environments by aligning and aggregating the trend and ST features of corresponding nodes. Validation on three real datasets shows that the proposed TaSRef framework significantly outperforms baseline models in terms of R 2 , MAE, and RMSE. Through case visualization, results further indicate that TaSRef effectively infers the actual connectivity of river systems and demonstrates strong adaptability in handling coupled noises, thereby validating the robustness and effectiveness of TaSRef for accurate water quality prediction in complex environments.}, archive = {J_ESWA}, author = {Shuo Tong and Yuyang Xu and Jianming Sun and Fuzhen Zhuang and Jian Wu and Guangdi Chen and Haochao Ying}, doi = {10.1016/j.eswa.2025.129872}, journal = {Expert Systems with Applications}, month = {3}, pages = {129872}, shortjournal = {Expert Syst. Appl.}, title = {Trend-aware structure relearning framework for water quality prediction with coupled noise governance}, volume = {298}, year = {2026}, }
• (2026). Novel design and speed-adaptive control of a cable-driven parallel elastic hip exoskeleton for compliant locomotion assistance. ESWA, 298, 129871. (www)

  @article{ , abstract = {Robotic hip exoskeletons hold enormous potential to enhance human locomotion. However, the rigid structures and predefined control laws limit their compliance and adaptability during dynamic human-robot interactions. Here, a novel parallel elastic hip exoskeleton is developed for human locomotion assistance. The exoskeleton utilizes a remote cable actuation system to improve compliance and incorporates a parallel elastic mechanism at the hip wearable components to enhance actuator energy efficiency by generating a compensatory torque. For exoskeleton control, a speed-adaptive torque control strategy is implemented to modulate the assistance torque in real time, based on the user’s gait phase and hip movement frequency estimated by adaptive oscillators. The system was tested on seven healthy subjects, and preliminary results indicate that the parallel elastic element achieves a 40.2 % reduction in peak motor torque through energy conversion. The controller exhibits excellent torque tracking performance and effectively extracts human gait features across walking speeds with hip frequency correlation ( R 2 = 0.89). Furthermore, the hip exoskeleton significantly reduced users’ peak hip moments and muscle activity while preserving natural kinematics. The parallel elastic hip exoskeleton demonstrates strong adaptive assistive capabilities and is expected to enhance locomotion in real-world applications.}, archive = {J_ESWA}, author = {Jing Zhang and Aibin Zhu and Bingsheng Bao and Xinyu Wu and Chunli Zheng and Meng Li and Jing Wang and Yu Zhang and Xue Wu and Xiao Li}, doi = {10.1016/j.eswa.2025.129871}, journal = {Expert Systems with Applications}, month = {3}, pages = {129871}, shortjournal = {Expert Syst. Appl.}, title = {Novel design and speed-adaptive control of a cable-driven parallel elastic hip exoskeleton for compliant locomotion assistance}, volume = {298}, year = {2026}, }
• (2026). Short-term high-speed rail passenger flow forecasting integrated extended empirical mode decomposition with multivariate and bidirectional support vector machine. ESWA, 298, 129870. (www)

  @article{ , abstract = {High-speed rail (HSR) short-term passenger flow forecasting is of great significance for dynamically adjusting operation plans and optimizing transportation resource allocation. For this reason, this paper proposes an innovative complete ensemble empirical mode decomposition with adaptive noise integrated with multivariate and bidirectional support vector machine (CEEMDAN-MBSVM) method with four key steps. First, we analyze the correlations between multiple origin–destination (OD) passenger flows and select strongly correlated ODs incorporated with their opposite OD for joint bidirectional forecasting. Second, we decompose the original passenger flow time series by using period division technique of CEEMDAN, which yield multiple intrinsic mode functions (IMFs) and a residual trend term (RES). Then we apply MBSVM to predict the IMFs of each OD and use trend extrapolation to forecast the RES. Finally, we reconstruct the predicted IMFs and RES to obtain the final bidirectional HSR OD daily passenger flows. Subsequently, we conduct a comprehensive validation exercise and significance testing, using real data from Beijing-Shanghai HSR Line, against seven prediction methods. In particular, for five selected ODs, benchmarking against EEMD-MSVM method, the best performer among the six existing models, our model reduces the minimum mean absolute percentage error (MAPE) by 1.30 % to 4.97 % and benchmarking against ARIMA model, the worst performer among the six existing models, our model reduces the MAPE by 11.57 % to 22.72 %. This research has clearly demonstrated the value of leveraging bidirectional OD data on improving short-term passenger flow forecasting.}, archive = {J_ESWA}, author = {Xueyi Guan and Michael Z.F. Li and Jin Qin and Chengna Wang}, doi = {10.1016/j.eswa.2025.129870}, journal = {Expert Systems with Applications}, month = {3}, pages = {129870}, shortjournal = {Expert Syst. Appl.}, title = {Short-term high-speed rail passenger flow forecasting integrated extended empirical mode decomposition with multivariate and bidirectional support vector machine}, volume = {298}, year = {2026}, }
• (2026). Transfer learning based standard-essential patent prediction with prior transfer direction learning. ESWA, 298, 129869. (www)

  @article{ , abstract = {Standard-Essential Patent Prediction (SEPP) holds strategic significance for technological development and international market competition. Traditional SEPP models learned from Standard-Essential Patents (SEPs) with country-specific distribution differences result in different prediction accuracy. Therefore, we propose two propositions: (1) Can transfer learning be leveraged to improve prediction performance of lower-accuracy countries. (2) Can different transfer directions achieve different transfer learning performances. To address these, we propose a transfer learning based SEPP ewith prior transfer direction learning (TLSEPP-PTDL) model. The model uses a mixed transfer learning method, achieving an average accuracy of 92.03 % on four datasets, surpassing the state-of-the-art (SOTA) by 2.03 % and improving precision, recall, and F1-score by 4.25 %, 0.33 %, and 2.25 %, respectively. Moreover, we conduct experiments across countries with different patent volume, standardization rate, and standardization speed, resulting in positive transfer when transfer learning uses source domains with (1) high volume, high rate, and high speed; (2) high volume, low rate, and high speed; (3) low volume, high rate, and high speed.}, archive = {J_ESWA}, author = {Weidong Liu and Xiaoyu Fan and Kai Wang and Hongjun Sun and Keqin Gan and Cuicui Jiang and Fangyuan Lei}, doi = {10.1016/j.eswa.2025.129869}, journal = {Expert Systems with Applications}, month = {3}, pages = {129869}, shortjournal = {Expert Syst. Appl.}, title = {Transfer learning based standard-essential patent prediction with prior transfer direction learning}, volume = {298}, year = {2026}, }
• (2026). MetaPlanner: A decentralized metaheuristic-driven framework for spatio-temporal trajectory planning of agent swarms in dynamic environments. ESWA, 298, 129868. (www)

  @article{ , abstract = {This paper presents MetaPlanner, a decentralized metaheuristic-driven framework for joint spatio-temporal trajectory planning of multi-agent swarms in dynamic environments. MetaPlanner generates piecewise polynomial spline trajectories by directly optimizing parameterized spatio-temporal control points, innovatively unifies optimization across static and dynamic obstacles, inter-agent collisions, and dynamic constraints, while also supporting dynamic target tracking and precise time-of-arrival control. For swarm coordination, MetaPlanner introduces an efficient decentralized conflict resolution strategy based on a conflict graph and approximate minimum vertex cover. Extensive simulations, including coordinated navigation of up to 100 agents in complex 3D dynamic environments, precise time-of-arrival tasks, dynamic target tracking, and large-scale robustness tests (MetaPlanner-ABC achieved zero collisions in 40,000 experiments), validate the framework’s high levels of safety, coordination, efficiency, and scalability. MetaPlanner’s code and experimental environments will be open-sourced on GitHub at https://github.com/Bziyue/MetaPlanner to foster further research and applications in multi-agent trajectory planning.}, archive = {J_ESWA}, author = {Yaxin Li and Deping Zhang and Yu Wang}, doi = {10.1016/j.eswa.2025.129868}, journal = {Expert Systems with Applications}, month = {3}, pages = {129868}, shortjournal = {Expert Syst. Appl.}, title = {MetaPlanner: A decentralized metaheuristic-driven framework for spatio-temporal trajectory planning of agent swarms in dynamic environments}, volume = {298}, year = {2026}, }
• (2026). IMPACT-net: An integrated multi-scale and computation-efficient timely network for surface defect detection in industrial embedded systems. ESWA, 298, 129867. (www)

  @article{ , abstract = {Automated defect detection is crucial in industrial production, with typical scenarios in steel, automotive, and new energy manufacturing. Although deep learning-based defect detection methods have achieved significant progress, challenges such as limited detection accuracy for low-contrast defects and difficulties in efficient inference still persist. To address these challenges, this paper proposes an integrated multi-scale and computation-efficient timely network (IMPACT-Net) for surface defect detection. Firstly, a Precision-Enhanced Feature Pyramid Network (PE-FPN) is designed to improve the detection performance for low-contrast and fine defects by enhancing multi-scale feature fusion. Secondly, an Adaptive Normalized Wasserstein Distance Loss (ANWD-Loss) is proposed to optimize bounding box localization accuracy and enhance robustness. Finally, by employing Progressive Block-Freezing Architecture Search (PBF-AS) and a ZYNQ-based acceleration platform, computational complexity is significantly reduced, and efficient inference is achieved under low-power conditions. Experimental results show that the proposed IMPACT-Net achieves an mAP50 of 78.9 % on the NEU-DET dataset with 2.3 ms inference time and 71.4 % mAP50 on the GC10-DET dataset with 2.5 ms inference time, demonstrating a good balance between detection accuracy and real-time performance that is well suited for resource-constrained embedded industrial environments.}, archive = {J_ESWA}, author = {Ruiqi Wu and Yong Zhang and Rukai Lan and Lei Zhou}, doi = {10.1016/j.eswa.2025.129867}, journal = {Expert Systems with Applications}, month = {3}, pages = {129867}, shortjournal = {Expert Syst. Appl.}, title = {IMPACT-net: An integrated multi-scale and computation-efficient timely network for surface defect detection in industrial embedded systems}, volume = {298}, year = {2026}, }
• (2026). Frequency-decomposed attention joint optimization network for image compressive sensing. ESWA, 298, 129866. (www)

  @article{ , abstract = {Network approaches for image compressive sensing (ICS) have garnered significant attention due to their high efficiency and fidelity in image reconstruction. Reconstructing complex image textures from highly compressed measurements has been a longstanding goal of ICS, yet existing methods often struggle to varying degrees with the restoration of low-frequency (LF) textures and high-frequency (HF) details, which potentially limits the quality of the reconstructed image. In this paper, we propose a Frequency-decomposed Attention Joint Optimization Network (FAJO-Net) for ICS, which is capable of enhancing the attention to LF and HF components of images. Specifically, we introduce a frequency-decomposed sparse prior and coupling fidelity constraints, and incorporate a tri-optimization network framework for full, low, and high-frequency (FLH) features, where each component is optimized using an optimization-unfolded multi-scale network (OM-Net), inclusive of Principal Component Augmented Gradient Descent Module (PCAGDM) and U-shaped Proximal Mapping Module (UPMM). The PCAGDM optimizes the FLH features efficiently by supplementing the optimization of the minimum dimension principal component augmented features while optimizing the principal component features. The UPMM is able to perform multi-scale proximal mapping for all FLH features. Finally, we design a Frequency-decomposed Interaction Attention Module (FIAM) to enhance the fusion of FLH features, particularly the HF and LF components related to the full-frequency features, while reducing the impact of unnecessary features introduced by frequency decomposition. Extensive experiments demonstrate that our proposed FAJO-Net surpasses the state-of-the-art ICS networks in terms of image fidelity and visual effect, and validates that the proposed FAJO-Net framework can help enhance the image reconstruction capabilities of the vast majority of existing ICS networks, further unlocking the potential for high-fidelity restoration in ICS. Code is available at https://github.com/giant-pandada/FAJO-Net .}, archive = {J_ESWA}, author = {Zhifu Tian and Tao Hu and Di Wu and Shu Wang and Tingli Li and Ming Zhang}, doi = {10.1016/j.eswa.2025.129866}, journal = {Expert Systems with Applications}, month = {3}, pages = {129866}, shortjournal = {Expert Syst. Appl.}, title = {Frequency-decomposed attention joint optimization network for image compressive sensing}, volume = {298}, year = {2026}, }
• (2026). CARNet: Cross-attention guided feature reconstruction for RGB-T object detection. ESWA, 298, 129865. (www)

  @article{ , abstract = {RGB-T object detection leverages the complementary advantages of visible and infrared images in describing the same scene, providing a robust solution for all-weather intelligent perception systems. However, existing methods still suffer from insufficient feature fusion due to inherent differences between the two modalities. To address this issue, we propose CARNet, a cross-attention guided feature reconstruction framework for RGB-T object detection. The core innovation lies in the introduction of a novel cross-attention guided feature reconstruction (CAR) module, which establishes a new paradigm of feature decomposition-interaction-reconstruction for multispectral feature interaction: the feature decomposition unit (FDU) separates strong/weak features based on group normalization weights, the inter-modality iterative cross-attention (Inter-ICA) module enables information interaction from strong to weak features, and the feature reconstruction unit (FRU) reconstructs the modality. This interaction strategy effectively retains modality-specific information while avoiding feature aliasing. Additionally, a channel attention fusion (CAF) module is introduced to optimize the integration of dual-modality features through adaptive weight allocation. Extensive experiments on the KAIST, M3FD and VEDAI public datasets show that CARNet significantly outperforms existing state-of-the-art methods, achieving precise and stable detection of objects in complex scenarios.}, archive = {J_ESWA}, author = {Sirui Wang and Guiling Sun and Liang Dong and Bowen Zheng}, doi = {10.1016/j.eswa.2025.129865}, journal = {Expert Systems with Applications}, month = {3}, pages = {129865}, shortjournal = {Expert Syst. Appl.}, title = {CARNet: Cross-attention guided feature reconstruction for RGB-T object detection}, volume = {298}, year = {2026}, }
• (2026). Identification of critical nodes by fusing propagation probabilities and entropy in binary networks. ESWA, 298, 129861. (www)

  @article{ , abstract = {Identification of critical nodes is crucial for effectively allocating resources and prioritizing tasks in complex networks, which significantly enhances the stability and the efficiency of networks in real-world environments. Generally, existing studies primarily focus on extracting multiple different influential factors from network topology, but they have to face accuracy limitations due to high computational complexity, overlapping influence ranges, and information loss. Inspired by information entropy, in this paper, we explore to identify critical node in complex networks from the perspective of inter-node propagation probabilities. We introduce an innovative critical node ranking algorithm, named MNIE (Mixed Node Information Entropy). MNIE initially segments the node influence within the network topology by distinguishing between global and local effects so as to integrate a more comprehensive topological features set. Then, we refine the connection probability calculation and integrate the features derived from the network structural topology with the probabilities of information transmission (infection rates) among the nodes. Experimental results on 9 real-world networks and 4 synthetic datasets indicate that MNIE enhances the identification of critical nodes and accomplishes better than state-of-the-art methods on monotonicity and accuracy.}, archive = {J_ESWA}, author = {Lintao Zhang and Jianing Zhang and Rong Yan and Guoqin Yu}, doi = {10.1016/j.eswa.2025.129861}, journal = {Expert Systems with Applications}, month = {3}, pages = {129861}, shortjournal = {Expert Syst. Appl.}, title = {Identification of critical nodes by fusing propagation probabilities and entropy in binary networks}, volume = {298}, year = {2026}, }
• (2026). Adaptive energy management for battery swapping stations using HMDE-PSO: Optimizing charge-discharge control against cyber-physical attacks. ESWA, 298, 129860. (www)

  @article{ , abstract = {Battery Swapping Stations (BSSs) are emerging as critical components in smart power systems, offering rapid energy refueling, grid load balancing, and improved battery lifecycle management for electric vehicles (EVs). However, the economic operation and cyber-physical security of BSSs remain underexplored, particularly in microgrids that integrate distributed generation (DG) and face increasing vulnerability to cyber-attacks. This paper presents a novel, adaptive energy management framework that optimally schedules the charge and discharge cycles of BSSs under uncertain EV user behavior and potential cyber-physical disruptions. A key innovation lies in modeling two types of cyber-attacks—power disruption and control hijacking—and embedding their technical and economic impacts directly into the optimization process. To solve this multi-objective problem, a Hybrid multi-objective Differential Evolution–Particle Swarm Optimization (HMDE-PSO) algorithm is proposed, which efficiently balances cost minimization, system reliability, and resilience. The framework is validated using the IEEE 69-bus distribution system, demonstrating substantial improvements: over 40% reduction in power losses, enhanced voltage stability, and lower operational costs compared to conventional methods. This work distinguishes itself by integrating cyber-defense considerations with real-time energy scheduling, providing a comprehensive and resilient solution for future BSS-integrated microgrids.}, archive = {J_ESWA}, author = {Mehdi Ahmadi Jirdehi and Hamdi Abdi and Hazhir Dousti}, doi = {10.1016/j.eswa.2025.129860}, journal = {Expert Systems with Applications}, month = {3}, pages = {129860}, shortjournal = {Expert Syst. Appl.}, title = {Adaptive energy management for battery swapping stations using HMDE-PSO: Optimizing charge-discharge control against cyber-physical attacks}, volume = {298}, year = {2026}, }
• (2026). Attention-enhanced 3D residual networks for knee abnormality classification. ESWA, 298, 129858. (www)

  @article{ , abstract = {The advancement of deep learning technologies, particularly through Convolutional Neural Networks (CNNs), has substantially enriched medical image analysis. This study focuses on improving knee MRI diagnostics by comparing 2D and 3D CNN architectures using the MRNet and SKM-TEA datasets. Initially, modified 2D CNNs, such as ResNet50, were applied for plane-specific and integrated multi-plane analyses. Plane-specific models captured detailed anatomical features, while integrated approaches synthesized information across multiple planes, improving diagnostic capability but lacking full volumetric data utilization. To address these limitations, a novel 3D CNN architecture enhanced with residual attention blocks was developed, leveraging volumetric MRI data. These blocks integrate spatial attention and Squeeze-and-Excitation (SE) mechanisms, optimizing feature focus for accurate diagnostics. This approach improved both model precision and interpretability, which are crucial for clinical applications. Experimental evaluation on the MRNet dataset demonstrated that the proposed 3D CNN outperformed 2D models, achieving 83.58 % accuracy for abnormalities. On the SKM-TEA dataset, the model classified Meniscal Tear (71.36 %), Ligament Tear (79.84 %), Cartilage Lesion (84.28 %), and Effusion (76.74 %), demonstrating robustness in complex pathology detection. Gradient-weighted Class Activation Mapping (Grad-CAM) further enhanced interpretability by highlighting critical diagnostic regions. These findings emphasize the effectiveness of attention-guided 3D CNNs in knee abnormality classification. Future work will explore broader applications in medical imaging, refining the model’s generalizability across diverse clinical datasets.}, archive = {J_ESWA}, author = {Mohamad M.A. Ashames and Semih Ergin and Omer N. Gerek and H. Serhan Yavuz}, doi = {10.1016/j.eswa.2025.129858}, journal = {Expert Systems with Applications}, month = {3}, pages = {129858}, shortjournal = {Expert Syst. Appl.}, title = {Attention-enhanced 3D residual networks for knee abnormality classification}, volume = {298}, year = {2026}, }
• (2026). SmartScope: Smart contract vulnerability detection via heterogeneous graph embedding with local semantic enhancement. ESWA, 298, 129857. (www)

  @article{ , abstract = {Smart contracts are integral to blockchain ecosystems, yet their security remains a critical concern due to the prevalence of exploitable vulnerabilities. Existing conventional and deep learning-based vulnerability detection methods often struggle to capture the fine-grained semantics and heterogeneous structural dependencies essential for accurate analysis. We propose and implement SmartScope , a novel technique for smart contract vulnerability detection that leverages heterogeneous graph embedding with local semantic enhancement. Specifically, SmartScope constructs a semantically rich contract graph that depicts control-flow, data-flow, and fallback relations among critical code elements. To guide the graph learning process, we empirically assign various importance coefficients to vulnerability-relevant subgraphs, thereby enhancing the detection model’s focus on semantically critical regions. The heterogeneous graph transformer is then employed to generate context-aware node representations, which are then passed to an MLP-based detector for vulnerability classification. To the best of our knowledge, this is the first method that structurally encodes domain knowledge into the heterogeneous graph learning for achieving effective smart contract analysis. Experimental results demonstrate that SmartScope outperforms 10 representative conventional and deep learning-based baselines on over 5K smart contracts. The evaluation spans multiple vulnerability types, including reentrancy, timestamp dependence, and infinite loops, highlighting the effectiveness and robustness of our work.}, archive = {J_ESWA}, author = {Zhaoyi Meng and Zexin Zhang and Wansen Wang and Jie Cui and Hong Zhong}, doi = {10.1016/j.eswa.2025.129857}, journal = {Expert Systems with Applications}, month = {3}, pages = {129857}, shortjournal = {Expert Syst. Appl.}, title = {SmartScope: Smart contract vulnerability detection via heterogeneous graph embedding with local semantic enhancement}, volume = {298}, year = {2026}, }
• (2026). Short-term air quality prediction using a multi-scale attention fusion model with 3DIGAT-CBAM-BiLSTM based on spatio-temporal correlation. ESWA, 298, 129856. (www)

  @article{ , abstract = {Air Quality Index (AQI) prediction is crucial for environmental management and public health. However, most existing studies focus on single site modeling, neglecting the complex spatial correlations of meteorological factors and air pollutants. Therefore, a multi-scale spatio-temporal prediction model, 3DIGAT-CBAM-BiLSTM, is proposed to fully capture the spatio-temporal evolution characteristics of AQI. To reduce the interference of redundant information, the Maximum Information Coefficient and Dynamic Time Series Trend Correlation Method are employed to select the neighboring sites and influencing factors that are highly correlated with the AQI of the target site. The original air quality data is decomposed and reconstructed into high-frequency, low-frequency, and trend-term subsequences using Multivariate Variational Mode Decomposition and Sample Entropy to enhance prediction accuracy. To forecast the three-dimensional spatial tensors of these reconstructed subsequences based on time steps, monitoring sites, and influencing factors, we propose the 3DIGAT-CBAM-BiLSTM model. The spatial dependencies between sites are effectively captured by the Improved Graph Attention Network, which constructs a graph adjacency matrix based on MIC and geographic distance. Meanwhile, the Convolutional Block Attention Mechanism enhances the focus on important sites and features by combining channel and spatial attention. Furthermore, the Bidirectional Long Short-Term Memory network extracts global temporal patterns. The experimental results on the Beijing dataset show that the proposed model achieves a relative reduction of 8.53 % in RMSE and 5.83 % in MAE compared with the optimal baseline model, demonstrating clear performance improvements and offering a novel approach for modeling complex spatio-temporal data.}, archive = {J_ESWA}, author = {Liangqiong Zhu and Liren Chen and Huayou Chen}, doi = {10.1016/j.eswa.2025.129856}, journal = {Expert Systems with Applications}, month = {3}, pages = {129856}, shortjournal = {Expert Syst. Appl.}, title = {Short-term air quality prediction using a multi-scale attention fusion model with 3DIGAT-CBAM-BiLSTM based on spatio-temporal correlation}, volume = {298}, year = {2026}, }
• (2026). EEG-based emotion identification from nerve conduction mechanisms: A gustatory-emotion coupling model combined with multiblock attention module. ESWA, 298, 129855. (www)

  @article{ , abstract = {Electroencephalogram (EEG)-based emotion identification enables accurate emotional interaction in brain-computer fusion by decoding brain signals, thereby enhancing the intelligence of human-computer collaboration. Data augmentation (DA) techniques offer a promising solution to the challenge of data scarcity in emotion identification. However, traditional DA methods often overlook the physiological mechanisms underlying EEG data, limiting their effectiveness and constraining the performance of emotion classification. To address this, a DA model based on human nerve conduction mechanisms (NCMs), named the gustatory-emotion coupling model and multiblock attention module (GECM-MBAM), is proposed to improve the performance of emotion identification. First, the 1/ f characteristics and synchronization of brain responses are reproduced in the GECM output when stimulated by EEG. The bionic performance of the model in EEG processing is validated, demonstrating brain-like perception of EEG signals via the GECM. Second, the MBAM is designed based on the characteristics of the GECM output, facilitating data augmentation of emotion-related EEG. Comparative experiments demonstrate that GECM-MBAM remarkably outperforms multiple existing DA models in recognition accuracy ( p < 0.05), confirming its effectiveness and superiority in EEG data augmentation. Finally, when compared with state-of-the-art algorithms and in ablation studies, GECM-MBAM demonstrates superior performance in emotion recognition. Specifically, GECM-MBAM attains accuracies of 96.91 % and 94.52 %, recalls of 96.23 % and 93.86 %, and kappa coefficients of 95.45 % and 94.29 % on the SEED and SEED-IV datasets, respectively. In conclusion, the performance of emotion identification is improved using the GECM-MBAM, offering a novel bionic processing approach for affective computing.}, archive = {J_ESWA}, author = {Wenbo Zheng and Yong Peng and Ancai Zhang and Quan Yuan}, doi = {10.1016/j.eswa.2025.129855}, journal = {Expert Systems with Applications}, month = {3}, pages = {129855}, shortjournal = {Expert Syst. Appl.}, title = {EEG-based emotion identification from nerve conduction mechanisms: A gustatory-emotion coupling model combined with multiblock attention module}, volume = {298}, year = {2026}, }
• (2026). Unifying structural proximity and equivalence for enhanced dynamic network embedding. ESWA, 298, 129854. (www)

  @article{ , abstract = {Dynamic network embedding methods transform nodes in a dynamic network into low-dimensional vectors while preserving network characteristics, facilitating tasks such as node classification and community detection. Several embedding methods have been proposed to capture structural proximity among nodes in a network, where densely connected communities are preserved, while others have been proposed to preserve structural equivalence among nodes, capturing their structural roles regardless of their relative distance in the network. However, most existing methods that aim to preserve both network characteristics mainly focus on static networks and those designed for dynamic networks do not explicitly account for inter-snapshot structural properties. This paper proposes a novel unifying dynamic network embedding method that simultaneously preserves both structural proximity and equivalence while considering inter-snapshot structural relationships in a dynamic network. Specifically, to define structural equivalence in a dynamic network, we use temporal subgraphs, known as dynamic graphlets, to capture how a node’s neighborhood structure evolves over time. We then introduce a temporal-structural random walk to flexibly sample time-respecting sequences of nodes, considering both their temporal proximity and similarity in evolving structures. The proposed method is evaluated using five real-world networks on node classification where it outperforms benchmark methods, showing its effectiveness and flexibility in capturing various aspects of a network.}, archive = {J_ESWA}, author = {Suchanuch Piriyasatit and Chaohao Yuan and Ercan Engin Kuruoglu}, doi = {10.1016/j.eswa.2025.129854}, journal = {Expert Systems with Applications}, month = {3}, pages = {129854}, shortjournal = {Expert Syst. Appl.}, title = {Unifying structural proximity and equivalence for enhanced dynamic network embedding}, volume = {298}, year = {2026}, }
• (2026). CoSemiGNN: Blockchain fraud detection with dynamic graph neural networks based on co-association of semi-supervised. ESWA, 298, 129853. (www)

  @article{ , abstract = {With the development of blockchain technology, the increasing number of cyber frauds has caused huge economic losses, prompting more and more researchers to focus on how to effectively detect criminal activities in the blockchain transaction environment. Currently, graph neural network (GNN)-based methods have made significant progress in the field of blockchain illegal transaction detection due to their advantages in extracting graph structure features. However, existing illegal transaction pattern detection methods usually rely on historical labeled data. In the blockchain transaction environment, transaction data changes over time, and it is often difficult to obtain transaction labels. As a result, the performance of these methods is often unsatisfactory when faced with newly distributed transaction data. To address this challenge, this paper proposes a dynamic graph neural network based on co-association of semi-supervised (CoSemiGNN) for more efficiently identifying illegal transactions in blockchain environments under conditions of dynamically changing transaction data. The model combines semi-supervised learning with a dynamic graph neural network, enabling it to effectively identify novel illegal transaction patterns from unlabeled data and adapt to the evolving blockchain network environment. Specifically, CoSemiGNN captures features of novel transactions by integrating semi supervised learning results. It utilizes co-occurrence relations of edges and co-occurrence feature aggregation of nodes to skillfully integrate semi-supervised methods into feature extraction of transaction graphs, enabling the model to extract novel illegal transaction patterns from unlabeled data. In addition, the model utilizes self attention recurrent neural networks (RNNs) to capture temporal information in transactions, ensuring the dynamics of CoSemiGNN. Finally, we theoretically analyze the model, and experiments on a real Bitcoin transaction dataset demonstrate that CoSemiGNN outperforms existing methods by as much as 30 % in terms of F1 scores for detecting illegal transactions when the transaction data undergoes distributional migration. This research compensates the problem that existing methods ignore the distributional changes of blockchain transaction data, and provides a new perspective and an effective solution for blockchain illegal transaction detection.}, archive = {J_ESWA}, author = {Yulong Wang and Qingxiao Zheng and Xuedong Li and Lingfeng Wang and Ling Lin}, doi = {10.1016/j.eswa.2025.129853}, journal = {Expert Systems with Applications}, month = {3}, pages = {129853}, shortjournal = {Expert Syst. Appl.}, title = {CoSemiGNN: Blockchain fraud detection with dynamic graph neural networks based on co-association of semi-supervised}, volume = {298}, year = {2026}, }
• (2026). Fuzzy prototype transfer learning for non-overlapping cross-domain recommendation. ESWA, 298, 129852. (www)

  @article{ , abstract = {Cross-domain recommendation (CDR) offers an efficient and effective solution to mitigate data sparsity in recommender systems. Existing research primarily focuses on exploring knowledge transfer based on overlapping entities or auxiliary contents between domains. However, there is little research on the real non-overlapping cross-domain recommendation (NCDR) problems, even though it poses a more general and applicable prospect. The core challenge of NCDR lies in the difficulty of finding the correct and useful knowledge transfer bridge between domains without relying on the explicit overlapping identities. Utilizing the inherent similarity and fuzzy characteristics of users and items in the latent feature space, this paper investigates a Fuzzy Prototype Transfer (FPT) learning method for the NCDR problem. FPT jointly optimizes prototypes and individual features for both users and items in target domain under the guidance of source features. An end-to-end learnable fuzzy clustering module based on maximum entropy regularization is proposed to learn both user and item fuzzy clustering assignments and fuzzy fusion prototypes. Lastly, by constructing an asymmetric dual-prototype fuzzy transfer module, similar user and item features across domains are found and aligned effectively. Extensive experiments demonstrate FPT’s superior performance over the state-of-the-art methods while maintaining lower inference and memory costs than those of the baselines.}, archive = {J_ESWA}, author = {Ruxia Liang and Qinglin Huang and Xiaoxuan Shen}, doi = {10.1016/j.eswa.2025.129852}, journal = {Expert Systems with Applications}, month = {3}, pages = {129852}, shortjournal = {Expert Syst. Appl.}, title = {Fuzzy prototype transfer learning for non-overlapping cross-domain recommendation}, volume = {298}, year = {2026}, }
• (2026). LLM-based exploration and analysis of real-time and historical blockchain data. ESWA, 298, 129851. (www)

  @article{ , abstract = {Blockchain technology has revolutionized digital transactions and decentralized applications through its transparent and immutable ledger system, with platforms like Ethereum processing millions of transactions daily. However, as blockchain networks grow, traditional blockchain explorers show limitations when providing intuitive access to this vast data landscape, particularly when handling complex analytical queries, interpreting transaction patterns, and serving users without technical expertise. In this paper, we address these limitations by proposing an intelligent blockchain explorer that combines a Large Language Model (LLM)-powered agent for real-time blockchain interactions with a schema-aware SQL agent for historical data analysis. For real-time interactions, a dedicated blockchain agent connects to live networks through external APIs and specialized tools to process queries about current transactions and network states. When analyzing historical data patterns, we use an approach in which a Retrieval-Augmented Generation (RAG) system enhances the SQL agent’s understanding of the blockchain database schema and structure. This SQL agent subsequently translates natural language queries into SQL commands for efficient data retrieval from our periodically synchronized blockchain database. A query processor, powered by an LLM, intelligently routes user queries between these components based on temporal and contextual requirements, which enables both immediate blockchain state analysis and complex historical data querying. We evaluate our system on diverse blockchain queries, including complex analytical scenarios and multi-step operations. The experimental results demonstrate the effectiveness of our schema-aware SQL agent in accurate query translation and the overall system’s capability in handling both real-time and historical blockchain data exploration tasks.}, archive = {J_ESWA}, author = {S. Gebreab and A. Musamih and K. Salah and R. Jayaraman}, doi = {10.1016/j.eswa.2025.129851}, journal = {Expert Systems with Applications}, month = {3}, pages = {129851}, shortjournal = {Expert Syst. Appl.}, title = {LLM-based exploration and analysis of real-time and historical blockchain data}, volume = {298}, year = {2026}, }
• (2026). RL-DFN: A reinforcement learning-driven dual-view feature fusion network for aspect-based sentiment analysis in online public opinion. ESWA, 298, 129850. (www)

  @article{ , abstract = {Sentiment analysis of online public opinion plays a vital role in understanding emotional dynamics on social media. However, most existing approaches focus on overall sentiment within text, often neglecting fine-grained sentiment information. This limitation restricts the depth of insights obtainable for public opinion monitoring. Aspect-based sentiment analysis (ABSA) addresses this issue by identifying sentiment toward specific aspects. Despite its advantages, current ABSA methods struggle to effectively integrate syntactic and sequential features, leading to incomplete contextual understanding. Additionally, noisy dependency trees introduce irrelevant syntactic features, which mislead sentiment classification and degrade accuracy. To address these challenges, we propose RL-DFN, a reinforcement learning-driven dual-view feature fusion network that enhances the robustness of ABSA models. RL-DFN consists of a dual-view feature fusion network and an actor-critic reinforcement learning module. The dual-view feature fusion network employs a graph attention network (GAT) to extract syntactic features and a transformer to capture sequential features. These complementary features are then fused through a bilinear affine transformation (Biaffine) module which captures fine-grained and bidirectional correlations between syntactic and sequential representations, enabling more expressive cross-view interactions. Simultaneously, an actor-critic reinforcement learning module dynamically refines the dependency tree representations by identifying key dependency types and filtering out noise, ensuring the reliability of syntactic features used in fusion. Extensive experiments on five widely used benchmark datasets demonstrate that RL-DFN significantly outperforms existing models, validating the effectiveness of our approach.}, archive = {J_ESWA}, author = {Ziheng Li and Kui Zhao}, doi = {10.1016/j.eswa.2025.129850}, journal = {Expert Systems with Applications}, month = {3}, pages = {129850}, shortjournal = {Expert Syst. Appl.}, title = {RL-DFN: A reinforcement learning-driven dual-view feature fusion network for aspect-based sentiment analysis in online public opinion}, volume = {298}, year = {2026}, }
• (2026). Truck scheduling optimization at a cold chain cross-docking terminal considering uncertainties and the door-mixed service mode. ESWA, 298, 129849. (www)

  @article{ , abstract = {The increasing global demand for perishable agricultural products necessitates advancements in cold chain logistics. Cross-docking, known for its efficiency, is particularly well-suited for the transfer and distribution of such goods. However, truck scheduling at cold chain cross-dock terminals (CDTs) presents unique challenges, including product perishability, stringent time windows, and temperature-controlled environments. This work investigates a truck scheduling problem within a cold chain CDT, explicitly addressing uncertainties in refrigerated product damage (affecting supply) and repackaging times. A two-stage stochastic programming model is developed to capture these uncertainties. To solve this model, a scenario reduction approach employing K-means++ and K-medoids clustering is used, followed by Sample Average Approximation. Small-scale instances are solved optimally using CPLEX. For larger instances, a novel hybrid heuristic algorithm, combining the global search capabilities of Genetic Algorithms with the local search capabilities of Adaptive Large Neighborhood Search and Simulated Annealing, is proposed. Numerical experiments demonstrate the effectiveness of this algorithm, and sensitivity analysis provides valuable managerial insights.}, archive = {J_ESWA}, author = {Feifeng Zheng and Yuzhi Yi and Ming Liu and Huaxin Qiu}, doi = {10.1016/j.eswa.2025.129849}, journal = {Expert Systems with Applications}, month = {3}, pages = {129849}, shortjournal = {Expert Syst. Appl.}, title = {Truck scheduling optimization at a cold chain cross-docking terminal considering uncertainties and the door-mixed service mode}, volume = {298}, year = {2026}, }
• (2026). A two-stage hybrid heuristic approach combining genetic algorithm and variable neighborhood descent for the clustered electric vehicle routing problem. ESWA, 298, 129848. (www)

  @article{ , abstract = {This paper considers a new variant of the Electric Vehicle Routing Problem (EVRP), termed the Clustered Electric Vehicle Routing Problem (CluEVRP). In CluEVRP, all customers are pre-divided into clusters, and each charging station is either located within a cluster or independent of any cluster. Each electric vehicle must complete service for all customers within the current cluster before proceeding to the next cluster or returning to the depot. Electric vehicles can charge at any available charging station while serving a cluster, but incur a penalty cost upon entering each cluster. The objective is to minimize the total logistics cost, comprising vehicle startup costs, cluster entry penalty costs, and energy consumption costs. To solve CluEVRP, a two-stage hybrid heuristic combining a Genetic Algorithm (GA) and Variable Neighborhood Descent (VND) is proposed (HGA-VND), where GA ensures population diversity and VND enhances local search capability. To evaluate the algorithm’s performance, 75 test instances are adapted from classic Clustered Vehicle Routing Problem (CluVRP) dataset, incorporating electric vehicle characteristics. Computational results demonstrate that HGA-VND consistently obtains high-quality solutions within reasonable time for both CluVRP and CluEVRP instances, exhibiting good performance. Furthermore, sensitivity analysis indicates that moderately increasing vehicle capacity, optimizing battery configuration, and adopting lightweight designs can significantly reduce total operating costs. This study extends traditional EVRP research by introducing clustered customer distribution, enriching solutions for routing problems in practical logistics networks, particularly for “milk run” models in industrial parks, and providing significant managerial insights.}, archive = {J_ESWA}, author = {Yuheng Jin and Xiaoguang Bao and Zhaocai Wang}, doi = {10.1016/j.eswa.2025.129848}, journal = {Expert Systems with Applications}, month = {3}, pages = {129848}, shortjournal = {Expert Syst. Appl.}, title = {A two-stage hybrid heuristic approach combining genetic algorithm and variable neighborhood descent for the clustered electric vehicle routing problem}, volume = {298}, year = {2026}, }
• (2026). Prior feature efficient diffusion model for 3D MRI image super-resolution improving brain connectomics analysis. ESWA, 298, 129847. (www)

  @article{ , abstract = {Magnetic resonance imaging (MRI) is a non-invasive imaging technique used to study the internal structure and function of the human body, especially vital in the frontier exploration of brain science. However, due to hardware limitations and relatively thicker slices, the spatial resolution of MRI image is insufficient to meet the demands of clinical applications. Deep learning-based Super Resolution (SR) methods improve MRI image quality but often result in poor visual quality and over-smoothing. Diffusion-based SR methods can produce complex and perceptually appealing details, but require numerous diffusion steps. Besides, current SR model evaluations rely predominantly on quantitative metrics and visual inspection, yet remain disconnected from clinical integration. To alleviate above problems, this paper presents the Prior Feature Efficient Diffusion Model (PFEDiff) for 3D MRI image SR. To improve the generation efficiency, PFEDiff utilizes Resolution Disparity Maps (RDMs) as the target for the SR task. By incorporating rich prior features from low-resolution MRI through the Prior Information Embedding Module (PIEM), PFEDiff achieves precise SR and strong generalization capabilities. In addition, the designed residual attention noise predictor enables advanced noise prediction, thereby improving the overall performance of the model. The MRI images SR experimental results demonstrate that PFEDiff outperforms SOTA methods, and compared to baseline diffusion models, PFEDiff achieves more than 10 times faster sampling speed. To connect the quantitative metrics and clinical application, we apply PFEDiff to Brain Connectomics Analysis. The results of the brain connectomics experiment confirm the clinical application potential of the proposed method. Our code is publicly available at https://github.com/Rein592977/PFEDiff .}, archive = {J_ESWA}, author = {Renpeng Yao and Jinglong Du and Wenzong Peng and Hongbi Li and Jingbo Zhang and Du Lei and Yuanyuan Jia}, doi = {10.1016/j.eswa.2025.129847}, journal = {Expert Systems with Applications}, month = {3}, pages = {129847}, shortjournal = {Expert Syst. Appl.}, title = {Prior feature efficient diffusion model for 3D MRI image super-resolution improving brain connectomics analysis}, volume = {298}, year = {2026}, }
• (2026). Group-guided prompt learning for vision-language models. ESWA, 298, 129846. (www)

  @article{ , abstract = {Prompt learning has become one of the mainstream approaches for enabling Vision-Language Models (VLMs) to effectively adapt to downstream tasks. Recent approaches enhanced the generalization of models by integrating prior knowledge from large language models (LLMs). However, these approaches overlook the potential value of group knowledge derived from semantic correlations across different classes, which may limit the performance of the model in the face of complex downstream tasks. To overcome this challenge, we propose Group-guided Prompt Learning (GGPL) , which integrates group knowledge into the original text prompts through LLMs. Specifically, GGPL uses LLMs to group all classes and integrates the group knowledge into the original text prompts to construct the final text prompts. Furthermore, we introduce a novel Group Knowledge Alignment (GKA) module, which aligns the learnable prompt features with the pre-trained features that contain group knowledge, preventing the learnable prompt features from feature shift during the training process and thus reducing overfitting. Experimental results across 11 public datasets demonstrate that the proposed GGPL method achieves significant improvement on various prompt learning approaches, while numerous ablation experiments also demonstrate the effectiveness of the each component of our GGPL method.}, archive = {J_ESWA}, author = {Yufei Zheng and Shengsheng Wang and Yansheng Gao}, doi = {10.1016/j.eswa.2025.129846}, journal = {Expert Systems with Applications}, month = {3}, pages = {129846}, shortjournal = {Expert Syst. Appl.}, title = {Group-guided prompt learning for vision-language models}, volume = {298}, year = {2026}, }
• (2026). MTMP: Multimodal targeted molecule generation model with protein features. ESWA, 298, 129845. (www)

  @article{ , abstract = {Molecular generation is a fundamental task in computational chemistry and drug discovery, aiming to design molecular structures with specific properties through algorithmic approaches. Traditional molecular generation models predominantly rely on SMILES representations or molecular topological graphs, limiting their ability to comprehensively capture molecular characteristics. To address this limitation, we propose MTMP, a generative model that bridges molecular structure and sequence. It uses a graph neural network to encode topological features and a GRU decoder to generate SMILES strings. This integration enhances the joint modeling of chemical properties and structure. Furthermore, MTMP incorporates a pre-trained language model trained on large-scale protein sequence data to extract target protein features, enabling a direct and more precise encoding of protein-specific information. This facilitates the generation of molecules with enhanced binding affinity to specific protein targets. To further improve molecular design efficacy, the model was pre-trained on the ZINC molecular database and subsequently fine-tuned via transfer learning using a curated dataset of ligand molecules with known activity against specific target proteins. Experimental evaluations demonstrate that MTMP achieves competitive performance compared to state-of-the-art molecular generation methods. The model produces structurally valid and diverse molecules with favorable physicochemical properties and strong drug-likeness. Notably, it generates novel compounds with high docking scores against target proteins, underscoring its potential for de novo drug design and targeted molecular discovery.}, archive = {J_ESWA}, author = {Dingming Liang and Runfu Yu and Xiaofeng Wang and Kaiyu Dong and Yunjing Zhang and Huicong Liang and Ximing Xu and Tao Song and Shuang Wang}, doi = {10.1016/j.eswa.2025.129845}, journal = {Expert Systems with Applications}, month = {3}, pages = {129845}, shortjournal = {Expert Syst. Appl.}, title = {MTMP: Multimodal targeted molecule generation model with protein features}, volume = {298}, year = {2026}, }
• (2026). Enhancing mixture-of-experts model with prior knowledge for infrared and visible image fusion in complex degraded environments. ESWA, 298, 129844. (www)

  @article{ , abstract = {Infrared and visible image fusion aims to generate a composite image that simultaneously preserves thermal radiation information from infrared images and the rich texture details of visible images. However, existing studies have overlooked the adverse effects of scene degradation in visible images on the fusion process, leading to suboptimal fusion outcomes. To address the challenges posed by scene degradation in image fusion tasks, this paper proposes an image fusion network with degradation correction capability named the Enhancing Mixture-of-Experts model with Prior knowledge for infrared and visible image fusion (EMPFusion), which pioneers the automated execution of multiple degradation restoration tasks during the fusion process. First, we develop a diffusion model for degradation removal to generate high-quality pseudo-labels of visible images, thereby providing supervisory signals for training the fusion network. Second, to overcome the significant challenges in feature extraction caused by complex and diverse degradation scenarios, we design a Degradation removal backbone based on Prior knowledge and the Mixture-of-Experts (DPM) module. This architecture removes degradation with low loss and moderate computational overhead by integrating domain-specific prior knowledge and the Mixture-of-Experts framework. Furthermore, to mitigate semantic loss under extreme environmental conditions, we propose a Semantic Deconstruction and Segmentation (SDS) module based on image-text foundation models, enhancing semantic consistency throughout the fusion process. Extensive experiments demonstrate that EMPFusion excels in infrared-visible fusion tasks within complex degraded scenes. Across the LLVIP, M3FD, RoadScene, and MSRS datasets, EMPFusion achieves state-of-the-art (SOTA) performance on multiple evaluation metrics, showcasing exceptional degradation robustness and visual-semantic information preservation capabilities. By unifying adaptive degradation correction with fusion, this research addresses fusion distortion caused by degraded multimodal data in harsh environments, significantly enhancing applicability and robustness in downstream tasks such as autonomous driving and security monitoring.}, archive = {J_ESWA}, author = {Gang Li and Chengrun Jiang and Jiachen Li and Jin Wan and Mingle Zhou and Delong Han}, doi = {10.1016/j.eswa.2025.129844}, journal = {Expert Systems with Applications}, month = {3}, pages = {129844}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing mixture-of-experts model with prior knowledge for infrared and visible image fusion in complex degraded environments}, volume = {298}, year = {2026}, }
• (2026). Multi-scenario building change detection in remote sensing images using CNN-mamba hybrid network and consistency enhancement learning. ESWA, 298, 129843. (www)

  @article{ , abstract = {Multi-scenario building change detection (BCD) plays a crucial role in scientific decision-making for urban development, natural disasters, and war scenarios. Nevertheless, current research confronts several challenges: (1) In deep learning (DL) methods, convolutional neural networks (CNN) fail to capture global information, and transformer has high computational overhead. (2) The clear distinction and collaborative suppression of scene-level and data-level pseudo-changes remain unresolved. (3) Multi-scenario BCD remains under-explored. To address these challenges, this study proposes a dual pseudo-change suppression framework for multi-scenario BCD. The framework includes the novel C 2 Mamba DL model (CNN collaborates with Mamba) and the consistency enhancement learning strategy (CELS). Among them, the C 2 Mamba merges the local feature extraction capability of CNN with the efficient global modeling capability of Mamba. It further integrates the proposed progressive context information aggregation module (PCIA) and the multi-scale differential feature enhancement module (MDFE). These two modules enable the model to effectively distinguish building changes among various ground targets, thereby suppressing the scene-level pseudo-changes. The CELS first performs data augmentation on the post-temporal images, including weather (clouds, rain, and overcast) and sensor differences. Subsequently, a novel difference-focused loss function is designed to ensure the accurate alignment of the change features between the original and enhanced image pairs, thereby suppressing the data-level pseudo-changes. In experiments, the BCD performance of urban development, natural disasters, and war scenarios is evaluated using WHU-CD, xBD, and WraBCD datasets, respectively. Compared to the second-best methods, the proposed method achieves F1-score improvements of 1.36%, 2.69%, and 1.65%, and IoU improvements of 2.49%, 3.21%, and 2.32%, respectively. Additionally, numerous ablation experiments are conducted to validate the validity of the proposed method. And the robustness of the proposed method is verified through zero-shot generalization and few-shot testing.}, archive = {J_ESWA}, author = {Wei Li and Guorui Ma and Haiming Zhang and Peng Chen and Di Wang and Rong Chen}, doi = {10.1016/j.eswa.2025.129843}, journal = {Expert Systems with Applications}, month = {3}, pages = {129843}, shortjournal = {Expert Syst. Appl.}, title = {Multi-scenario building change detection in remote sensing images using CNN-mamba hybrid network and consistency enhancement learning}, volume = {298}, year = {2026}, }
• (2026). Software defect prediction based on graph code semantics. ESWA, 298, 129842. (www)

  @article{ , abstract = {As software systems become larger and more complicated, researchers are focusing more on how to effectively determine whether a program is flawed. Convolutional neural networks (CNNs) have been employed by several researchers in recent years to extract latent semantic information based on Abstract Syntax Trees (AST). However, the small granularity of code information in AST makes it easy to focus on local information and difficult to capture global semantic information. Further, ASTs lack control flow and data flow edges to fully utilize the code’s contextual semantic information. In this paper, we obtain the Control Flow Graph (CFG) and Program Dependence Graph (PDG) of a program through the improved TinyPDG. The Continuous Bag-of-Words (CBOW) model is utilized to train the corpus of CFG and PDG. Additionally, an improved PNIAT layer that combines multi-head attention and BiLSTM is employed to obtain method-level semantic feature vectors. Subsequently, methods based on weighted summation and linear fully connected are respectively proposed to aggregate method-level semantic feature vectors into file-level semantic feature vectors. The joint features are then constructed in combination with the hand-labeled features. Finally, after balancing the data using the SMOTETomek method, 11 machine learning models are used as classifiers for defect prediction. The experimental findings demonstrate that, compared to current software defect prediction techniques, the PDG using a weighted summation-based approach in the QDA model (W-PDG-QDA) presented in this research is the best, and improves AUC, F1, and accuracy scores by 0.723 % -21.72 %, 5.18 % -55.25 % and 1.99 % -25.16 %.}, archive = {J_ESWA}, author = {Hongwei Tao and Tao Wang and Zhenhao Geng and Xiaoxu Niu and Qiaoling Cao}, doi = {10.1016/j.eswa.2025.129842}, journal = {Expert Systems with Applications}, month = {3}, pages = {129842}, shortjournal = {Expert Syst. Appl.}, title = {Software defect prediction based on graph code semantics}, volume = {298}, year = {2026}, }
• (2026). G-GraphTST: Spatiotemporal learning for multivariate long-term photovoltaic power forecasting. ESWA, 298, 129841. (www)

  @article{ , abstract = {In clean energy systems, the importance of photovoltaic power forecast (PVPF) has become increasingly prominent. In China, the proactive management and control of distributed photovoltaic systems in rural areas have gained policy priority, aiming optimize the integration of photovoltaic energy through multi-node long-term PVPF. However, existing studies face significant challenges in effectively modeling spatiotemporal correlations at different perceptual levels and frequently overlook the interactive learning between spatial and temporal dependencies. To address these limitations, we propose a Global-Embedding Graph-Encoder Time Series Transformer (G-GraphTST 1 ) for solar power forecasting, which features an interactive learning framework comprising spatial and temporal modules to downsample solar data and capture spatiotemporal correlations from multi-level perceptual perspectives. Temporally, the framework compresses high-dimensional raw time-series data into more semantically meaningful 1D local feature representations and introduces learnable global embeddings that interact with all patch embeddings via the self-attention mechanism in the Transformer encoder to capture the periodicity and trends of photovoltaic systems. Spatially, it employs a learnable graph constructor that uses the spatiotemporal heterogeneity of photovoltaic power data in the current batch as query conditions to dynamically reveal the transient power correlations and dependencies between power stations in the photovoltaic network in real time. Extensive experiments on solar datasets and multiple other benchmark datasets demonstrate that GraphTST outperforms existing mainstream methods in performance and exhibits strong generalizability, providing critical support for optimizing smart grid scheduling and managing large-scale photovoltaic power plants.}, archive = {J_ESWA}, author = {Wentao Zheng and Weixing Qian and Pengyu Liu and Rongzhe Wu and Mingjia Chen and Houchen Zhou}, doi = {10.1016/j.eswa.2025.129841}, journal = {Expert Systems with Applications}, month = {3}, pages = {129841}, shortjournal = {Expert Syst. Appl.}, title = {G-GraphTST: Spatiotemporal learning for multivariate long-term photovoltaic power forecasting}, volume = {298}, year = {2026}, }
• (2026). Quantifying expressive power in knowledge graph embeddings: An entropy-based metric framework. ESWA, 298, 129840. (www)

  @article{ , abstract = {Knowledge graph embedding (KGE) is a mainstream technique for the knowledge completion (KGC) task and has attracted significant attention. However, there is a lack of a quantitative evaluation framework to measure the expressive power of KGE models, which is important for model selection and design in downstream applications. Specifically, existing metrics inadequately assess the expressive power of these models because they focus solely on learning outcomes rather than on the embeddings or datasets themselves, which have a significant influence on performance. To address this gap, we propose a novel framework, the Dense Feature Model (DFM), grounded in information theory, to enhance our understanding of KGE. This framework offers three key insights regarding embedding-based KGC (eKGC) approaches: (1) the expressive power of an eKGC model can be quantified using entropy, enabling straightforward model comparison based on a value computed solely from the numbers of entities and relations; (2) the DFM metrics indicate how far an eKGC model is from its theoretical limitations and how much potential improvement remains, as demonstrated by propositions proven in this work; and (3) as a significant byproduct, the framework elucidates why and how a model balances expressive power and computational cost. Furthermore, the framework may be transferable to other relational data processing domains.}, archive = {J_ESWA}, author = {Panfeng Chen and Hui Li and Qi Wang and Xin Zhou and Xibin Wang}, doi = {10.1016/j.eswa.2025.129840}, journal = {Expert Systems with Applications}, month = {3}, pages = {129840}, shortjournal = {Expert Syst. Appl.}, title = {Quantifying expressive power in knowledge graph embeddings: An entropy-based metric framework}, volume = {298}, year = {2026}, }
• (2026). Legend-KINN: A legendre polynomial-based Kolmogorov–Arnold-informed neural network for efficient PDE solving. ESWA, 298, 129839. (www)

  @article{ , abstract = {Physics-Informed Neural Networks (PINNs) have become a widely used method in scientific machine learning for solving partial differential equation (PDE) problems. However, existing PINN methods, while adhering to physical constraints during the convergence process, often suffer from a lack of interpretability in the nonlinear mapping between inputs and outputs during forward propagation. Additionally, fixed activation functions and soft constraint mechanisms result in poor training stability and high computational costs. To address these challenges, we propose a Legendre Polynomial-Based Kolmogorov–Arnold-Informed Neural Network (Legend-KINN), which explicitly enhances physical consistency through Legendre orthogonal polynomials and optimizes the backpropagation path using pseudo-time stepping methods to improve training stability. The use of Legendre polynomials improves the physical interpretability of the model while maintaining strict adherence to physical constraints. Experimental results demonstrate that Legend-KINN outperforms standard Multi-Layer Perceptron (MLPs) and Kolmogorov–Arnold Network (KAN) in terms of both accuracy and computational efficiency, achieving faster convergence with fewer parameters across 25 datasets from three classical computational fluid dynamics cases. Code is available at: https://github.com/zhang-zhuo001/Legend-KINN}, archive = {J_ESWA}, author = {Zhuo Zhang and Xiong Xiong and Sen Zhang and Wei Wang and Yanxu Zhong and Canqun Yang and Xi Yang}, doi = {10.1016/j.eswa.2025.129839}, journal = {Expert Systems with Applications}, month = {3}, pages = {129839}, shortjournal = {Expert Syst. Appl.}, title = {Legend-KINN: A legendre polynomial-based Kolmogorov–Arnold-informed neural network for efficient PDE solving}, volume = {298}, year = {2026}, }
• (2026). A novel grey possibility clustering method based on inverse perspective and its applications. ESWA, 298, 129837. (www)

  @article{ , abstract = {The center-point mixed possibility functions (CMPFs), which are determined by the decision makers qualitatively, are the most important element to obtain the effective clustering results in a grey clustering model. However, different decision makers provide different CMPFs which may lead to inconsistent or contradictory clustering results. In response to this problem, this article proposes an inverse grey possibility clustering model which can determine the CMPFs based on the part of the given final results. This novel matrix-based method can derive all of the required CMPFs which satisfy the partially known clustering results. More specifically, four theorems are put forward to analyze the four different cases, which are single index single object (SISO), single index multiple objects (SIMO), multiple indices single object (MISO) and multiple indices multiple objects (MIMO), respectively, to derive the required CMPFs of a given clustering result using algebraic expressions. For the purpose of developing the matrix representations for the MISO and MIMO situations, a new unified expression of the CMPFs to replace their existing segmented function expression is proposed. Finally, in order to demonstrate how it can be used in practice, the proposed method is applied for evaluating the effects of the reduction of pollution and carbon emissions and determining aerospace equipment component suppliers with different types of data. Compared to the forward GPC models, the proposed IGPC model has higher accuracy.}, archive = {J_ESWA}, author = {Junjie Wang and Xun Li and Yaoguo Dang and Zhongju Shang and Li Ye and Sifeng Liu}, doi = {10.1016/j.eswa.2025.129837}, journal = {Expert Systems with Applications}, month = {3}, pages = {129837}, shortjournal = {Expert Syst. Appl.}, title = {A novel grey possibility clustering method based on inverse perspective and its applications}, volume = {298}, year = {2026}, }
• (2026). Balancing semantic and structural decoding for fMRI-to-image reconstruction. ESWA, 298, 129836. (www)

  @article{ , abstract = {Reconstructing visual images from fMRI signals is an enticing task that opens new horizons in understanding the intricate workings of human cognition. Most existing methods benefit from the diffusion model to decode high-level semantic information from fMRI signals, achieving promising semantic reconstruction. However, such a solution ignores low-level structure information, e.g. , object location and color, leading to an uncompleted visual reconstruction. In this work, we present a novel fMRI-to-image approach to reconstruct high-quality images by balancing semantic and structural decoding in the diffusion model. Specifically, we first utilize the CLIP model and an MLP module to extract sufficient semantic information and structural details, respectively. Then we design a S emantic and S tructural A wareness B alanced module ( SSAB ) to predict the weight of structural information for the current denoising step, thus generating high-quality images by gradually integrating semantic and structural information during image reconstruction. Experimental results demonstrate that the proposed SSAB model is effective with only a few extra parameters, it achieves state-of-the-art performance in comprehensively evaluating both semantic and structural metrics. All code is available on https://github.com/Venchy-he/SSAB .}, archive = {J_ESWA}, author = {Wanqi He and Jin Wang and Hui Li and Hanyang Chi and Bingfeng Zhang}, doi = {10.1016/j.eswa.2025.129836}, journal = {Expert Systems with Applications}, month = {3}, pages = {129836}, shortjournal = {Expert Syst. Appl.}, title = {Balancing semantic and structural decoding for fMRI-to-image reconstruction}, volume = {298}, year = {2026}, }
• (2026). Cohen’s class bilinear distributions and convolutional neural networks applied to broken rotor bar diagnosis. ESWA, 298, 129835. (www)

  @article{ , abstract = {Time-frequency (t-f) signal processing techniques are particularly advantageous for induction motor (IM) fault diagnosis under dynamic and variable industrial operating conditions. Broken rotor bar (BRB) faults remain among the most challenging to detect because of their proximity to the fundamental frequency and significantly lower amplitude in comparison. Additionally, traditional approaches often result in false positives or negatives in scenarios involving load variation, power quality issues, and inverter-fed operations. To address these issues, this work proposes a comprehensive and objective methodology to evaluate eight Cohen-Class Bilinear Distributions (CCBD) to diagnose BRB. CCBDs offer high-resolution t-f representations, a crucial advantage for fault identification. However, their use is limited by cross-terms, nonlinear artifacts inherent to bilinear processing. To overcome this limitation, convolutional neural networks (CNNs) are applied to automatically classify t-f images and identify the CCBD methods that effectively minimize the cross-terms while preserving fault signature harmonics. This strategy also avoids subjective and time-consuming visual inspections. In addition, this work proposes a novel CNN architecture with an attention module (CNN-Attention), designed to enhance performance in this context. The evaluation considers challenging conditions, including 1) line-fed and 2) inverter-fed operation, 3) voltage unbalance, and 4) load oscillations, applied to a 2 HP, 60 Hz motor. Generalization capability is validated with data collected from a different laboratory, using an independent 1 HP, 50 Hz motor and five different inverter models. Experimental results show that combining CNN-Attention with CCBDs enables highly accurate and fast classification, achieving approximately 96% accuracy even when trained and tested on distinct laboratory datasets, demonstrating the effectiveness and adaptability of the proposed method.}, archive = {J_ESWA}, author = {Avyner L.O. Vitor and Alessandro Goedtel and Wesley A. Souza and Marcelo F. Castoldi and Daniel Morinigo-Sotelo and Oscar Duque-Perez}, doi = {10.1016/j.eswa.2025.129835}, journal = {Expert Systems with Applications}, month = {3}, pages = {129835}, shortjournal = {Expert Syst. Appl.}, title = {Cohen’s class bilinear distributions and convolutional neural networks applied to broken rotor bar diagnosis}, volume = {298}, year = {2026}, }
• (2026). A data-driven spatio-temporal driving risk field mechanism for path planning. ESWA, 298, 129834. (www)

  @article{ , abstract = {Characterizing the future risk posed by surrounding human-driven vehicles is crucial for enhancing the safety of autonomous vehicles. Existing risk field methods build spatiotemporal risk fields using mathematical models with fixed parameters, making them struggle to capture dynamic human driving behaviors such as frequent acceleration, deceleration or lane changes, and are prone to overlooking rare but critical sudden events, which leads to unstable risk assessments in complex long-term scenarios. To address the aforementioned issues, a data-driven spatio-temporal risk field framework is proposed, which builds on a Bidirectional Deep Ultra-Gated Recurrent Unit (BDUGRU) to capture the high-dimensional spatio-temporal features of nearby vehicles and precisely predict vehicle distribution patterns over extended horizons. The introduced approach manages to yield a more accurate risk field and significantly improves long-term risk assessment in complex traffic environments. Furthermore, to validate the model’s practicality in engineering, we integrated Rapidly-exploring Random Tree with spatiotemporal data-driven risk field (SRF-RRT) and conducted path-planning simulations for autonomous vehicles using real-world traffic data. The results demonstrate that the proposed model excels in both prediction accuracy and reliability, and effectively reduces the measurement error based on collision time (TTC), offering strong applicability and providing a novel theoretical foundation and technological route for path planning in intelligent connected vehicles (ICVs).}, archive = {J_ESWA}, author = {Zhuoer Wang and Baohan Shi and Jianping Zhang and Xiaowen Zhu and Jian Zhou and Bingrong Xu and Bijun Li}, doi = {10.1016/j.eswa.2025.129834}, journal = {Expert Systems with Applications}, month = {3}, pages = {129834}, shortjournal = {Expert Syst. Appl.}, title = {A data-driven spatio-temporal driving risk field mechanism for path planning}, volume = {298}, year = {2026}, }
• (2026). Automated pothole detection and volume assessment using PointPSSN and smartphone LiDAR point clouds. ESWA, 298, 129833. (www)

  @article{ , abstract = {The rapid detection and assessment of potholes are critical for ensuring road traffic safety. However, point cloud-based techniques relying on surveying vehicles or drones are often expensive and may be limited by roadside obstruction or narrow roadways. This study proposes a novel approach for assessing road potholes using point cloud data collected by smartphone LiDAR. The method integrates the Point Pothole-Specialized Segmentation Network (PointPSSN), a lightweight point cloud segmentation model designed to achieve high accuracy with low parameter complexity and rapid inference, together with scale-adjustable voxelization for assessment. The PointPSSN model incorporates a Geometric Feature Encoder module to capture the geometric attributes of potholes by extracting local geometric features. Neighbor Finder module identifies and aggregates neighboring points that provide more significant information. Experiments were conducted using a smartphone LiDAR device within a 7.28 km 2 area of Wuchang District, Wuhan, China, encompassing diverse road conditions. A dataset of 1040 potholes was constructed for model training and evaluation. The results demonstrate that the PointPSSN model achieves a segmentation accuracy of 97.336 %, precision of 91.322 %, recall of 79.888 %, an F1-score of 85.223 %, and an intersection-over-union (IoU) of 74.251 %. Notably, the accuracy, F1-score, and IoU surpass the performance of state-of-the-art models by 0.233 %, 1.336 %, and 2.006 %, respectively. In terms of efficiency, PointPSSN requires only one-seventh of the FLOPs and one-fifteenth of the parameters of state-of-the-art models, while achieving an 18.37 % faster inference speed. Furthermore, the average relative errors in depth and volume assessment using voxelization methods are 9.08 % and 9.04 %, respectively.}, archive = {J_ESWA}, author = {Tingrui Zhang and Xuequan Zhang and Zichuan Yang and Yumin Chen and Li Song and Weichen Zhang}, doi = {10.1016/j.eswa.2025.129833}, journal = {Expert Systems with Applications}, month = {3}, pages = {129833}, shortjournal = {Expert Syst. Appl.}, title = {Automated pothole detection and volume assessment using PointPSSN and smartphone LiDAR point clouds}, volume = {298}, year = {2026}, }
• (2026). PAD: Popularity-aware debiasing for high-value item recommendation. ESWA, 298, 129830. (www)

  @article{ , abstract = {Recommender systems play a crucial role in our daily lives. However, in the context of high-value item recommendation, they face significant challenges. Due to the high price of these items, user purchase histories are often extremely sparse, making it difficult for recommender systems to accurately capture user preferences. Consequently, they tend to over-rely on popularity information. Moreover, the high-value item market exhibits a pronounced imbalanced distribution, where most user interactions focus on popular items. As a result, traditional recommender systems tend to prioritize these items while rarely recommending less popular ones, leading to low recommendation coverage. To address this challenge, we propose a P opularity- A ware D ebiasing (PAD) model, which improves recommendation coverage in high-value item scenarios without compromising accuracy. First, we employ soft prompts to guide a pre-trained language model (PLM) in enriching user representations. By incorporating semantic knowledge from the PLM, our model captures more comprehensive user preferences, ensuring recommendation accuracy while mitigating the model’s dependence on popularity signals. Building upon this, we apply popularity-aware debiasing to reduce overfitting and enhance coverage. PAD prevents the recommendation model from indiscriminately recommending the most popular items to all users, encouraging it to explore a wider range of items in its recommendations. Experiments conducted on industrial and public datasets demonstrate that our method mitigates popularity bias, significantly improving item recommendation coverage while maintaining accuracy.}, archive = {J_ESWA}, author = {Yuchen Zheng and Dongming Zhao and Xiangrui Cai and Yanlong Wen and Xiaojie Yuan}, doi = {10.1016/j.eswa.2025.129830}, journal = {Expert Systems with Applications}, month = {3}, pages = {129830}, shortjournal = {Expert Syst. Appl.}, title = {PAD: Popularity-aware debiasing for high-value item recommendation}, volume = {298}, year = {2026}, }
• (2026). HWA-net: Hierarchical window aggregate network for cross-resolution remote sensing change detection. ESWA, 298, 129829. (www)

  @article{ , abstract = {Cross-resolution remote sensing change detection (CD) is a critical task in various applications, including urban monitoring, environmental changes, and disaster management, where images captured at different times often possess varying spatial resolutions. Current methods typically address this by resampling low-resolution (LR) images to high-resolution (HR) formats, but such image-level strategies lead to significant artifacts and misalignment in the change map. These imperfections not only reduce detection accuracy but also lead to misleading or false change identifications, resulting in incorrect or incomplete conclusions in time-sensitive applications, such as land-use change detection or disaster monitoring. To address these challenges, we propose the Hierarchical Window Aggregate Network(HWA-Net), a novel framework that directly operates on cross-resolution image pairs without preprocessing, aiming to accurately aggregate cross-resolution representations for robust CD. HWA-Net initially employed window-based feature extraction to produce scale-independent representations, subsequently transferring these features to layered decoding. This process effectively enhances detection accuracy across diverse resolutions. Our approach establishes new state-of-the-art results on three synthesized datasets and one real-world cross-resolution change detection dataset.}, archive = {J_ESWA}, author = {Hualin Yang and Boran Ren and Zhijun Yang and Jing Xiong and Xiying Li and Calvin Yu-Chian Chen}, doi = {10.1016/j.eswa.2025.129829}, journal = {Expert Systems with Applications}, month = {3}, pages = {129829}, shortjournal = {Expert Syst. Appl.}, title = {HWA-net: Hierarchical window aggregate network for cross-resolution remote sensing change detection}, volume = {298}, year = {2026}, }
• (2026). GRDGNN: A directed graph neural network framework for multi-relational inference of gene regulatory networks. ESWA, 298, 129827. (www)

  @article{ , abstract = {Inferring gene regulatory networks (GRNs) from gene expression data is a central challenge in systems biology. Graph neural networks (GNNs) offer a promising approach due to their ability to process graph-structured data. However, existing GNN methods for GRN inference often treat the problem as binary classification, limiting their ability to capture comprehensive regulatory relationships. This paper introduces two learning algorithms that utilize an end-to-end gene regulatory directed graph neural network (GRDGNN) schema for efficient inference of causal relationships in large-scale networks. These algorithms incorporate a directed graph neural network (DGNN) and a graph multi-classification task to identify explicit interactions between transcription factors (TFs) and target genes. The proposed approach consists of four key steps: (1) constructing a directed initial network using regression Pearson correlation and mutual information analysis, (2) extracting subgraphs of observed TF-gene pairs and applying a DGNN for information aggregation, (3) projecting the aggregated information into a low-dimensional space using graph pooling to generate graph representations of TF-gene pairs, and (4) classifying subgraphs using a multilayer perceptron (MLP) for link prediction and inference of explicit regulatory relationships. Evaluation of the DREAM5 microarray and scRNA-seq datasets demonstrates that our transductive and inductive learning methods can accurately and effectively infer explicit regulatory relationships compared to benchmark methods. These results demonstrate that the proposed GRDGNN schema exhibits strong generalization across species, data types, and modalities in cross-species, cross-data type, and cross-modality learning.}, archive = {J_ESWA}, author = {Wanhong Zhang and Zhenyu Guo}, doi = {10.1016/j.eswa.2025.129827}, journal = {Expert Systems with Applications}, month = {3}, pages = {129827}, shortjournal = {Expert Syst. Appl.}, title = {GRDGNN: A directed graph neural network framework for multi-relational inference of gene regulatory networks}, volume = {298}, year = {2026}, }
• (2026). Photovoltaic cluster power ultra-short-term cross-seasonal prediction integrating multi-channel information probabilistic diffusion generation and improved offset loss strategy. ESWA, 298, 129826. (www)

  @article{ , abstract = {Accurate photovoltaic (PV) power prediction under complex meteorological conditions remains challenging, particularly given the pronounced seasonal variations that obscure generation patterns. This study presents a novel ultra-short-term prediction framework integrating meteorological volatility analysis with seasonal characteristic modeling. We developed a specialized multi-channel Gram angular summation field (MGASF) transformation matrix to holistically capture meteorological fluctuations, subsequently leveraging denoising diffusion probabilistic model (DDPM) for strategic augmentation of under-represented weather scenarios to enhance similar-day identification. Our hybrid architecture combines multi-channel vision Transformer (VIT) with bidirectional long and short-term memory (BILSTM) networks to synergistically analyze temporal dependencies and spatial patterns in PV similarity recognition. Furthermore, we engineered a seasonal-adaptive prediction system through an improved variable-weight Smooth L1 loss function, establishing an optimized seasonal alignment mechanism that achieves high-precision prediction across varying meteorological conditions with minimal computational overhead. Through rigorous validation using operational data from a utility-scale photovoltaic cluster in Western Inner Mongolia, the proposed method achieved consistent accuracy improvements: 3.02 % reduction in N RMSE , 1.65 % decrease in N MAE , and 2.19 % enhancement in R 2 compared to baseline approaches in PV cluster. These statistically significant enhancements demonstrate our framework’s capability to mitigate seasonal impacts while maintaining prediction reliability in complex meteorological environments.}, archive = {J_ESWA}, author = {Mao Yang and Yue Jiang and Yunfeng Guo and Jianfeng Che and Wei He and Kang Wu}, doi = {10.1016/j.eswa.2025.129826}, journal = {Expert Systems with Applications}, month = {3}, pages = {129826}, shortjournal = {Expert Syst. Appl.}, title = {Photovoltaic cluster power ultra-short-term cross-seasonal prediction integrating multi-channel information probabilistic diffusion generation and improved offset loss strategy}, volume = {298}, year = {2026}, }
• (2026). Segmentation, fusion, and representation: A novel approach to multi-label classification for long texts. ESWA, 298, 129825. (www)

  @article{ , abstract = {Multi-label text classification (MLTC) is a vital task in natural language processing (NLP), often requiring high-quality text representations generated by pre-trained language models (PLMs). However, the inherent input length constraints of PLMs limit their capacity to handle long texts effectively. To address this challenge, we propose an innovative framework for multi-label long text classification. Our approach incorporates a dynamic text segmentation algorithm that optimally partitions long texts, thereby mitigating the input length limitations of PLMs. Additionally, we enhance both text and label representations by integrating external knowledge, modeling label co-occurrence relationships, and employing attention mechanisms. Extensive experiments conducted on diverse MLTC datasets demonstrate the superior performance of our method and uncover intricate relationships between texts and their associated labels. The code is available at https://github.com/Coder-Jeffrey/SKFRL}, archive = {J_ESWA}, author = {Xin Wang and Junfeng Xiao and Wang Zhang and Tao Deng and Qian Wang}, doi = {10.1016/j.eswa.2025.129825}, journal = {Expert Systems with Applications}, month = {3}, pages = {129825}, shortjournal = {Expert Syst. Appl.}, title = {Segmentation, fusion, and representation: A novel approach to multi-label classification for long texts}, volume = {298}, year = {2026}, }
• (2026). Enhanced multi-scale TCN ensemble for component chain prediction using evolutionary algorithms. ESWA, 298, 129824. (www)

  @article{ , abstract = {In software engineering, component-based development has gained significant traction due to its ability to enhance efficiency and reusability, especially as the complexity of software projects increases. A core aspect of this paradigm is component chain prediction, which intelligently infers subsequent components based on historical usage sequences, effectively reducing redundant development efforts. To overcome limitations in existing methods regarding temporal feature capture and hyperparameter optimization, we propose an Evolution algorithm-enhanced Temporal Convolutional Network ensemble model (E-TCN). This approach integrates the convolutional structure of TCN with the sequential processing capabilities of GRU and employs a dynamic threshold mechanism to improve temporal feature capture and generalization performance. Additionally, we construct a hybrid evolutionary search framework, combining the strengths of four optimization algorithms—Artificial Bee Colony (ABC), Ant Colony Optimization (ACO), Black Widow Optimization Algorithm (BWOA), and Grasshopper Optimization Algorithm (GOA)—for efficient parameter space exploration. Experimental results on real-world development datasets demonstrate a 5.9 % improvement in F1 score compared to conventional TCN models, underscoring the efficacy and practical applicability of the proposed approach in component chain prediction.}, archive = {J_ESWA}, author = {Wen Qin and Peiyang Wei and Tong Peng and Hongping Shu and Zhuoning Zhao}, doi = {10.1016/j.eswa.2025.129824}, journal = {Expert Systems with Applications}, month = {3}, pages = {129824}, shortjournal = {Expert Syst. Appl.}, title = {Enhanced multi-scale TCN ensemble for component chain prediction using evolutionary algorithms}, volume = {298}, year = {2026}, }
• (2026). Towards large-scale multi-objective feature selection: A two-stage evolutionary algorithm guided by dual feature weightings. ESWA, 298, 129823. (www)

  @article{ , abstract = {Feature Selection (FS) is a critical task in high-dimensional data processing, aiming to identify the most discriminative subset of features to improve model performance and reduce computational complexity. In recent years, multi-objective evolutionary algorithms have been widely applied to FS problems due to their ability to simultaneously optimize multiple objectives (i.e., classification accuracy and subset size for an FS problem). However, when dealing with large-scale multi-objective FS problems, existing algorithms often suffer from the vast search space and limited search capability, which makes them prone to local optima. To address these challenges, this paper proposes a two-stage evolutionary algorithm guided by dual feature weightings, named TSEA/DFW. In the first stage, an evolutionary search is performed under the guidance of the filter-based feature weighting strategy. The key features are then identified based on the population distribution and optimal solutions, thereby shrinking the search space. In the second stage, a refined search is conducted in the shrunken feature space to boost search efficiency and solution quality. To this end, a novel weighting strategy named Pareto-based hierarchical feature weighting is proposed, which captures the variation in feature performance across different non-dominated levels, reinforces the contribution of high-quality solutions, and preserves useful information from suboptimal solutions. Additionally, a novel offspring reproduction procedure guided by stage-specific feature weights is designed to further enhance search capability. Experimental results on 13 real-world datasets show that the proposed TSEA/DFW performs best on 10 datasets in terms of HV metric and on 11 datasets in terms of IGD, demonstrating the significant superiority of TSEA/DFW over seven state-of-the-art feature selection methods. The performance improvements stem from the two-stage evolutionary framework guided by dual feature weighting, which enables the early identification of important features, thereby effectively reducing the search space and enhancing search efficiency. In addition, further analysis demonstrates that the proposed TSEA/DFW has strong generality across diverse classifiers, and the developed two-stage evolutionary framework in TSEA/DFW is a general powerful framework that can integrate any mainstream FS algorithm into its second stage, exhibiting robust applicability and scalability.}, archive = {J_ESWA}, author = {Gaohui Li and Zefeng Chen and Yuren Zhou and Zhengxin Huang and Xiaoyun Xia}, doi = {10.1016/j.eswa.2025.129823}, journal = {Expert Systems with Applications}, month = {3}, pages = {129823}, shortjournal = {Expert Syst. Appl.}, title = {Towards large-scale multi-objective feature selection: A two-stage evolutionary algorithm guided by dual feature weightings}, volume = {298}, year = {2026}, }
• (2026). Multi-temporal ensemble for few-shot action recognition. ESWA, 298, 129821. (www)

  @article{ , abstract = {Few-Shot Action Recognition (FSAR) aims to recognize novel action classes with only a few labeled samples. Due to the scarcity of labeled data, FSAR models suffer from high variance and low confidence. To address this issue, this paper first introduces ensemble learning into the field of FSAR, leveraging the diversity among multiple temporal action representations to generate base models. Specifically, we propose a Multi-Temporal Ensemble (MTE) method for FSAR. By combining sub-sequences of video frames of various lengths (i.e., tuples), MTE creates multiple sets of action representations and generates base models based on these representations. All base models share a single embedding network to learn frame-level features. The proposed method adaptively captures temporal relations with different lengths and speeds while avoiding the computational cost of training multiple deep neural networks. Furthermore, we introduce a Short-term Temporal Modeling Module (STMM) that uses self-attention to highlight frames with high variation, enhancing short-term temporal representation at the frame level. The proposed method has been validated on four benchmark datasets. Extensive experimental results demonstrate that MTE outperforms 26 state-of-the-art FSAR methods. The source code is available at https://github.com/CharmainCahill/MTE.git .}, archive = {J_ESWA}, author = {Zhen Jiang and Jianlong Sun and Haodong Liu and Haizhen Guan}, doi = {10.1016/j.eswa.2025.129821}, journal = {Expert Systems with Applications}, month = {3}, pages = {129821}, shortjournal = {Expert Syst. Appl.}, title = {Multi-temporal ensemble for few-shot action recognition}, volume = {298}, year = {2026}, }
• (2026). MSIDiff:Multi-stage interaction-aware diffusion model for protein-specific 3D molecule generation. ESWA, 298, 129820. (www)

  @article{ , abstract = {Structure-based drug design (SBDD) focuses on developing 3D ligand molecules that bind with high affinity to specific protein targets, which requires the accurate capture of the complex interactions between proteins and ligands. Although existing diffusion models have demonstrated potential in molecular generation tasks, they typically consider only a single stage of the generation process. This limitation prevents them from integrating the multi-stage protein-ligand interaction information from both forward and reverse processes, which may negatively impact the binding affinity of the generated molecules. To address this problem, MSIDiff ( M ulti- S tage I nteraction-Aware Diff usion Model), a multi-stage interaction-aware diffusion model for protein-specific molecule generation, is proposed. MSIDiff leverages the pre-trained model MSINet to extract authentic protein-ligand interaction information during the initial diffusion stage and incorporates this information into the reverse process to ensure that the generated molecules accurately interact with target proteins. Through a scoring mechanism, MSIDiff filters key nodes to extract crucial protein-ligand interaction data and employs a GRU-based cross-layer interaction update module to recursively integrate information across different denoising stages, facilitating effective cross-layer information transmission. Experimental results on the CrossDocked2020 dataset show that MSIDiff can generate molecules with more realistic 3D structures and higher binding affinity to protein targets, achieving an Avg. Vina Score of up to -6.36, while maintaining appropriate molecular properties.Our code and data are available at: https://github.com/zhangyaoxiang/MSIDiff .}, archive = {J_ESWA}, author = {Yaoxiang Zhang and Junteng Ma and Ze Zhang and Zhaoyang Dong and Shuang Wang}, doi = {10.1016/j.eswa.2025.129820}, journal = {Expert Systems with Applications}, month = {3}, pages = {129820}, shortjournal = {Expert Syst. Appl.}, title = {MSIDiff:Multi-stage interaction-aware diffusion model for protein-specific 3D molecule generation}, volume = {298}, year = {2026}, }
• (2026). OSATG-GPT: Instruction-tuning large language models with open-source atomic tasks in github. ESWA, 298, 129819. (www)

  @article{ , abstract = {Across numerous application scenarios in Natural Language Processing (NLP), Large Language Models (LLMs) have demonstrated exceptional capabilities in text comprehension and generation. These models exhibit significant potential across various interdisciplinary fields. However, their effectiveness is somewhat constrained by the unique characteristics of the open-source ecosystem. Developing an LLM with generalization capabilities across datasets and tasks, specifically tailored for the open-source ecosystem, is an urgent research need. To address this challenge, this paper introduces open-source atomic tasks, which are defined as intermediate tasks essential for solving complex objectives. These tasks are designed through strategies such as simplification, reversal, decomposition, and composition, enabling models to gradually acquire domain knowledge and understand task interdependencies. By integrating public resources with open-source atomic tasks, we construct OSE-Instruct–an instruction dataset for the open-source ecosystem. We first unify open-source atomic tasks within an instruction-tuning paradigm that reflects real-world developer behavior, and develop OSATG-GPT at various parameter scales by fine-tuning the BLOOMZ backbone model on OSE-Instruct. This enables the model to learn fine-grained developer actions and the underlying task dependencies. Extensive experiments validate the effectiveness of OSATG-GPT compared to other advanced LLMs with larger parameter scales, and highlight its advantages over GPT-4 in specific and complex open-source collaboration tasks.}, archive = {J_ESWA}, author = {Fanyu Han and Li Ma and Fenglin Bi and Yantong Wang and Mingdong You and Wei Wang and Jiaheng Peng and Xiaoya Xia}, doi = {10.1016/j.eswa.2025.129819}, journal = {Expert Systems with Applications}, month = {3}, pages = {129819}, shortjournal = {Expert Syst. Appl.}, title = {OSATG-GPT: Instruction-tuning large language models with open-source atomic tasks in github}, volume = {298}, year = {2026}, }
• (2026). Markov-based continuous learning with diversion of data distribution direction for streaming data in limited memory. ESWA, 298, 129818. (www)

  @article{ , abstract = {Traditional online classifiers often require accumulating past data, leading to uncontrollable memory usage and learning times. The ideal solution is a Markov-based continuous learning approach, where a model updates using only its current state and new data. While one-pass learning with hyper-ellipsoids aligns with this principle, a critical weakness persists: classification ambiguity for data points within the overlap region where ellipsoids from different classes intersect. To solve this, this paper proposes the Diversion of Data Distribution Direction (D 4 ), a new method that implements this Markov-based approach while specifically targeting the ambiguity problem. D 4 introduces two novel mechanisms: a new adaptive width adjustment to prevent over-adjusted ellipsoid boundaries and a distribution diversion technique that resolves ambiguity by projecting data into an optimally selected subspace. The proposed D 4 method was evaluated against seven state-of-the-art online classifiers across nine benchmark datasets, having 2011 to 567,498 samples. It achieved the highest accuracy and macro F1-score on six datasets while proving to be the most computationally efficient and generating the most compact models.}, archive = {J_ESWA}, author = {Peemapat Wongsriphisant and Kitiporn Plaimas and Chidchanok Lursinsap}, doi = {10.1016/j.eswa.2025.129818}, journal = {Expert Systems with Applications}, month = {3}, pages = {129818}, shortjournal = {Expert Syst. Appl.}, title = {Markov-based continuous learning with diversion of data distribution direction for streaming data in limited memory}, volume = {298}, year = {2026}, }
• (2026). Exploiting knowledge graph communities to fine-tune large language models. ESWA, 298, 129816. (www)

  @article{ , abstract = {Since the introduction of GPT-2, Large Language Models (LLMs) have proven to be able to handle various tasks with impressive performance. However, they sometimes generate incorrect output or even hallucinations. To overcome this problem, many researchers have investigated the possibility of integrating external factual knowledge, such as that encoded in Knowledge Graphs (KGs), into LLMs. Although there are many approaches in the existing literature that integrate KGs and LLMs in different ways, few of them use KGs to fine-tune LLMs, and none of them systematically use KG substructures. In this paper, we propose CoFine (Community-Based Fine-Tuner), an approach to fine-tune an LLM using the communities of a KG. CoFine works as follows: it first divides the KG into communities, each of which contains a homogeneous portion of the knowledge expressed by the KG. It then uses these communities to fine-tune the LLM. This way of proceeding allows LLM fine-tuning to focus on specific homogeneous information contained in the KG expressed by each community. CoFine allows the LLM to achieve a very high accuracy in knowledge completion tasks. This is evidenced by comparisons between CoFine and a baseline LLM fine-tuning approach, which showed that our approach achieves better results for all metrics considered with several KG.}, archive = {J_ESWA}, author = {Alessia Amelio and Christopher Buratti and Michele Marchetti and Davide Traini and Domenico Ursino and Luca Virgili}, doi = {10.1016/j.eswa.2025.129816}, journal = {Expert Systems with Applications}, month = {3}, pages = {129816}, shortjournal = {Expert Syst. Appl.}, title = {Exploiting knowledge graph communities to fine-tune large language models}, volume = {298}, year = {2026}, }
• (2026). Multi-scale fusion graph convolutional networks. ESWA, 298, 129815. (www)

  @article{ , abstract = {Graph analysis methods, as important tools for mining complex information, have made remarkable progress driven by graph neural networks (GNNs). However, existing approaches still face challenges in handling complex topological structures and multi-dimensional node features, making it difficult to fully capture deep-level feature and structural information. When analyzing attribute networks, a key challenge is how to effectively integrate node attribute features with graph topological structure information. To address this issue, this paper proposes a multi-scale fusion graph convolutional network (MSF-GCN) method. This method combines shallow and deep convolution strategies while adaptively fusing information across three parallel channels — the original topological structure, a feature-derived graph, and a deep-combination channel that captures shared depth information between them. An autoencoder is employed to reconstruct the adjacency matrix, enhancing the representation capability of the network. Additionally, an attention mechanism is introduced to dynamically assign weights to attribute and structural features at different scales, optimizing node representation. Experimental results demonstrate that, in node classification tasks across multiple benchmark datasets, MSF-GCN achieves outstanding performance, strongly validating the effectiveness and robustness of the proposed method.}, archive = {J_ESWA}, author = {Zhi Kong and Jie Ren and Lifu Wang and Ge Guo}, doi = {10.1016/j.eswa.2025.129815}, journal = {Expert Systems with Applications}, month = {3}, pages = {129815}, shortjournal = {Expert Syst. Appl.}, title = {Multi-scale fusion graph convolutional networks}, volume = {298}, year = {2026}, }
• (2026). Integration path coverage testing of the changing driver code guided by knowledge graph. ESWA, 298, 129814. (www)

  @article{ , abstract = {Device driver code often includes several hardware driver codes. Changes to hardware driver code may thus introduce security risks to device operation. Fortunately, integration target paths are formed by multiple unit functions. These paths reflect the global execution logic of a device’s driver code. Test cases generated for these paths can detect how changing driver code affects the device’s overall operation. Therefore, this paper proposes an approach to integration path coverage testing of the changing driver code guided by knowledge graph. The proposed approach is used to generate test cases covering integration target paths that include changing driver code, queried from the knowledge graph. In the proposed approach, we first statically analyze a device’s hardware driver code, and extract defined entities and their relationships to construct a knowledge graph. From the constructed knowledge graph, we mine entities associated with the changing hardware driver code, which serve as integration target paths. The generation model of test cases is established, which is solved by an intelligent optimization algorithm, thereby generating test cases covering integration target paths. The proposed approach is applied to several open-source driver codes, and compared with several other approaches. Experiments show that the accuracy of both the knowledge graph and the integration target paths has reached 100 %. In addition, the efficiency and effectiveness of test case generation using proposed approach have improved by 19.08 % to 24.54 % and 9 % to 23 %, respectively.}, archive = {J_ESWA}, author = {Baicai Sun and Miao Rong and Gaige Wang and Dunwei Gong}, doi = {10.1016/j.eswa.2025.129814}, journal = {Expert Systems with Applications}, month = {3}, pages = {129814}, shortjournal = {Expert Syst. Appl.}, title = {Integration path coverage testing of the changing driver code guided by knowledge graph}, volume = {298}, year = {2026}, }
• (2026). An efficient deep template matching and in-plane pose estimation method via template-aware dynamic convolution. ESWA, 298, 129813. (www)

  @article{ , abstract = {In industrial inspection and component alignment tasks, template matching requires efficient estimation of a target’s position and geometric state (rotation and scaling) under complex backgrounds to support precise downstream operations. Traditional methods rely on exhaustive enumeration of angles and scales, leading to low efficiency under compound transformations. Meanwhile, most deep learning-based approaches only estimate similarity scores without explicitly modeling geometric pose, making them inadequate for real-world deployment. To overcome these limitations, we propose a lightweight end-to-end framework that reformulates template matching as joint localization and geometric regression, outputting the center coordinates, rotation angle, and independent horizontal and vertical scales. A Template-Aware Dynamic Convolution Module (TDCM) dynamically injects template features at inference to guide generalizable matching. The compact network integrates depthwise separable convolutions and pixel shuffle for efficient matching. To enable geometric-annotation-free training, we introduce a rotation-shear-based augmentation strategy with structure-aware pseudo labels. A lightweight refinement module further improves angle and scale precision via local optimization. Experiments show our 3.07M model achieves high precision and ∼ 14 ms inference under compound transformations. It also demonstrates strong robustness in small-template and multi-object scenarios, making it highly suitable for deployment in real-time industrial applications. The code is available at: https://github.com/ZhouJ6610/PoseMatch-TDCM .}, archive = {J_ESWA}, author = {Ke Jia and Ji Zhou and Hanxin Li and Zhigan Zhou and Haojie Chu and Xiaojie Li}, doi = {10.1016/j.eswa.2025.129813}, journal = {Expert Systems with Applications}, month = {3}, pages = {129813}, shortjournal = {Expert Syst. Appl.}, title = {An efficient deep template matching and in-plane pose estimation method via template-aware dynamic convolution}, volume = {298}, year = {2026}, }
• (2026). GraphShield: Advanced dynamic graph-based malware detection using graph neural networks. ESWA, 298, 129812. (www)

  @article{ , abstract = {The rising complexity of modern malware-such as polymorphic, fileless, and sandbox-aware variants-has severely diminished the reliability of conventional detection techniques. Models based on sequential data frequently miss intricate behavioral patterns and long-range dependencies, resulting in poor accuracy and limited adaptability to new threats. This paper introduces GraphShield, a graph-centric behavioral detection framework that identifies malware with high precision by analyzing dynamic API call sequences. GraphShield converts raw API calls into temporal graphs, applies semantic vectorization, and leverages attention mechanisms to extract both localized activity and extended behavioral correlations, directly addressing the weaknesses of earlier systems. We design and assess multiple Graph Neural Network (GNN) variants, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), Graph Isomorphism Networks (GINs), and Transformer-based architectures combining convolutional, recurrent, and autoencoding layers. These models capture structural and temporal traits of execution traces using both classification-only and combined classification-reconstruction strategies. To enhance transparency, we incorporate GNN interpretation tools that isolate key API call subgraphs and critical decision pathways, making detection outcomes explainable for analysts. GraphShield is trained on 300,000 balanced instances and tested on a separate 200,000-sample holdout set, achieving over 58 % improvement in accuracy over advanced sequence-driven deep learning models while maintaining a false positive rate under 1 %. Key features include BERT-based API call grouping for reducing dimensionality and a Markov-inspired graph stabilization method for managing graphs of variable length. Our top models attain a 99.5 % F1-score on the test set. GraphShield aligns recent graph learning techniques with operational cybersecurity needs, delivering accurate detection and clear, interpretable results.}, archive = {J_ESWA}, author = {Eslam Amer and Shaker El-Sappagh and Tamer Abuhamad and Bander Ali Saleh Al-Rimy and Alaa Mohasseb}, doi = {10.1016/j.eswa.2025.129812}, journal = {Expert Systems with Applications}, month = {3}, pages = {129812}, shortjournal = {Expert Syst. Appl.}, title = {GraphShield: Advanced dynamic graph-based malware detection using graph neural networks}, volume = {298}, year = {2026}, }
• (2026). LFRSCNet: Skin defect detection based on lightweight flexible residual separable convolutional network. ESWA, 298, 129811. (www)

  @article{ , abstract = {Aircraft skin is prone to surface damage, such as cracks and dents, during long-term service or manufacturing processes. These defects not only threaten structural integrity but may also pose potential safety hazards. The industrial sector continually explores more efficient and precise detection methods to address this issue. Therefore, this paper proposes a skin defect detection method based on a lightweight and flexible residual separation convolutional network to improve detection accuracy and efficiency. Therefore, this paper proposes a skin defect detection method based on a lightweight flexible residual separable convolution network to improve detection accuracy and efficiency. First, a lightweight flexible residual separable convolution module (LFRCM) is designed, which effectively integrates multi-modal features by combining multi-scale receptive fields with an adaptive channel attention mechanism; at the same time, a lightweight backbone network based on PP-LCNet is constructed, employing a collaborative optimization strategy of depthwise separable convolutions and the h-swish activation function to significantly enhance inference speed while maintaining detection accuracy; finally, the MPDIoU metric criterion is introduced, which effectively improves target localization accuracy by implementing a center point offset penalty mechanism. Experiments on the self-built professional dataset SD-DET and the public dataset GC10-DET show that the model achieves mAP@0.5 of 99.5% and 86.2%, respectively, demonstrating significant advantages over mainstream detection models. Systematic ablation experiments confirm the synergistic effect of various innovative modules. Finally, verification experiments are conducted on the AIRCRAFT skin defect dataset, achieving an mAP@0.5 of 30.7%. Quantitative analysis and comparative experiments verify that LFRSCNet can achieve detection accuracy breakthroughs while maintaining low parameter counts and computational costs. Its balanced accuracy-efficiency characteristics provide an efficient and reliable solution for surface defect detection in industrial scenarios.}, archive = {J_ESWA}, author = {Zhenyu Lu and Jue Wang and Jiteng Zhu and Yuwen Sun}, doi = {10.1016/j.eswa.2025.129811}, journal = {Expert Systems with Applications}, month = {3}, pages = {129811}, shortjournal = {Expert Syst. Appl.}, title = {LFRSCNet: Skin defect detection based on lightweight flexible residual separable convolutional network}, volume = {298}, year = {2026}, }
• (2026). The knowledge-driven adaptive late acceptance iterative hill-climbing heuristics for the bus and ADR collaborative delivery problem. ESWA, 298, 129810. (www)

  @article{ , abstract = {Urban-rural bus transit services encounter a dilemma between the necessity for enhanced services and the challenge of low profitability due to scant travel demand. Combining freight transportation with passenger services can enhance the efficiency and profitability of buses in both urban and rural areas, while also reducing environmental impacts. A case in point is the integration of freight deliveries into rural bus networks in China. Concurrently, with the advancement of autonomous delivery robot (ADR) technology, there is a growing deployment of ADRs for last-mile delivery purposes. In this paper, we have studied a new collaborative passenger and freight transportation problem involving buses and ADRs, namely, the bus and ADR collaborative delivery problem (BACDP). In this scenario, a bus route transports several ADRs, which carry multiple parcels, to distribution regions for door-to-door delivery, each ADR boards a bus to reach the sub-region and then boards another bus to return to the distribution center. We have proposed a mathematical model for BACDP, which can be decomposed into a master problem and a sub-problem. and the condition that the optimal solution to the master problem is also the optimal solution to the original problem has been proved. To tackle the BACDP effectively, we designed a novel three-stage iterative method, guided by adaptive late acceptance hill-climbing heuristics (ALAHH). Specifically, at the first stage, the k-means++ and Hamiltonian graph-guided algorithms are used to cluster customers; at the second stage, the variable neighborhood search plans the ADRs’ routes; at the third stage, we utilize the solver to address subproblems, and the evaluation and invocation mechanism is proposed to achieve the efficient utilization of solvers. Extensive experiments have been conducted on synthetic instances of varying scales to investigate the efficiency of ALAHH. The experimental results demonstrate that the objective values and the computation time are significantly lower than those of SA and LAHC, and our algorithm has achieved the best solutions for 16 problems to date. Additionally, the impacts of two key parameters and mechanisms have been analyzed, and further validation of the robustness of the algorithm parameters and the effectiveness of the mechanisms.}, archive = {J_ESWA}, author = {Lijun Pan and Changshi Liu and Yifan Zhang and Shun Li}, doi = {10.1016/j.eswa.2025.129810}, journal = {Expert Systems with Applications}, month = {3}, pages = {129810}, shortjournal = {Expert Syst. Appl.}, title = {The knowledge-driven adaptive late acceptance iterative hill-climbing heuristics for the bus and ADR collaborative delivery problem}, volume = {298}, year = {2026}, }
• (2026). Future-aware user intent modeling with knowledge distillation for sequential recommendation. ESWA, 298, 129809. (www)

  @article{ , abstract = {With the continuous development of recommender systems, leveraging users’ future interactions to capture the evolution of preferences in sequential behaviors has become a key focus in Sequential Recommendation (SR). Although current approaches have made notable progress, several important challenges persist: 1) An excessive dependence on historical interactions limits the ability to effectively model the evolution of user preferences. 2) There is a lack of mechanisms to capture the dynamic transition path between historical and future behaviors. 3) Existing denoising techniques often fail to fully consider the semantic information in behavior denoising. To address these issues, we propose an SR framework—Future Distillation Recommendation (FDistRec), which introduces the following strategies: To tackle Limitation 1, we incorporate future interaction data to help alleviate the constraints posed by relying on past behaviors. To address Limitation 2, we adopt a distillation framework along with the Causal Mixture-of-Experts (CMoE) module, effectively capturing the evolution and shift path in user interests. To overcome Limitation 3, we present a Masked Denoising Variational Auto Encoder (MDVAE) model that applies semantic-aware masking to perturb user behaviors, facilitating generative preference modeling and noise-aware interest recovery. Experiments on five real-world datasets demonstrate the superior performance of FDistRec compared to the SOTA baselines on SR.}, archive = {J_ESWA}, author = {Xinhua Wang and Xiaodi Liu and Wensheng Sun and GuiyuanJiang and Feng Yuan and Lei Guo}, doi = {10.1016/j.eswa.2025.129809}, journal = {Expert Systems with Applications}, month = {3}, pages = {129809}, shortjournal = {Expert Syst. Appl.}, title = {Future-aware user intent modeling with knowledge distillation for sequential recommendation}, volume = {298}, year = {2026}, }
• (2026). Simultaneous multi-objective path planning with cumulative hazardous dosage constraint for mobile detection robots in complex environments. ESWA, 298, 129808. (www)

  @article{ , abstract = {Path planning for a mobile robot operating in complex hazardous environments often requires simultaneous optimization of multiple objectives, such as minimal path length, low energy consumption, and safe passing under cumulative hazard dosage (CHD) constraint. Available methods, involving deterministic algorithms and meta -heuristic algorithms, have drawbacks in solving this problem to meet these simultaneous requirements. A flexible jump point search strategy (FlexJPS) is proposed to address the problem. In the scheme, jump points are divided into two categories, dominant waypoints (DWPs) and linkage jump points (LJPs). Each DWP is flexibly assigned to one limited zone and all the limited zones are distributed in a spaced form in the grid-based environment. The LJPs are generated in a limited short range by the modified jump point search rule. The DWPs followed by LJPs are evaluated by a designed multi-operator differential evolution algorithm to achieve the optimal solution meeting the safe passing constraint. Various experiments are carried out to validate the performance of the proposed scheme with comparisons to feasible famous counterparts. Statistical results and achieved planning success rates from the experiments under stringent CHD constraint indicate superior performance of the proposed method. It is concluded that the proposed method contributes a high-efficacy multi-objective path planning method for a mobile robot operating in complex environments with CHD constraint.}, archive = {J_ESWA}, author = {Xiankun Lin and Xiaoting Peng and Linsen Liang}, doi = {10.1016/j.eswa.2025.129808}, journal = {Expert Systems with Applications}, month = {3}, pages = {129808}, shortjournal = {Expert Syst. Appl.}, title = {Simultaneous multi-objective path planning with cumulative hazardous dosage constraint for mobile detection robots in complex environments}, volume = {298}, year = {2026}, }
• (2026). A multi-domain feature-based epileptic seizure prediction method using EEG source estimation and graph theory. ESWA, 298, 129807. (www)

  @article{ , abstract = {Epilepsy is a disorder caused by abnormal discharges of cerebral neurons, affecting 50 million people worldwide. Most existing research on seizure prediction remains at the scalp level. To explore and harness the potential of information flow among cortical regions as well as the intrinsic brain networks and functional mechanisms for seizure prediction, this study proposes a novel multi-domain feature fusion seizure prediction framework based on Electroencephalography (EEG) source estimation and graph theory. Specifically, dSPM source estimation and singular value decomposition (SVD) are first applied to extract 44 subcortical regions defined by the “HCPMMP1_combined” atlas. Brain networks are then constructed using coherence (COH) and phase lag index (PLI), from which specific network topological features based on graph theory are calculated. These features are further extended to higher-order brain networks to enhance connectivity modeling. We also build a multi-domain feature hybrid (MFH) prediction model that adopts a multi-branch structure. One branch employs hypergraph convolution attention along with time–frequency node features derived from continuous wavelet transform (CWT) to capture high-order spatial correlations; another branch inputs the temporal signals from cortical brain regions and combines the hybrid Mamba2-Transformer expert (HMT) model with a frequency-domain dot-product channel attention network (FDCA). By fusing these branches, the model demonstrates satisfactory results across multiple age-groups in the epilepsy EEG dataset of Gansu Province Central Hospital, as well as in the CHB − MIT dataset. This framework highlights the potential of integrating source estimation, hypergraph analysis, and multi-domain feature learning for personalized seizure prediction.}, archive = {J_ESWA}, author = {Bingyang Ji and Wenwen Chang and Guanghui Yan and Dandan Li and Rong Yin and Xuan Liu and Yaxuan Wei}, doi = {10.1016/j.eswa.2025.129807}, journal = {Expert Systems with Applications}, month = {3}, pages = {129807}, shortjournal = {Expert Syst. Appl.}, title = {A multi-domain feature-based epileptic seizure prediction method using EEG source estimation and graph theory}, volume = {298}, year = {2026}, }
• (2026). Multi-hop commonsense knowledge injection framework for zero-shot commonsense question answering. ESWA, 298, 129806. (www)

  @article{ , abstract = {Zero-shot commonsense question answering (QA) task is to evaluate the general reasoning ability of the language model without training on the specific datasets. The existing zero-shot framework transforms triples within the commonsense knowledge graphs (KGs) into QA-format samples, serving as a pre-training data source to integrate commonsense knowledge into the language model. However, this approach still faces the following challenges: 1) The model trained from synthetic QA generated from triples lacks the multi-hop commonsense knowledge required for handling complex QA problems. 2) Ambiguity caused by confusing commonsense knowledge within synthetic QA, making it challenging for models to discern semantically similar entities. To address the above problem, we propose a novel M ulti-hop C ommonsense K nowledge I njection Framework (MCKI). Specifically, we draw inspiration from human complex reasoning thinking and further propose a synthetic multi-hop commonsense QA generation method. Meanwhile, we introduce negative samples with high confusion in synthetic QA, and then use contrastive learning to improve the model’s ability to distinguish similar commonsense knowledge. Extensive experiments on five commonsense question answering benchmarks demonstrate that our framework achieves state-of-the-art performance, surpassing existing methods, including large language models like GPT3.5 and ChatGPT.}, archive = {J_ESWA}, author = {Xin Guan and Jiuxin Cao and Biwei Cao and Qingqing Gao and Bo Liu}, doi = {10.1016/j.eswa.2025.129806}, journal = {Expert Systems with Applications}, month = {3}, pages = {129806}, shortjournal = {Expert Syst. Appl.}, title = {Multi-hop commonsense knowledge injection framework for zero-shot commonsense question answering}, volume = {298}, year = {2026}, }
• (2026). CR-GAC: Cross-modal recombination via graph-attention collaborative optimization for multimodal sentiment analysis. ESWA, 298, 129805. (www)

  @article{ , abstract = {Multimodal sentiment analysis integrates linguistic, audio, and visual modalities for predicting human emotional states. However, current algorithms encounter three challenges: limitations in adjacency matrix modeling, noise interference and modality imbalances in cross-modal attention, and inefficient cross-modal feature alignment. To address these, we propose the C ross-modal R ecombination via G raph- A ttention C ollaborative Optimization (CR-GAC) by unifying graph and sequence learning in a collaborative framework. Specifically, we first design the modality-adaptive M ultimodal G raph C onstruction (MGC) to tackle the first challenge. For the linguistic modality, a local sparse graph based on a K-Nearest Neighbors-Radial Basis Function kernel is designed to preserve fine-grained semantics; for the audio and visual modalities, a low-rank representation method combined with nuclear norm regularization is designed to capture latent cross-sample structures via singular value decomposition, while suppressing noise interference. Modalities that have been processed are then input into graph attention networks to achieve higher-order feature aggregation. Next, we construct the L anguage-guided H ierarchical C ross-modal I nteraction (LHCI) to tackle the second challenge, which leverages bidirectional cross-modal attention and multi-level Transformer blocks to hierarchically enhance feature representations. Subsequently, the H igh-level M ultimodal F eature C ontainer (HMFC) iteratively accumulates multi-grained semantics, providing a high-level feature pool for fusion. Finally, the dynamic matching-based H igh-level F eature R ecombination (HFR) is designed to tackle the third challenge, which uses the linguistic feature as an anchor to achieve semantically controllable explicit alignment and flexible implicit alignment by matching the most relevant features. Experimental results show our model achieves state-of-the-art performance on CMU-MOSI and CMU-MOSEI datasets, and demonstrates generalization capability on CH-SIMS dataset.}, archive = {J_ESWA}, author = {Haoran Chen and Jiapeng Liu and Zuhe Li and Yushan Pan and Hongwei Tao and Huaiguang Wu and Yunyang Wang and Chenguang Yang}, doi = {10.1016/j.eswa.2025.129805}, journal = {Expert Systems with Applications}, month = {3}, pages = {129805}, shortjournal = {Expert Syst. Appl.}, title = {CR-GAC: Cross-modal recombination via graph-attention collaborative optimization for multimodal sentiment analysis}, volume = {298}, year = {2026}, }
• (2026). Sustainable time-dependent intermodal hub-and-spoke logistic network considering hub failure: A mathematical model and a hybrid artificial bee colony algorithm. ESWA, 298, 129804. (www)

  @article{ , abstract = {This paper addresses the design of a sustainable hub-and-spoke logistics network that integrates intermodal transportation between the hubs, hub failures, time dependency, and environmental parameters. Accordingly, we propose a novel mixed-integer linear programming (MILP) model and a hybrid artificial bee colony-based algorithm (HABCb) to minimize transportation costs and emissions in robust network configurations. The model is the first to simultaneously integrate intermodality, sustainability metrics, and hub disruption scenarios within a single framework. Computational experiments using real-life data from Turkey demonstrate that the proposed HABCb approach outperforms both genetic algorithm (GA) and artificial bee colony (ABC) algorithm. On medium-sized problem sets, it achieves average cost reductions of 7% compared to GA and 10% compared to ABC algorithm, while on large-sized problems the reductions are 10% and 15%, respectively. Furthermore, the HABCb approach provides faster convergence and higher-quality solutions for larger problem sizes. The findings highlight the practical and theoretical insights of incorporating sustainability, intermodality, and robustness into hub-and-spoke network design.}, archive = {J_ESWA}, author = {Burcu Tokbay Erkek and Salih Himmetoğlu and Yılmaz Delice and Emel Kızılkaya Aydoğan}, doi = {10.1016/j.eswa.2025.129804}, journal = {Expert Systems with Applications}, month = {3}, pages = {129804}, shortjournal = {Expert Syst. Appl.}, title = {Sustainable time-dependent intermodal hub-and-spoke logistic network considering hub failure: A mathematical model and a hybrid artificial bee colony algorithm}, volume = {298}, year = {2026}, }
• (2026). A belief rule-based system for online and centralized collaborative performance assessment of networked physical systems subject to nonideal channels. ESWA, 298, 129803. (www)

  @article{ , abstract = {Networked physical systems (NPSs) are widely applied in modern engineering practices characterized by intensive domain knowledge and imperfect observational data. Meanwhile, collaborative performance assessment provides strong support for them to operate safely and stably over a long period of time. For a specific NPS and its corresponding online and centralized collaborative performance assessment system, the existence of interference and noise in the real-world channel that is rather nonideal inevitably obstructs the smooth progress of the assessment. To this end, in this paper, a symbolic systematic solution is proposed resorting to an improved version of the belief rule base with continuous inputs (BRB-CI). First, the extrapolation module is enhanced by integrating a matched filtering-based link. Second, the existing robustness analysis for systems based on the fundamental belief rule base is extended to systems based on the BRB-CI. Third, the optimization module is ameliorated by designing a multimetric-balanced pattern of the grey wolf optimizer with interpretability reinforcement. Ultimately, by choosing an instance of NPSs in the field of aerospace with continuous time dynamics, pertinent empirical studies are carried out to substantiate the good engineering practicability of our proposal. Note that this paper is the first piece inquiring into belief rule-based systems such a class of expert systems for online and centralized cooperative performance assessment of NPSs with continuous time dynamics such an application, with considerable attention paid to the nonideality of real-world channels.}, archive = {J_ESWA}, author = {Haoran Zhang and Lining Xing and Jian Wu and Ruohan Yang and Zhichao Feng}, doi = {10.1016/j.eswa.2025.129803}, journal = {Expert Systems with Applications}, month = {3}, pages = {129803}, shortjournal = {Expert Syst. Appl.}, title = {A belief rule-based system for online and centralized collaborative performance assessment of networked physical systems subject to nonideal channels}, volume = {298}, year = {2026}, }
• (2026). E2D-GS: Event-enhanced deblurring gaussian splatting. ESWA, 298, 129802. (www)

  @article{ , abstract = {In recent years, implicit neural representations and explicit 3D Gaussian Splatting(3DGS) have demonstrated substantial advancements in the domain of novel view synthesis. Nevertheless, the efficacy of these approaches is predominantly contingent upon the availability of well-defined, clear imagery and precise camera pose information. Consequently, they exhibit a pronounced susceptibility to motion blur, which impedes the rendering of sharp images. Event cameras, which measure intensity changes with microsecond temporal precision, possess an inherent robustness to motion-induced blur. This characteristic offers new avenues for 3D reconstruction in challenging scenarios characterized by high-speed motion or low-light conditions. This paper introduces E2D-GS, a novel algorithm for deblurring and reconstruction based on event cameras and 3D Gaussian Splatting. To enhance reconstruction accuracy, our proposed framework leverages event streams to physically model the formation process of motion blur. This is achieved by optimizing the discrepancy between synthesized data and the observed blurry images, while simultaneously recovering the camera’s motion trajectory. Additionally, to enhance robustness in real-world scenarios, this paper proposes a differential consistency module. This module effectively mitigates noise within the event data and regularizes the optimization of Gaussian parameters, thereby improving reconstruction quality under non-ideal conditions. Comprehensive experimental evaluations on both simulated and real-world benchmarks validate the proposed method’s capability to reconstruct latent sharp imagery via the learned 3DGS representations, and further demonstrate its capacity for stable reconstruction under adverse scenarios. The results show that our approach surpasses the performance of previous works.}, archive = {J_ESWA}, author = {Lifeng Lin and Shuangjie Yuan and Lu Yang}, doi = {10.1016/j.eswa.2025.129802}, journal = {Expert Systems with Applications}, month = {3}, pages = {129802}, shortjournal = {Expert Syst. Appl.}, title = {E2D-GS: Event-enhanced deblurring gaussian splatting}, volume = {298}, year = {2026}, }
• (2026). Adaptive gated universal information extraction for chinese legal texts. ESWA, 298, 129801. (www)

  @article{ , abstract = {Constructing knowledge graphs in legal domains requires simultaneous extraction of entities and relations. To reduce repeated modeling in traditional approaches, we adopt the Universal Information Extraction (UIE) model as a foundation and propose an enhanced variant named Adaptive Gated Universal Information Extraction (AGUIE). This study develops a new decoder based on the Adaptive Focusing Gated Attention Unit (AFGAU). This unit enhances the standard Gated Attention Unit (GAU) by integrating two key components—learnable dynamic convolution and reset/update gating mechanisms. Moreover, the study employs a cross-pointer structure as the output layer to better identify information boundaries. To support this study, we construct a domain specific dataset for extracting key information from legal judgment documents. Systematic comparative analysis and ablation studies demonstrate that AGUIE achieves significant performance gains over baseline UIE, with an F1 score of 85.56% on our legal judgment documents dataset. Additionally, we evaluate the model’s generalization on public datasets such as ACE04, ACE05, and CoNLL04, covering both entity recognition and relation extraction tasks. Experimental results indicate that AGUIE demonstrates competitive results with recent studies on ACE04-Ent and CoNLL04, outperforms them on the ACE05 dataset, achieving F1 scores of 87.19% on ACE05-Ent and 79.29% on ACE05-Rel. In conclusion, AGUIE is a reliable and effective solution for universal information extraction in both legal and general domains.}, archive = {J_ESWA}, author = {Yabo Liu and Yatong Zhou and Kuo-Ping Lin}, doi = {10.1016/j.eswa.2025.129801}, journal = {Expert Systems with Applications}, month = {3}, pages = {129801}, shortjournal = {Expert Syst. Appl.}, title = {Adaptive gated universal information extraction for chinese legal texts}, volume = {298}, year = {2026}, }
• (2026). Radiomics knowledge-driven deep learning framework for breast cancer ultrasound video diagnosis. ESWA, 298, 129800. (www)

  @article{ , abstract = {Early and accurate diagnosis of breast cancer is essential. However, the absence of expert knowledge guidance often hampers the performance and clinical applicability of existing automated cancer diagnostic models. Radiomics indicators serve as important references for physicians during clinical diagnosis; nevertheless, limited research has incorporated such domain knowledge into deep learning frameworks. Therefore, we propose a radiomics knowledge-driven deep learning framework for breast cancer diagnosis based on dual-amplitude contrast-enhanced ultrasound (CEUS) videos. The framework employs a three-branch video classification network augmented by a three-step knowledge guidance process. This process begins with radiomics knowledge extraction, deriving both numerical and categorical features from the video data. Quantitative knowledge fusion then integrates these numerical features using numerical bin encoding and the spatio-temporal causal module. Finally, qualitative knowledge fusion incorporates categorical features via label embedding and the multi-label calibrated loss, aligning model outputs with categorical features. Extensive experiments on triple-class cancer classification demonstrate superior performance, achieving an AUC of 94.50 % ± 1.50 % and an accuracy of 83.88 % ± 1.94 %, while providing symptom analysis results as clinical decision support. Furthermore, our framework achieves consistent performance gains when applied to other deep learning models, highlighting its broad applicability and potential for advancing medical diagnosis. Code is available at https://github.com/tobenan/radiomics .}, archive = {J_ESWA}, author = {Dinghao Guo and Zheng Xue and Dali Chen and Chunyu Lu and Jun Fu and Jizhong Yuan and Ying Huang}, doi = {10.1016/j.eswa.2025.129800}, journal = {Expert Systems with Applications}, month = {3}, pages = {129800}, shortjournal = {Expert Syst. Appl.}, title = {Radiomics knowledge-driven deep learning framework for breast cancer ultrasound video diagnosis}, volume = {298}, year = {2026}, }
• (2026). A hybrid graph and LLM approach for measuring scientific novelty via knowledge recombination and propagation. ESWA, 298, 129794. (www)

  @article{ , abstract = {Scientific novelty constitutes a fundamental catalyst for both disciplinary innovation and interdisciplinary progress. Nevertheless, prevailing approaches to novelty assessment predominantly emphasize a single analytical dimension–either the semantic content of the focal paper or its cited references. Content-based methodologies frequently fail to incorporate the foundational knowledge cited by the target publication, whereas reference-based strategies tend to disregard the intrinsic conceptual contributions of the focal work itself. To address this limitation, the present study introduces a hybrid graph and large language model approach to jointly capture and integrate knowledge embedded in both the focal paper and its cited literature. The proposed method, which integrates knowledge recombination and propagation, is structured into four primary stages. First, prompt-based extraction techniques using general LLMs are applied to extract knowledge. Second, a Reference Knowledge Combination Network (RKCN) is constructed to model the knowledge referenced by the focal paper. Third, the RKCN is initialized with representations generated by SciDeBERTa(CS), and a graph attention network is employed to propagate knowledge across the network. Finally, the novelty of the focal paper is quantified by aggregating the novelty scores of all internal knowledge combinations based on the propagated representations. Experimental evaluation in the domain of artificial intelligence (AI) demonstrates that the proposed method significantly outperforms existing baseline approaches in quantifying scientific novelty. Additional ablation studies further validate the contribution of the knowledge propagation module. A case study illustrates the interpretability of our approach, and a cross-field validation in Biomedical Engineering (BME) domain highlights its robustness and cross-domain generalizability. A multi-dimensional comparative analysis between award-winning and non-award papers further reveals that the former generally incorporate a larger volume of knowledge and exhibit greater diversity in knowledge combinations. Moreover, while both groups encompass knowledge combinations spanning a wide range of novelty, award-winning papers display a stronger concentration at higher novelty levels, in contrast to the more uniform distribution observed in non-award papers. Data, code, and more detailed results are publicly available at: https://github.com/haihua0913/graphLLM4ScientificNovelty .}, archive = {J_ESWA}, author = {Zhongyi Wang and Zeren Wang and Guangzhao Zhang and Jiangping Chen and Markus Luczak-Roesch and Haihua Chen}, doi = {10.1016/j.eswa.2025.129794}, journal = {Expert Systems with Applications}, month = {3}, pages = {129794}, shortjournal = {Expert Syst. Appl.}, title = {A hybrid graph and LLM approach for measuring scientific novelty via knowledge recombination and propagation}, volume = {298}, year = {2026}, }
• (2026). Graph-based approaches for rumor detection in social networks: A systematic review. ESWA, 298, 129786. (www)

  @article{ , abstract = {Increased public anxiety and fear, disrupted decision-making, social instability, and other significant societal challenges are the results of the rapid spread of rumors on social media platforms. The unique characteristics of these platforms contribute to the rapid spread of both verified and unverified information. These pressing issues highlight the need to develop advanced technologies for early detection and prevention of rumors. This paper presents a systematic review of graph-based approaches for rumor detection in social networks, analyzing 53 studies published between 2018 and 2025. The selected studies are comprehensively reviewed with a focus on graph models and the integration of propagation structure, social, temporal, and content features, which enhances detection accuracy. This review critically evaluates the effectiveness of various methods, highlighting their strengths, limitations, and key challenges. The key contributions of this paper include: (i) an in-depth analysis of current graph-based rumor detection approaches (ii) a categorization of graph models and feature extraction strategies, (iii) the identification of major challenges and research gaps, and (iv) recommendations for future research to develop scalable, robust, and accurate early rumor detection systems. The findings of this study provide valuable insights for researchers aiming to advance the state-of-the-art in fighting misinformation on social networks.}, archive = {J_ESWA}, author = {Fatima Al-Thulaia and Seyyed Alireza Hashemi Golpayegani}, doi = {10.1016/j.eswa.2025.129786}, journal = {Expert Systems with Applications}, month = {3}, pages = {129786}, shortjournal = {Expert Syst. Appl.}, title = {Graph-based approaches for rumor detection in social networks: A systematic review}, volume = {298}, year = {2026}, }
• (2026). Spatiotemporal online fuzzy modeling with knowledge-driven differential evolution automatic clustering for distributed parameter systems. ESWA, 298, 129785. (www)

  @article{ , abstract = {Distributed parameter systems are prevalent in various industrial processes and attract significant attention. However, these systems exhibit complex spatiotemporal coupling characteristics, and effectively determining the fuzzy rules of the antecedent set is crucial for improving modeling performance. Traditional clustering methods typically rely on empirical heuristics and are unable to adapt to dynamic system characteristics under changing environments. In high-dimensional and nonlinear scenarios, the number of fuzzy rule combinations grows exponentially, significantly increasing computational complexity. Therefore, an online spatiotemporal three-dimensional fuzzy modeling method based on knowledge-driven differential evolution automatic clustering and extreme learning machine (3D-OSADE-ELM) is proposed for the complex nonlinear distributed parameter system. First, an automatic clustering mechanism based on differential evolution and extreme learning machine initializes the fuzzy rules within the three-dimensional fuzzy system. Subsequently, a knowledge-driven archiving mechanism dynamically updates the fuzzy rules of the antecedent set during the online incremental learning phase. Finally, the spatial basis function is obtained by learning the output weight of the online extreme learning machine. The validation experiments conducted on the rapid thermal chemical vapor deposition reactor system and the nonisothermal packed-bed system demonstrate the effectiveness and superiority of the proposed method.}, archive = {J_ESWA}, author = {Gang Zhou and Xianxia Zhang and Bing Wang}, doi = {10.1016/j.eswa.2025.129785}, journal = {Expert Systems with Applications}, month = {3}, pages = {129785}, shortjournal = {Expert Syst. Appl.}, title = {Spatiotemporal online fuzzy modeling with knowledge-driven differential evolution automatic clustering for distributed parameter systems}, volume = {298}, year = {2026}, }
• (2026). CG-TRAN: A novel multi-label retinal disease classification model with partially known pathologies. ESWA, 298, 129784. (www)

  @article{ , abstract = {Early detection of retinal diseases is vital to preventing partial or permanent blindness. However, the diagnostic process is often impeded by the complexity of interrelated lesions and the challenge of incomplete or missing pathology labels, which require specialized expertise in ophthalmic diagnosis. To address these limitations, we propose CG-Tran, a novel multi-label classification model that leverages partially known pathology information to diagnose retinal diseases. This approach integrates a pathology graph neural network with graph-based feature extraction to handle partially known pathologies, enabling more accurate multi-label classification of retinal diseases. To model the intricate interrelationships among ocular diseases, CG-Tran employs BERT-GNN to learn label interactions and construct a comprehensive fundus pathology graph. Additionally, an enhanced attention mechanism incorporates known pathology label features, bridging the gap between incomplete pathology information and fundus image data. These innovations collectively empower the model to overcome the challenges of missing or incomplete pathology labels. The model’s performance is rigorously evaluated on the Multilabel Retinal Disease (MuReD) dataset. Results demonstrate that CG-Tran significantly improves diagnostic accuracy, especially as more pathology labels become available. Under conditions with 0% and 75% partially known labels, CG-Tran achieves mean average precision (mAP) scores of 69.9% and 72.1%, respectively—outperforming the baseline model by 1.0% and 1.9%. This innovative architecture excels in multi-label classification tasks, particularly in recognizing and distinguishing complex and interrelated retinal lesions with partially known pathology. It offers a promising solution for early detection and accurate diagnosis of retinal diseases, addressing critical limitations in existing diagnostic methods.}, archive = {J_ESWA}, author = {Jia Sheng Yang and Zihao Ning and Xu Xiao and Rui Zhong and Chenbo Xia and Ya Ding}, doi = {10.1016/j.eswa.2025.129784}, journal = {Expert Systems with Applications}, month = {3}, pages = {129784}, shortjournal = {Expert Syst. Appl.}, title = {CG-TRAN: A novel multi-label retinal disease classification model with partially known pathologies}, volume = {298}, year = {2026}, }
• (2026). Time-balanced MSE for machinery imbalanced degradation trend prediction. ESWA, 298, 129783. (www)

  @article{ , abstract = {Accurate degradation trend prediction (DTP) is crucial for optimizing equipment operation and maintenance. With the rapid development of artificial intelligence, many data-driven methods have been applied to machinery degradation trend prediction. In practice, most machineries are in the early stages of degradation, with only a few reaching the final stages, leading to a temporal imbalanced data distribution. Current research on imbalanced distributions mainly focuses on classification tasks. However, DTP involves multiple time-dependent continuous targets, making classification-based methods unsuitable. To address this issue, the degradation trend prediction task is reformulated as a multi-task problem and a novel time-balanced Mean Square Error (TBMSE) loss function is proposed. In each prediction task, the Gaussian Mixture Model (GMM) is used to fit the training label distribution. Additionally, the cumulative information noise for each prediction task is modeled using GMM, and an end-to-end network structure is designed to learn the GMM parameters. Experiments are conducted on the IMS bearing dataset and the turboprop engine dataset, demonstrating that the TBMSE loss effectively mitigates the issue of temporal imbalanced distribution in degradation trend prediction.}, archive = {J_ESWA}, author = {Yu-Qiang Wang and Yong-Ping Zhao and Tian-Ding Zhang and Yu-Wei Wang}, doi = {10.1016/j.eswa.2025.129783}, journal = {Expert Systems with Applications}, month = {3}, pages = {129783}, shortjournal = {Expert Syst. Appl.}, title = {Time-balanced MSE for machinery imbalanced degradation trend prediction}, volume = {298}, year = {2026}, }
• (2026). Differentiable histogram-guided unsupervised retinex enhancement for paired low-light images. ESWA, 298, 129782. (www)

  @article{ , abstract = {Most existing low-light image enhancement (LIE) methods rely on expensive paired low-light and normal-light datasets, while unsupervised approaches depend on handcrafted priors to design networks or select similar normal-light images as pseudo-references, limiting their generalization and robustness. To address these challenges, we propose a novel differentiable histogram-guided unsupervised Retinex enhancement (DHURE) method, which leverages the distribution of illumination histograms in real-world scenarios to achieve high-fidelity color preservation and refined brightness distribution across diverse extremely low-light images. DHURE avoids reliance on scene-specific features and effectively captures both fine-grained details and overall brightness information. Specifically, our method consists of two key components: 1) The lightweight architecture of DHURE is composed of Retinex decomposition and illumination enhancement. We perform Retinex decomposition on paired low-light images (PRD) and design the Illumination Histogram-guided Enhancement (IHE) module. Both modules employ lightweight architectures. 2) To fully exploit the adaptive priors inherent in paired low-light images, we introduce a self-supervised reflectance map loss that aligns with the Retinex basis loss. Based on the illumination distribution of real-world normal-light images, we define two unsupervised illumination histogram losses, enabling more generalized and robust enhancement. Extensive and diverse experiments demonstrate that our method achieves competitive performance compared to existing unsupervised LIE approaches, showing superior results on most evaluation metrics. The source code is available at https://github.com/yoonyin/DHURE-main .}, archive = {J_ESWA}, author = {Liyuan Yin and Pingping Liu and Tongshun Zhang and Hongwei Zhao and Qiuzhan Zhou}, doi = {10.1016/j.eswa.2025.129782}, journal = {Expert Systems with Applications}, month = {3}, pages = {129782}, shortjournal = {Expert Syst. Appl.}, title = {Differentiable histogram-guided unsupervised retinex enhancement for paired low-light images}, volume = {298}, year = {2026}, }
• (2026). SUNRISE: Multi-agent reinforcement learning via neighbors’ observations under fully noisy environments. ESWA, 298, 129781. (www)

  @article{ , abstract = {Multi-agent reinforcement learning (MARL) methodologies have achieved notable advancements across diverse domains. Despite these successes, the susceptibility of neural networks to perturbed data and the ubiquity of external attacks in real-world settings, such as sensor noise, pose challenges for MARL approaches. The pivotal issue revolves around the effective transfer of policies learned in idealized simulation environments to the complexities inherent in real-world scenarios. More precisely, when agents are unable to obtain any accurate observations of the external environment throughout the entire policy learning process, the MARL methods cannot learn effective policies. In addressing this issue, we propose a methodology wherein noisy observations from neighboring agents are utilized, with an agent’s own noisy observations serving as surrogate ground truth. This approach facilitates the learning of effective policies by MARL methods in environments characterized by pervasive noise. We design a denoising representation network to filter out the principal state information from environment data characterized by noise to mitigate the adverse effects of noise on the process of policy learning. Then, we integrate the denoising representation network with classic MARL methodologies to learn effective policies within environments characterized by pervasive noise. A series of exhaustive experimental results demonstrate the efficacy of our approach in attenuating the impact of external attacks on the optimization parameters of neural networks during the policy-learning process. Moreover, our methodology exhibits compatibility with classic MARL methods, allowing for the learning of effective policies.}, archive = {J_ESWA}, author = {Kaiyu Wang and Bohao Qu and Menglin Zhang and Xianchang Wang and Ximing Li}, doi = {10.1016/j.eswa.2025.129781}, journal = {Expert Systems with Applications}, month = {3}, pages = {129781}, shortjournal = {Expert Syst. Appl.}, title = {SUNRISE: Multi-agent reinforcement learning via neighbors’ observations under fully noisy environments}, volume = {298}, year = {2026}, }
• (2026). RSUTrajRec: Multi-granularity trajectory recovery based on roadside units sensing. ESWA, 298, 129780. (www)

  @article{ , abstract = {Vehicle mobility trajectories, especially fine-grained trajectories, provide valuable insights for understanding urban dynamics and play a crucial role in intelligent transportation systems and urban planning. Obtaining fine-grained vehicle trajectories can be realized by trajectory recovery, but traditional efforts suffer from defects such as poor privacy protection and low recovery accuracy. To address these issues, we propose a new scenario of trajectory recovery based on roadside unit (RSU) sensing. However, this scenario introduces a significant challenge: recovering high-precision trajectories from the incomplete and unevenly distributed sensing data. To tackle this, we design RSUTrajRec , a multi-granularity trajectory recovery framework that comprises a graph neural network-based module for road information prediction, a Transformer-based module for multi-granularity recovery, and an RSU deployment planning module. Extensive real-world dataset evaluations reveal that RSUTrajRec has a significant advantage in recovering missing vehicle trajectories outside the RSU coverage area. In addition, evaluations also verify that the performance of the trajectory recovery task can be effectively improved by optimizing the RSU deployment plan.}, archive = {J_ESWA}, author = {Xianjing Wu and Xutao Chu and Jianyu Wang and Shengjie Zhao}, doi = {10.1016/j.eswa.2025.129780}, journal = {Expert Systems with Applications}, month = {3}, pages = {129780}, shortjournal = {Expert Syst. Appl.}, title = {RSUTrajRec: Multi-granularity trajectory recovery based on roadside units sensing}, volume = {298}, year = {2026}, }
• (2026). Technology foresight in china’s industrial robotics with MLWS-TF: A machine learning and weak signal-based system. ESWA, 298, 129779. (www)

  @article{ , abstract = {Technology foresight analyses technological trends and potential impacts to provide strategic guidance. However, existing methods either rely on experts to discover emerging directions leading to subjective bias or adopt machine learning to predict without explanation. We propose a Machine Learning and Weak Signal-based Technology Forecasting System (MLWS-TF), which is entirely data-driven to enhance the objectivity of technology foresight and can interpret emerging directions through weak signals. The system adopts a two-phase machine learning model (2P-ML), the first phase identifies papers related to the robotics field, while the second further classifies them into fine-grained research directions. Keywords are extracted from the papers using a Word2Vec-based approach, and a three-dimensional signal classification method (DVI) is developed to quantify the foresight value of keywords across the Diffusion, Visibility, and Impact dimensions, identifying weak signals for technology forecasting. Experiments evaluate various machine learning algorithms, and XGBoost outperforms in constructing the 2P-ML classifier. The model achieved over 90% accuracy, demonstrating its effectiveness in identifying the theme of scientific documents based on textual features. For each research theme, the DVI provides a more comprehensive assessment of signal strength to detect weak signals. Finally, MLWS-TF analyses the growth potential of themes and successfully identifies critical development directions. Our approach offers a novel automated technology foresight system, which completely avoids the subjectivity and dependence on expert judgment that characterize traditional technology foresight approaches, and extends weak signal theory by introducing the Impact dimension to evaluate signal strength.}, archive = {J_ESWA}, author = {Ruihan Wang and Yuhao Zhu}, doi = {10.1016/j.eswa.2025.129779}, journal = {Expert Systems with Applications}, month = {3}, pages = {129779}, shortjournal = {Expert Syst. Appl.}, title = {Technology foresight in china’s industrial robotics with MLWS-TF: A machine learning and weak signal-based system}, volume = {298}, year = {2026}, }
• (2026). Generating realistic pruning solutions for automated grape vine pruning using graph neural networks. ESWA, 298, 129778. (www)

  @article{ , abstract = {In our prior work we showed that graph neural networks (GNNs) can be trained to generate pruning solutions that could direct robotic pruning robots to perform automated cane pruning of wine grape vines. That study introduced the feasibility of the technology but also showed that there were many open questions and issues with the research results that needed to be addressed. In this study we address some of these questions. For example, we answer the question of how would a model like this perform on real vine architectures compared with pruning solutions from real experienced pruners. Our most notable contributions include moving away from a per-cane classification model that attempts to define a single perfect pruning solution, to a model that ranks multiple good solutions and picks the best one. We addressed a key limitation of the previous training data by moving away from synthetic vine architectures to realistic ones recorded from real vines and using pruning solutions collected by expert pruners as our ground-truth. Our primary goal was to show that learning by example using a GNN-based model was a viable approach to automated pruning, even when compared with experienced pruners. We showed robust performance from our model by training on a dataset of 90 pruning solutions generated by expert pruners in the 2022 season, and testing our performance on 117 pruning solutions from an independent set of pruners from the 2021 season. The model was able to correctly score all the pruning solutions from the 2021 dataset as good to very good and none of the expert solutions were classified as poor .}, archive = {J_ESWA}, author = {Jaco Fourie and Jeffrey Hsiao and Oliver Batchelor and Kevin Langbroek and Henry Williams and Richard Green and Armin Werner}, doi = {10.1016/j.eswa.2025.129778}, journal = {Expert Systems with Applications}, month = {3}, pages = {129778}, shortjournal = {Expert Syst. Appl.}, title = {Generating realistic pruning solutions for automated grape vine pruning using graph neural networks}, volume = {298}, year = {2026}, }
• (2026). Disruption-responsive berth allocation and quay crane scheduling with inter-terminal collaboration. ESWA, 298, 129776. (www)

  @article{ , abstract = {Container terminal operations frequently encounter disruptions, including delays, extended handling times, and unscheduled vessel arrivals, all of which necessitate intelligent rescheduling strategies to maintain operational efficiency. This study investigates the integrated problem of disruption-responsive berth allocation and quay crane (QC) scheduling, explicitly considering vessel gathering status and incorporating inter-terminal shifting (ITS) and reassignment to terminals different from its originally designated one (RT) as adaptive response strategies to mitigate these disruptions. A rescheduling model is developed to minimize associated costs. To efficiently solve large-scale problems, an adaptive large neighborhood search (ALNS)-based heuristic is proposed. The effectiveness of the proposed scheme is validated through comparative experiments involving three alternative schemes, highlighting its superior performance. Furthermore, algorithm comparison experiments are conducted to verify the robustness of parameter settings. Computational results demonstrate that the proposed model and algorithm achieve high efficiency and solution quality. Additionally, sensitivity analysis reveals that neglecting vessel gathering status leads to substantial cost increases, particularly in large-scale operations. The integration of ITS and RT proves to be an effective strategy for mitigating disruptions, enhancing scheduling flexibility, and improving operational performance.}, archive = {J_ESWA}, author = {Hongxing Zheng and Zhaoyang Wang and Lingxiao Wu}, doi = {10.1016/j.eswa.2025.129776}, journal = {Expert Systems with Applications}, month = {3}, pages = {129776}, shortjournal = {Expert Syst. Appl.}, title = {Disruption-responsive berth allocation and quay crane scheduling with inter-terminal collaboration}, volume = {298}, year = {2026}, }
• (2026). Mining spatiotemporal dominant co-location patterns. ESWA, 298, 129775. (www)

  @article{ , abstract = {Spatial co-location pattern mining is an important branch of spatial data mining, which can identify spatial features that prevalently occur in proximity. Based on spatial co-location patterns, the research of dominant relationships mining within co-location patterns further considers the influence relationship among features. However, relying solely on spatial data to analyze the positions and distribution of features for mining dominant relationships is insufficient and may lead to incorrect patterns. To address this limitation, this paper introduces the temporal factor into the research of dominant relationships mining and proposes the spatiotemporal dominant co-location pattern mining (STDCPM). At first, we define the concepts of spatiotemporal dominant relationship from both temporal and spatial dimensions, and then propose the spatiotemporal dominant participation index to assess the prevalence of spatiotemporal dominant co-location patterns. Furthermore, we design two algorithms, the spatiotemporal dominant co-location pattern mining algorithm with level-by-level search and its improved version, i.e., the spatiotemporal dominant co-location pattern mining approach based on dual pruning and refining set (STDCPM-DPR), to ensure efficient mining in spatiotemporal datasets. The time complexity, correctness, and completeness of proposed algorithms are discussed. Extensive experiments on real-world datasets demonstrate the effectiveness of STDCPM and the efficiency of STDCPM-DPR algorithm.}, archive = {J_ESWA}, author = {Jiangchuan Mei and Peizhong Yang and Hongmei Chen and Lizhen Wang}, doi = {10.1016/j.eswa.2025.129775}, journal = {Expert Systems with Applications}, month = {3}, pages = {129775}, shortjournal = {Expert Syst. Appl.}, title = {Mining spatiotemporal dominant co-location patterns}, volume = {298}, year = {2026}, }
• (2026). Cross-scale content adaptive network for three-dimensional multi-object tracking and fish activity quantification. ESWA, 298, 129774. (www)

  @article{ , abstract = {Tracking and quantifying fish activity are vital for evaluating their health status and adaptability to the environment. However, most current research on fish tracking and activity quantification suffers from the limitation of being two-dimensional, losing crucial vertical or horizontal information. To facilitate tracking and quantitative analysis of fish activity in three-dimensional (3D) space, a cross-scale content-adaptive network-based 3D multi-object tracking method for fish is proposed, through which fish movements are quantified accordingly. Firstly, a cross-scale content-adaptive fusion network is proposed to accurately determine the fish positions from top-down and side views, thereby mitigating the issue of scale variation across different perspectives. Secondly, a hierarchical tracking method is implemented to obtain the 3D trajectories of the fish, addressing the challenge of cross-view identity matching. Finally, activity parameters in 3D space, including the activity quantity and trajectory length for individual fish, as well as the dispersion and cohesion for the fish group, are calculated. The proposed method was validated, achieving a Multi-Object Tracking Accuracy (MOTA) of 97.68% and an Identification F1 Score (IDF1) of 97.93%. For activity quantification, the Mean Absolute Error (MAE) was found to be 0.088 (unit weight·(cm/s) 2 ), and the Root Mean Square Error (RMSE) was 0.1064 (unit weight·(cm/s) 2 ). These results affirm the method’s adaption of fish features across scales for 3D tracking and activity analysis. With its efficient performance, our method presents as an instrument for activities such as fish behavior monitoring, selective breeding, and environmental assessment.}, archive = {J_ESWA}, author = {Yiran Liu and Dingshuo Liu and Mingrui Kong and Beibei Li and Qingling Duan}, doi = {10.1016/j.eswa.2025.129774}, journal = {Expert Systems with Applications}, month = {3}, pages = {129774}, shortjournal = {Expert Syst. Appl.}, title = {Cross-scale content adaptive network for three-dimensional multi-object tracking and fish activity quantification}, volume = {298}, year = {2026}, }
• (2026). An adaptive multimodal semantic knowledge enhanced framework for sarcasm detection. ESWA, 298, 129773. (www)

  @article{ , abstract = {Multimodal sarcasm detection (MSD) has become an important research topic for understanding sentiments on social media, while various recent MSD approaches extract high-level semantic knowledge from images to improve performance. However, some key semantic information, such as emotions expressed in images, is still neglected, limiting reliable sentiment understanding. To address this issue, we propose an adaptive multimodal semantic knowledge enhanced framework for sarcasm detection. We first design an adaptive processing pipeline to extract emotion-aware visual semantics as an auxiliary modality to enhance multimodal feature representations. Enabled by two attention mechanisms, bidirectional cross-modal attention and graph attention, interactions between modalities are analysed to improve MSD performance. Extensive experiments are conducted on two public multimodal sarcasm detection datasets, MMSD and MMSD 2.0, comprising approximately 19,000 tweet samples. Our proposed approach achieves consistent improvements in both sarcasm detection accuracy and F1-score compared to strong baseline models such as DIP and KnowleNet. Built upon a ViT-based architecture, the fine-tuned model offers competitive performance with lower computational overhead, highlighting its potential for practical deployment.}, archive = {J_ESWA}, author = {Jing Dong and Yu Sui and Qiang Zhang and Hui Fang and Gerald Schaefer and Rui Liu and Pengfei Yi and Xiaoyong Fang}, doi = {10.1016/j.eswa.2025.129773}, journal = {Expert Systems with Applications}, month = {3}, pages = {129773}, shortjournal = {Expert Syst. Appl.}, title = {An adaptive multimodal semantic knowledge enhanced framework for sarcasm detection}, volume = {298}, year = {2026}, }
• (2026). CrossFPN: Efficient cross-scale feature pyramid network for real-time low-altitude aerial target detection. ESWA, 298, 129772. (www)

  @article{ , abstract = {Low-altitude aerial target detection presents significant challenges in object detection due to the rapid development of Unmanned Aerial Vehicles (UAVs). Despite the recent advances in feature pyramid networks, the accuracy and efficiency of real-time low-altitude aerial target detection remain suboptimal, which is caused by the tiny proportion, the similar patterns, the complex background textures, and the deficient resolution of the target area of interest. This study proposes the innovative Cross-Scale Feature Pyramid Network (CrossFPN) to address the key gap in real-time low-altitude aerial target detection. Benefiting from the core components Deep Cross-Scale Fuser Module (DCFM) and Shallow Cross-Scale Fuser Module (SCFM), the CrossFPN efficiently fuses the semantic and spatial features across levels through a unique propagating route and preserves the high-resolution information that is crucial to small aerial targets. Differing from the conventional feature extraction process, the simultaneous fusion mode and the feature reutilization reduce the computational overhead of the model and ensure real-time performance, uncovering novel insights into cross-scale fusion. Furthermore, the Adaptive Partial Channel Mixer (APCM) is implemented to process the fused features and extract the discriminative features of the low-altitude aerial targets. Publicly available datasets and self-built extended datasets were employed for hybrid training to enhance the robustness and scalability of the model. Extensive experiments on various datasets have demonstrated that CrossFPN performs superior to state-of-the-art feature pyramid networks in detection accuracy and model complexity by a notable margin.}, archive = {J_ESWA}, author = {Liyan Cai and Qingfang Zheng and Yaowei Wang and Xuefei Xiong and Yong Xu}, doi = {10.1016/j.eswa.2025.129772}, journal = {Expert Systems with Applications}, month = {3}, pages = {129772}, shortjournal = {Expert Syst. Appl.}, title = {CrossFPN: Efficient cross-scale feature pyramid network for real-time low-altitude aerial target detection}, volume = {298}, year = {2026}, }
• (2026). FoRKER: Focused reasoner with knowledge editing and self-reflection. ESWA, 298, 129771. (www)

  @article{ , abstract = {Multi-hop question answering (MHQA) is a complex question answering (QA) benchmark that requires agents to integrate information from diverse sources and utilize cross-referencing reasoning to answer intricate questions. Existing MHQA-handling frameworks typically employ a retrieve-read paradigm. However, these efforts rooted in the retrieve-read paradigm are still constrained by: 1) unstable document retrieval performance , 2) weak knowledge refinement capabilities , and 3) the absence of a reflection mechanism for error awareness . To address these limitations, we propose FoRKER ( Fo cused R easoner with K nowledge E diting and Self- R eflection), which is a plug-and-play framework. Specifically, we develop a novel progressive focusing mechanism to pinpoint highly relevant document resources and introduce knowledge editing techniques to further eliminate noise interference within textual information. Additionally, we design a novel prompting method, named Chain-of-Evidence (CoE), which is designed to augment the reasoning capabilities of FoRKER . Notably, the integration of Self-Reflection technology further endows FoRKER with the ability to learn and improve from its mistakes. Extensive experiments on widely-used datasets demonstrate that FoRKER achieves new state-of-the-art results in information retrieval and reading comprehension, while also exhibiting effective generalization. Exhilaratingly, on the MusiqueQA dataset, FoRKER demonstrates a 20 % improvement in Answering scores compared to the advanced competitors.}, archive = {J_ESWA}, author = {Chunbai Zhang and Haoyang Li and Chao Wang and Yang Zhou and Yan Peng}, doi = {10.1016/j.eswa.2025.129771}, journal = {Expert Systems with Applications}, month = {3}, pages = {129771}, shortjournal = {Expert Syst. Appl.}, title = {FoRKER: Focused reasoner with knowledge editing and self-reflection}, volume = {298}, year = {2026}, }
• (2026). Training-free pedestrian trajectory prediction via segmentation-guided path planning. ESWA, 298, 129770. (www)

  @article{ , abstract = {Pedestrian trajectory prediction is a critical research topic for industrial applications and has been significantly advanced by deep learning. Despite decades of progress, current approaches still face two major challenges. First, the scarcity of data limits the generalization capability of deep learning models. Second, the absence of interpretability hinders real-world applications. To address these challenges, recent research has leveraged the knowledge of large language models (LLMs) to alleviate data sparsity and introduced novel knowledge-based methods to enhance interpretability. Nevertheless, transferring LLMs is excessively cumbersome, and the black-box nature of deep learning continues to obstruct interpretability. In our work, we propose a training-free transfer paradigm named Segmentation-Guided Path Planning (SGPP). Rather than directly transferring pretrained LLMs, SGPP introduces a more tailored and efficient transfer strategy by employing a promptable segmentation model. The segmentation model explicitly extracts walkable regions from the scenario, which serve as constraints in the planning space, thereby reformulating trajectory prediction as a more tractable white-box path-planning problem. Within this framework, our method offers a more effective solution to the two prevailing challenges. Compared with the latest training-free methods, our approach achieves superior performance and demonstrates strong generalization across diverse real-world scenarios, highlighting its suitability for industrial applications.}, archive = {J_ESWA}, author = {Dongchen Li and Zhimao Lin and Jinglu Hu}, doi = {10.1016/j.eswa.2025.129770}, journal = {Expert Systems with Applications}, month = {3}, pages = {129770}, shortjournal = {Expert Syst. Appl.}, title = {Training-free pedestrian trajectory prediction via segmentation-guided path planning}, volume = {298}, year = {2026}, }
• (2026). A novel fuzzy clustering approach with transition matrix for explainable evaluation of social media-based digital literacy interventions. ESWA, 298, 129769. (www)

  @article{ , abstract = {Assessing the effectiveness of digital literacy interventions often relies on raw score comparisons or hard classifications, which may obscure nuanced changes in conceptual understanding and provide limited interpretability. Traditional approaches fail to capture the probabilistic and fuzzy nature of learning progression and do not support transparent analysis of how learners transition across conceptual clusters over time. This study proposes an explainable evaluation framework that integrates fuzzy clustering with a fuzzy transition matrix to model the redistribution of aggregated membership values between pretest and posttest conceptual clusters. The framework applies Fuzzy C-Means (FCM) to derive soft cluster memberships and constructs a transition matrix that represents probabilistic learning progression in a linguistically interpretable form. Unlike conventional methods, this approach enables the analysis of gradual transitions across levels of proficiency rather than binary outcomes. The model was applied to real-world educational data from control and experimental classes, the latter of which received a social media-based instructional intervention. Results indicate that the control class exhibited downward or stagnant patterns, particularly among high-performing learners, while the experimental class showed more coherent upward cluster transitions among low- and moderate-level learners. By enabling interpretable modeling of pre–post cluster transition patterns, the proposed framework contributes to the advancement of explainable machine learning in education. It also highlights the potential of social computing platforms to foster scalable, data-driven digital literacy development.}, archive = {J_ESWA}, author = {Rustam and Diana Noor Anggraini and Koredianto Usman and Loveleen Gaur}, doi = {10.1016/j.eswa.2025.129769}, journal = {Expert Systems with Applications}, month = {3}, pages = {129769}, shortjournal = {Expert Syst. Appl.}, title = {A novel fuzzy clustering approach with transition matrix for explainable evaluation of social media-based digital literacy interventions}, volume = {298}, year = {2026}, }
• (2026). Dynamic graph structure correction with nonadjacent correlations for multivariate time series forecasting. ESWA, 298, 129768. (www)

  @article{ , abstract = {Effectively modeling the relations between variables in multivariate time series is of utmost importance for accomplishing accurate predictions. In real-world scenarios, in addition to sequential correlations, the evolution of relations between variables also exhibits nonadjacent correlations at different scales. However, existing methods primarily focus on constructing dynamic graph structures at each time step using temporal features extracted by continuous temporal models, which cannot capture above latent dependencies. In this study, we introduce the Dynamic Graph Structure Correction (DGC) model, leveraging a multi-scale framework with dilated convolution. To take full advantage of nonadjacent correlations in the evolution of relations between variables, we adaptively select history-related graph structures to correct initial graph structure constructed by Gate Recurrent Units. In addition, we design a time-decay-based attention mechanism to address the influence of time intervals between history-related and current time steps. Finally, the evolved graph structures are fed into graph neural networks to handle the multi-scale and complex structural relations. Our proposed model achieves superior performance compared to state-of-the-art methods in multivariate time series forecasting, as evidenced by the evaluation results on four widely used benchmark datasets.}, archive = {J_ESWA}, author = {Dandan He and Yueyang Wang and Chaoli Lou and Gang Tan and Qingyu Xiong and Guodong Sa}, doi = {10.1016/j.eswa.2025.129768}, journal = {Expert Systems with Applications}, month = {3}, pages = {129768}, shortjournal = {Expert Syst. Appl.}, title = {Dynamic graph structure correction with nonadjacent correlations for multivariate time series forecasting}, volume = {298}, year = {2026}, }
• (2026). Optimized homomorphic linear computation in privacy-preserving CNN inference. ESWA, 298, 129767. (www)

  @article{ , abstract = {Machine Learning as a Service (MLaaS) provides robust solutions for deploying deep learning inference in cloud environments. However, it also raises serious privacy concerns regarding user data and proprietary model parameters. Numerous hybrid cryptographic protocols that integrate homomorphic encryption (HE) and garbled circuits (GC) have been proposed to enable secure inference with low latency. In these protocols, the homomorphic evaluation of linear operations remains the primary performance bottleneck and warrants further optimization. In this work, we propose novel optimizations for HE-based linear computations within the hybrid cryptographic framework for secure neural network inference. Specifically, we devise two efficient strategies for homomorphic matrix-vector multiplication and convolution. For matrix-vector multiplication, we introduce a grouped diagonal extraction technique that encodes the weight matrix more compactly and enables configurable ciphertext rotation reuse, while for homomorphic convolution, we present a group-wise combine-and-merge evaluation method. Both methods significantly reduce the number of required ciphertext rotations. Our approach achieves up to a 3.9 × speedup in matrix-vector multiplication and a 2.9 × improvement in convolution over state-of-the-art (SOTA) solutions. The HE-GC hybrid secure convolutional neural networks (CNN) inference framework incorporating these enhancements yields speedups of 2.5 × on widely used ResNets deep learning architectures.}, archive = {J_ESWA}, author = {Chenglong Li and Xirong Ma and Xiuhao Wang and Fanyu Kong and Yunting Tao and Chunpeng Ge}, doi = {10.1016/j.eswa.2025.129767}, journal = {Expert Systems with Applications}, month = {3}, pages = {129767}, shortjournal = {Expert Syst. Appl.}, title = {Optimized homomorphic linear computation in privacy-preserving CNN inference}, volume = {298}, year = {2026}, }
• (2026). SS-RDHEI for embedding capacity enhancement by PDPM and auxiliary data free coding. ESWA, 298, 129766. (www)

  @article{ , abstract = {Reversible data hiding in encrypted images (RDHEI) is a promising technique for multimedia cloud computing that enables the embedding of secret data into encrypted images while preserving confidentiality. However, the existing RDHEI algorithms fail to meet the high-security requirements of distributed storage systems in the cloud. Although, secret sharing based RDHEI (SS-RDHEI) may solve this problem, the current methods have weakness such as insufficient embedding capacity and unsatisfactory balance between image security and redundancy. To enhance the algorithm’s ability to carry information, this paper proposes a SS-RDHEI for embedding capacity enhancement by PDPM and auxiliary data free coding. Firstly, pixel-difference preservation based modulation (PDPM) ensures secure encryption by modifying all pixels except for a reference block, minimizing damage; moreover, an improved block-level pixel predictor enhances carrier redundancy. Secondly, auxiliary data free coding (ADFC) marks prediction errors directly in the binary sequence of the original pixel without auxiliary information while maintaining accuracy, and reduces the impact of different textures on embedding performance byselecting optimal parameters for each share image. Finally, by combining PDPM with secret sharing, it achieves independent embedding for multiple data hiders while ensuring fair information embedding. Experimental results demonstrate that the proposed algorithm outperforms existing state-of-the-art schemes in terms of information-carrying capability.}, archive = {J_ESWA}, author = {Zhihua Gan and Zongwei Tang and Yalin Song and Gongyao Cao and Xiuli Chai and Yushu Zhang}, doi = {10.1016/j.eswa.2025.129766}, journal = {Expert Systems with Applications}, month = {3}, pages = {129766}, shortjournal = {Expert Syst. Appl.}, title = {SS-RDHEI for embedding capacity enhancement by PDPM and auxiliary data free coding}, volume = {298}, year = {2026}, }
• (2026). Improved convolutional neural networks for the bullwhip effect in supply chains. ESWA, 298, 129764. (www)

  @article{ , abstract = {The Bullwhip Effect (BWE) introduces significant challenges to production systems by amplifying demand and order oscillations. One of the most effective methods for predicting and modeling complex systems is Convolutional Neural Networks (CNNs). However, certain phenomena, such as the BWE in supply chains (SC), are difficult to predict and identify directly. The primary challenge for Machine Learning (ML) algorithms in this context lies in the training phase: the raw demand and order data are fed into the network, yet the desired training outcome is the oscillatory behavior of these data from the perspective of the BWE. Consequently, conventional max pooling, average pooling operators, kernels, and weighted linear combinations of data are insufficient for capturing this type of learning. To address this issue, in this paper, a novel structure containing new pooling operators and kernels of CNNs is proposed to tailor the unique characteristics of the BWE. Specifically: a ) Considering the temporal propagation nature of the BWE, new filters and pooling operators were designed to enable CNNs to predict the BWE accurately. b ) A tensor structure was also proposed for the time signal of demand as inputs of the CNNs to facilitate the analysis of all factors influencing the occurrence of the BWE. c ) To capture the magnitude of the BWE among features, a novel combination of filters and pooling operators was proposed, enabling the CNNs to account for hidden but yet significant feature effects during training. The benefits of the proposed approach lie in its versatility, and it can be applied to train CNNs to model structured fluctuations like the BWE in various dynamic systems.}, archive = {J_ESWA}, author = {Sajjad Aslani Khiavi and Farzad Hashemzadeh}, doi = {10.1016/j.eswa.2025.129764}, journal = {Expert Systems with Applications}, month = {3}, pages = {129764}, shortjournal = {Expert Syst. Appl.}, title = {Improved convolutional neural networks for the bullwhip effect in supply chains}, volume = {298}, year = {2026}, }
• (2026). A hybrid risk assessment method combining CatBoost and FAHP-grid search optimized risk matrix for container ship accident. ESWA, 298, 129763. (www)

  @article{ , abstract = {As a dominant mode of maritime transportation with unique risk characteristics, container shipping requires accurate and applicable risk assessment. However, conventional risk matrices oversimplify complex interactions, while pure data-driven models lack operational utility. To address this, a hybrid method for container ship risk assessment is proposed. This method integrates CatBoost-based predictive method, FAHP-grid search optimized risk matrix, and GIS-supported risk mapping. A comprehensive study of maritime casualties and piracy accidents is conducted, utilizing historical incident data sets collected from the Global Integrated Shipping Information System (GISIS). The global maritime accident risk of container ships is then evaluated and mapped. The sensitivity analysis confirms the robustness of the method under varying linguistic distance parameters, while expert weights have a moderate impact on the assessment results. Finally, the effectiveness of the proposed method is validated through comparative analyses on predictive performance, risk discrimination capability, and risk assessment accuracy. CatBoost algorithm outperforms XGBoost, LightGBM, and Random Forest algorithms in predictive metrics. The designed risk matrix shows strong discriminatory ability for container ship risk levels. In historical accident data validation, the proposed method also achieves higher accuracy than combinations involving XGBoost, LightGBM, or Random Forest with the designed risk matrix.}, archive = {J_ESWA}, author = {Yuqing Xiao and Shilian Han and Xinwang Liu}, doi = {10.1016/j.eswa.2025.129763}, journal = {Expert Systems with Applications}, month = {3}, pages = {129763}, shortjournal = {Expert Syst. Appl.}, title = {A hybrid risk assessment method combining CatBoost and FAHP-grid search optimized risk matrix for container ship accident}, volume = {298}, year = {2026}, }
• (2026). Quadrotor navigation considering attitude: A deep reinforcement learning method using tangent path rewards. ESWA, 298, 129762. (www)

  @article{ , abstract = {Autonomous navigation of quadrotors is a fundamental prerequisite for numerous applications. This work proposes a novel deep reinforcement learning (DRL) framework that explicitly addresses quadrotor attitude dynamics during autonomous navigation, a critical yet underexplored challenge in existing learning-based UAV navigation studies. In the proposed method, high-level velocity commands will be generated by a deep neural network policy and translated by a low-level control algorithm to achieve precise control of both positions and rotations of quadrotors. A specialized network structure is designed to effectively extract environmental obstacle features and quadrotor sequence features to improve navigation performance. In addition, a novel tangent path reward (TPR) calculation method is developed to adequately utilize the known contours and positions of obstacles during the training phase. Experimental results demonstrate that the proposed method enables quadrotors to autonomously navigate complex virtual obstacle environments with superior efficiency compared with other algorithms. Furthermore, the feasibility and adaptability of the proposed method are validated through simulations by varying obstacle density and map size, as well as replicating real-world obstacle distributions.}, archive = {J_ESWA}, author = {Qizhang Luo and Yuqi Li and Jiaheng Zeng and Guohua Wu and Yalin Wang}, doi = {10.1016/j.eswa.2025.129762}, journal = {Expert Systems with Applications}, month = {3}, pages = {129762}, shortjournal = {Expert Syst. Appl.}, title = {Quadrotor navigation considering attitude: A deep reinforcement learning method using tangent path rewards}, volume = {298}, year = {2026}, }
• (2026). A dynamic tri-stage framework with neural network-assisted search for constrained multi-objective optimization. ESWA, 298, 129761. (www)

  @article{ , abstract = {Constrained multi-objective optimization problems involve the optimization of multiple objective functions and the satisfaction of different constraints, which poses a challenge for algorithms to achieve a good balance between convergence and diversity. However, indiscriminately enhancing diversity can hinder convergence, while solely focusing on convergence may impair the exploration of the objective space, especially when the current stage is not well-defined. To address this issue, we propose a three-stage multi-task framework for constrained multi-objective optimization with dynamically switchable stages. This framework introduces two auxiliary tasks: one that operates during the exploration and transition stages to accelerate convergence towards the boundary of the infeasible regions and assist the population in crossing it, and another that operates in the final convergence stage to guide the population towards the constrained Pareto front. Moreover, a stage detection method is proposed, which evaluates the current stage to determine the appropriate evolutionary direction for the population, thus enabling dynamic stage transitions. In addition, a neural network-assisted search operator is designed for the auxiliary task during the transition stage, which learns the optimal offspring generation process. This operator enhances the ability of the auxiliary population to cross the infeasible regions. Finally, the performance of the proposed algorithm is superior and competitive on three test suites and six real-world engineering problems compared to seven state-of-the-art algorithms.}, archive = {J_ESWA}, author = {Qianlong Dang and Xinkang Hong and Xianpeng Sun}, doi = {10.1016/j.eswa.2025.129761}, journal = {Expert Systems with Applications}, month = {3}, pages = {129761}, shortjournal = {Expert Syst. Appl.}, title = {A dynamic tri-stage framework with neural network-assisted search for constrained multi-objective optimization}, volume = {298}, year = {2026}, }
• (2026). A physics-informed neural network surrogate model and many-objective optimization algorithm for coupled multi-energy systems in smart grids. ESWA, 298, 129760. (www)

  @article{ , abstract = {The scope of smart grids is progressively extending toward Integrated Energy Systems (IES) that couple electricity with gas, heating, and cooling. Due to the unsteady-state physical characteristics inherent in the transmission of gas, heat, and cooling resources, IES scheduling must not only balance multiple typical objectives but also account for the dynamic coupling of heterogeneous physical domains. To address these challenges, this paper formulates a Many-objective Optimization Model for Coupled Multi-Energy Flows (MaOCMFM) with partial differential equations (PDEs) in IES, which captures the dynamic physical behaviors of electricity, gas, heat, and cooling subsystems. Building upon this model, we propose a Probabilistic Contributing Many-objective Evolutionary Algorithm enhanced by a Physics-Informed Neural Network surrogate model (PC-MaOEA-PINN). Cubic B-spline functions are employed to achieve a continuous representation of the decision variables, while multi-physics constraints are embedded into the loss function of the surrogate model. This design enables efficient approximation of the objective function with a limited number of samples and facilitates focused exploration in critical evolutionary regions, thereby accelerating population convergence. The effectiveness of the proposed model and algorithm is validated on 9 typical scheduling days across four simulated IES scenarios.}, archive = {J_ESWA}, author = {Jingbo Zhang and Xingjuan Cai and Zhihua Cui and Jinjun Chen}, doi = {10.1016/j.eswa.2025.129760}, journal = {Expert Systems with Applications}, month = {3}, pages = {129760}, shortjournal = {Expert Syst. Appl.}, title = {A physics-informed neural network surrogate model and many-objective optimization algorithm for coupled multi-energy systems in smart grids}, volume = {298}, year = {2026}, }
• (2026). An emergency scheduling method based on AutoML for space maneuver objective tracking. ESWA, 298, 129759. (www)

  @article{ , abstract = {The rapid development of large-scale constellations has led to a dramatic increase in the number of Resident Space Objectives (RSOs), significantly intensifying the complexity of Space Situational Awareness (SSA). Furthermore, the maneuver behaviors of non-cooperative RSOs pose potential threats to space safety, making the real-time monitoring of their post-maneuver orbital becomes more critical. In particular, the maneuvering characteristics of large-scale constellation satellites impose more stringent demands on the timeliness and adaptability of existing scheduling algorithms for observation resources. To address the emergency scheduling demands of heterogeneous ground-based observation resources, this paper proposes an Emergency Task Three-phase Scheduling Framework (ETTSF) based on Automated Machine Learning (AutoML) and auction algorithm. The framework collaboratively optimizes resource allocation through three phases: resource matching, task scheduling, and rescheduling. First, AutoML combined with an auction algorithm predicts and assigns emergency tasks to the most appropriate resources, reducing solution space complexity, simultaneously, the auction algorithm’s corrected results are fed back to AutoML for model fine-tuning. Second, a heuristic algorithm with dynamic neighborhood structures efficiently inserts emergency tasks into the routine observation plan. Finally, affected routine tasks are rescheduled to minimize the operational impact. Simulation results demonstrate that compared to baselines-Real-Time Dynamic Scheduling (RTDS) and Improved Adaptive Large Neighborhood Search (IALNS)-ETTSF achieves a 2.82% improvement in Completion Rate of Emergency RSOs (CRER) and a 27.83% reduction in Impact Rate (IR) on routine tasks. Ablation experiments further validate the effectiveness of the resource matching and rescheduling phases.}, archive = {J_ESWA}, author = {Xi Long and Jinrun Chen and Leping Yang and Huan Huang}, doi = {10.1016/j.eswa.2025.129759}, journal = {Expert Systems with Applications}, month = {3}, pages = {129759}, shortjournal = {Expert Syst. Appl.}, title = {An emergency scheduling method based on AutoML for space maneuver objective tracking}, volume = {298}, year = {2026}, }
• (2026). Exploiting point-language models with dual-prompts for 3D anomaly detection. ESWA, 298, 129758. (www)

  @article{ , abstract = {Anomaly detection (AD) in 3D point clouds is crucial in a wide range of industrial applications, especially in various forms of precision manufacturing. Considering the industrial demand for reliable 3D AD, several methods have been developed. However, most of these approaches typically require training separate models for each category, which is memory-intensive and lacks flexibility. In this paper, we propose a novel P oint- L anguage model with dual-prompts for 3D AN omaly d E tection (PLANE). The approach leverages multi-modal prompts to extend the strong generalization capabilities of pre-trained Point-Language Models (PLMs) to the domain of 3D point cloud AD, achieving impressive detection performance across multiple categories using a single model. Specifically, we propose a dual-prompt learning method, incorporating both text and point cloud prompts. The method utilizes a dynamic prompt creator module (DPCM) to produce instance-specific dynamic prompts, which are then integrated with class-specific static prompts for each modality, effectively driving the PLMs. Additionally, based on the characteristics of point cloud data, we propose a pseudo 3D anomaly generation method (Ano3D) to improve the model’s detection capabilities in the unsupervised setting. Experimental results demonstrate that the proposed method, which is under the multi-class-one-model paradigm, achieves a +8.7 %/+7.0 % gain on anomaly detection and localization performance as compared to the state-of-the-art one-class-one-model methods for the Anomaly-ShapeNet dataset, and obtains +4.3 %/+0.3 % gain for the Real3D-AD dataset. Code will be available upon publication.}, archive = {J_ESWA}, author = {Jiaxiang Wang and Haote Xu and Xiaolu Chen and Haodi Xu and Yue Huang and Xinghao Ding and Xiaotong Tu}, doi = {10.1016/j.eswa.2025.129758}, journal = {Expert Systems with Applications}, month = {3}, pages = {129758}, shortjournal = {Expert Syst. Appl.}, title = {Exploiting point-language models with dual-prompts for 3D anomaly detection}, volume = {298}, year = {2026}, }
• (2026). Path-aware routing system for multimodal vigilance estimation: A structured fusion perspective. ESWA, 298, 129757. (www)

  @article{ , abstract = {Driver vigilance is a critical cognitive factor in ensuring the safety of intelligent driving systems. With advances in physiological and behavioral sensing technologies, multimodal data have become an essential source for modeling drivers’ cognitive states. However, vigilance, as an implicit cognitive state, is difficult to model accurately using a single modality. Efficient fusion of multiple modalities and structured information interaction remains a core challenge in this task. Existing approaches often rely on strategies such as feature concatenation and attention mechanisms, which lack explicit structural constraints. As a result, heterogeneous modality features are fused in an uncontrolled and entangled manner, making the interaction process opaque and difficult to interpret. To address these issues, we propose the Path-Aware Routing System (PARS), which formulates multimodal fusion as a feature routing task. In PARS, intra-modal enhancement and cross-modal interaction are abstracted into independent semantic channels, and a confidence-aware mechanism is introduced to enable dynamically weighted fusion. PARS explicitly constructs a path space, allowing features to be selectively routed and integrated along semantical pathways, thereby enhancing the model’s discriminative power and robustness. We conduct extensive experiments on a public dataset and a self-constructed driving simulation dataset. The results demonstrate that PARS significantly outperforms existing multimodal fusion methods in the task of driver vigilance estimation, achieving superior performance in terms of accuracy, interpretability, and generalization. These findings highlight the broad potential of PARS in intelligent driving applications. Our code and models are available at: https://github.com/SunYu-Gavin/PARS .}, archive = {J_ESWA}, author = {Yu Sun and Shiwu Li and Yiming Bie and Linhong Wang and Tongtong Jin and Mengzhu Guo and Zhifa Yang}, doi = {10.1016/j.eswa.2025.129757}, journal = {Expert Systems with Applications}, month = {3}, pages = {129757}, shortjournal = {Expert Syst. Appl.}, title = {Path-aware routing system for multimodal vigilance estimation: A structured fusion perspective}, volume = {298}, year = {2026}, }
• (2026). Homophone-aware offensive language detection via semantic-phonetic collaboration. ESWA, 298, 129756. (www)

  @article{ , abstract = {The increasing use of implicit and obfuscated expressions poses significant challenges to offensive language detection in Chinese online platforms. In particular, users often exploit homophone substitutions to bypass keyword-based moderation, making traditional detection systems inadequate. This study addresses the problem of detecting offensive content masked through homophonic substitutions, which retain aggressive intent while altering character representations. Existing methods fall into two main categories: (1) semantic-only models, which struggle with phonetic manipulations due to their reliance on text features alone, and (2) auxiliary-enhanced models, which incorporate phonetic or syntactic signals but lack deep integration between modalities. To overcome these limitations, we propose a lightweight dual-branch model that separately encodes textual semantics and pinyin phonetics under a multi-view learning framework. A Dual-Branch Interactive Training strategy is introduced to enable dynamic cross-modal alignment via contrastive objectives, allowing each modality to mutually refine the other and enhance robustness to adversarial inputs. We conduct experiments on two benchmark datasets, COLD and SWSR, both of which are augmented with varying levels of homophone noise to simulate real-world evasion strategies. The proposed model outperforms all baseline models, achieving an average F1-score improvement of 6.3 % under high-noise conditions, while reducing inference latency and memory usage by more than 60 %, demonstrating both effectiveness and efficiency for real-time deployment. We will release the source code for further use by the community https://github.com/hjhhlc/DBIT .}, archive = {J_ESWA}, author = {Jiahao Hu and Shanliang Pan}, doi = {10.1016/j.eswa.2025.129756}, journal = {Expert Systems with Applications}, month = {3}, pages = {129756}, shortjournal = {Expert Syst. Appl.}, title = {Homophone-aware offensive language detection via semantic-phonetic collaboration}, volume = {298}, year = {2026}, }
• (2026). Enhancing traffic signal control through model-based reinforcement learning and policy reuse. ESWA, 298, 129755. (www)

  @article{ , abstract = {Multi-agent reinforcement learning (MARL) has shown significant potential in traffic signal control (TSC). However, current MARL-based methods often suffer from insufficient generalization due to the fixed traffic patterns and conditions of the road network used during training. This limitation results in poor adaptability to new traffic scenarios, leading to high retraining costs and complex deployment. To address this challenge, we propose two algorithms: PLight and PRLight. PLight employs a model-based reinforcement learning approach, pretraining control policies, and environment models using predefined source-domain traffic scenarios. The environmental model predicts state transitions, facilitating the comparison of environmental characteristics. PRLight further enhances adaptability by adaptively selecting pre-trained PLight agents based on the similarity between the source and target domains to accelerate the learning process in the target domain. We evaluated the algorithms through two transfer settings: (1) adaptability to different traffic scenarios within the same road network, and (2) generalization across different road networks. The results show that PRLight significantly reduces the adaptation time compared to learning from scratch in new TSC scenarios, achieving optimal performance using similarities between available and target scenarios.}, archive = {J_ESWA}, author = {Yihong Li and Chengwei Zhang and Furui Zhan and Wanting Liu and Kailing Zhou and Longji Zheng}, doi = {10.1016/j.eswa.2025.129755}, journal = {Expert Systems with Applications}, month = {3}, pages = {129755}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing traffic signal control through model-based reinforcement learning and policy reuse}, volume = {298}, year = {2026}, }
• (2026). Federated transfer learning for anomaly detection in HPC systems: First real-world validation on a tier-0 supercomputer. ESWA, 298, 129754. (www)

  @article{ , abstract = {High-Performance Computing (HPC) systems increasingly require intelligent, scalable anomaly detection to ensure operational reliability. However, conventional centralized approaches often struggle with data privacy constraints, poor generalization across heterogeneous nodes, and limited scalability. This study presents the first real-world application of federated transfer learning (FTL) for anomaly detection in a production-grade Tier-0 supercomputer. By combining federated learning with transfer learning, the proposed framework enables decentralized model training and personalized adaptation to unseen nodes, without accessing raw data. We validate the approach using two large-scale telemetry datasets collected from 100 nodes of the Marconi100 supercomputer, evaluating its effectiveness across supervised, semi-supervised, and unsupervised learning paradigms. Results show that FTL consistently improves anomaly detection performance on nodes that did not participate in federated training, with F1-score gains reaching up to 0.50. These improvements demonstrate the framework’s ability to generalize across non-identically distributed data and maintain detection accuracy under real-world conditions. This work establishes FTL as a scalable, privacy-preserving solution for fault detection in HPC environments. Its practical deployment on production hardware confirms its readiness for real-time monitoring applications in large-scale, heterogeneous computing systems.}, archive = {J_ESWA}, author = {Emmen Farooq and Michela Milano and Andrea Borghesi}, doi = {10.1016/j.eswa.2025.129754}, journal = {Expert Systems with Applications}, month = {3}, pages = {129754}, shortjournal = {Expert Syst. Appl.}, title = {Federated transfer learning for anomaly detection in HPC systems: First real-world validation on a tier-0 supercomputer}, volume = {298}, year = {2026}, }
• (2026). Security script arrangement based on enhanced BERT for cooperative defense in networked control systems. ESWA, 298, 129753. (www)

  @article{ , abstract = {Due to the mutual collaboration and in-depth integration among multiple defense technologies through information sharing, the cooperative defense in networked control systems has emerged as a feasible solution to counter increasingly diversified cyber threats under the unique security characteristics and requirements of industrial environments. However, one of the chief challenges is how to automatically and intelligently develop effective cooperative working strategies when an attack occurs. Leveraging the advantages of large-scale AI (Artificial Intelligence) models, this paper defines a new concept named “security script”, and proposes a security script arrangement approach based on enhanced BERT to achieve fine-grained cooperative defense in networked control systems. Furthermore, this approach introduces intrusion detection and industrial firewall as two practical examples, and can automatically arrange effective security scripts to enable the dynamic interaction of two defense technologies. Additionally, to improve efficiency, the encoder structure adjusting and AdamW optimizing are further presented to enhance the traditional BERT. Experimental results clearly demonstrate that: for one thing, these two optimization ways can make greater achievements in reducing unnecessary time consumption and enhancing accuracy of security script arrangement; for another, compared with other typical BERT and large-scale AI models, the proposed approach can exhibit more favorable performance advantages in achieving cooperative defense based on security script arrangement. In particular, through its successful application and verification in one real-world manufacturing control system, our approach may bring a potential opportunity or direction for further research and improvement of AI-based cooperative defense.}, archive = {J_ESWA}, author = {Ming Wan and Xueqing Liu and Shengbao An and Aiping Tan and Xi Jin and Chuan Sheng}, doi = {10.1016/j.eswa.2025.129753}, journal = {Expert Systems with Applications}, month = {3}, pages = {129753}, shortjournal = {Expert Syst. Appl.}, title = {Security script arrangement based on enhanced BERT for cooperative defense in networked control systems}, volume = {298}, year = {2026}, }
• (2026). Anatomically-robust and feature-unbiased domain generalization for medical segmentation. ESWA, 298, 129752. (www)

  @article{ , abstract = {Single-source domain generalization (SSDG) in medical image segmentation is severely hindered by limited single-source data and inter-domain biases. Existing methods often focus on appearance bias, neglecting crucial organ shape bias arising from differing acquisition protocols or patient populations and feature bias arising from learned confounding context by network. Therefore, we develop an anatomically-robust and feature-unbiased (ARFU) framework. Specifically, to generate morphologically sound and stylistically diverse training data, ARFU synergistically employs shape regularization-guided augmentation (SRG) and anatomical prior-guided augmentation (APG). The SRG leverages intrinsic structural information from low-frequency as a regularization to guide global appearance transformations while preventing anatomical distortion. APG learns a universal organ shape distribution from the variety of training masks, while simultaneously using organ-specific appearance augmentation to enforce an appearance-agnostic anatomical discrimination. To ensure that the network focuses on discriminative and domain-invariant representations of anatomical features, the feature unbiased learning (FUL) module is designed. FUL perturbs feature distributions by treating intra-batch variance as pixel-wise uncertainty to reduce the model’s reliance on domain-specific cues, and then dynamically filters in the frequency domain to adaptively suppress domain-specific noise and irrelevant background patterns. Extensive experiments on abdominal cross-modality and cardiac cross-sequence segmentation tasks demonstrate that our ARFU framework achieves superior generalization performance compared to state-of-the-art methods.}, archive = {J_ESWA}, author = {Bijuan Ren and Yanfeng Li and Jia Sun and Houjin Chen and Luyifu Chen}, doi = {10.1016/j.eswa.2025.129752}, journal = {Expert Systems with Applications}, month = {3}, pages = {129752}, shortjournal = {Expert Syst. Appl.}, title = {Anatomically-robust and feature-unbiased domain generalization for medical segmentation}, volume = {298}, year = {2026}, }
• (2026). ScSCDT: Self-contrastive neural network with deep topology mining for scRNA-seq data clustering. ESWA, 298, 129751. (www)

  @article{ , abstract = {Advancements in single-cell sequencing technologies have enabled researchers to better identify cells based on gene-level information. Cell clustering is a key task in single-cell analysis and plays an important role in distinguishing cell types. However, due to the high dimensionality and sparsity of scRNA-seq data, single-cell clustering remains a major challenge. Although many methods based on deep learning and machine learning have been developed for single-cell clustering, they often fail to capture the deep topological structure between cells, which limits clustering precision. In addition, most existing clustering approaches cannot effectively construct suitable sample pairs to optimize clustering models. To address these issues, we propose a topology-aware deep contrastive clustering model for single-cell data, named scSCDT. First, scSCDT employs a ZINB-based autoencoder to simultaneously learn cell embeddings and topological information, effectively handling the challenges posed by the high-dimensional and sparse nature of the data. Then, we introduce a dual clustering-guided loss to supervise the clustering task, combining a probabilistic soft assignment strategy and a hard pseudo-labeling strategy for optimization. Finally, based on the topological structure in the low-dimensional embedding space, we construct negative pairs within a single view and design a self-contrastive learning method to further improve clustering performance. We conduct extensive experiments on ten real scRNA-seq datasets and evaluate performance using four clustering metrics. The results indicate that scSCDT achieves strong clustering performance across multiple datasets, thereby facilitating more accurate cell type identification in single-cell transcriptomic analysis.}, archive = {J_ESWA}, author = {Zhongyang Zhou and Bin Tang and Feiyu Chen and Wei Wang and Shangshang Zhao and Nanjun Yu}, doi = {10.1016/j.eswa.2025.129751}, journal = {Expert Systems with Applications}, month = {3}, pages = {129751}, shortjournal = {Expert Syst. Appl.}, title = {ScSCDT: Self-contrastive neural network with deep topology mining for scRNA-seq data clustering}, volume = {298}, year = {2026}, }
• (2026). Visual mamba-CNN for scribble-based segmentation in weakly supervised learning for photoacoustic tomography. ESWA, 298, 129749. (www)

  @article{ , abstract = {Photoacoustic (PA) imaging is a powerful non-invasive medical imaging technique that combines the high contrast of optical imaging with the deep tissue penetration of ultrasound, offering both structural and functional insights into tissues and organs. Organ-level analysis of photoacoustic tomography (PAT) images enables quantification of specific morphological and functional parameters, making accurate organ segmentation a critical step in PA image-based analysis. However, the limited availability of large-scale annotated datasets remains a major challenge. To address this, we employ cross-modality data augmentation by generating synthetic PA images from MRI scans. To further reduce manual annotation efforts, we propose a weakly supervised learning (WSL) framework that leverages scribble annotations. Since many deep learning models struggle to capture global context from sparse labels, we introduce a novel architecture that combines traditional convolutional neural networks (CNNs) with Visual Mamba, integrating both local and global feature extraction capabilities. This hybrid design improves segmentation performance in weakly supervised settings. We validate our method on a simulated PA abdominal dataset and real in vivo mouse abdominal PAT data, demonstrating notable improvements in segmentation accuracy and robustness.}, archive = {J_ESWA}, author = {Meng Zhou and Ziyin Ren and Qinlin Tan and Xin Du and Hengrong Lan and Fei Gao and Raymond Kai-Yu Tong}, doi = {10.1016/j.eswa.2025.129749}, journal = {Expert Systems with Applications}, month = {3}, pages = {129749}, shortjournal = {Expert Syst. Appl.}, title = {Visual mamba-CNN for scribble-based segmentation in weakly supervised learning for photoacoustic tomography}, volume = {298}, year = {2026}, }
• (2026). 3D modeling from a single sketch with multifaceted semantic understanding. ESWA, 298, 129748. (www)

  @article{ , abstract = {This paper studies the problem of 3D shape generation from a single sketch. Prior works rely on directly extracted visual features of sketches as guidance for the generation process. However, the sparse visual cues and abstract nature of sketches, which are inherited in the guiding features, lead to semantic ambiguity and geometry incompleteness in the generated shapes, compromising accuracy. To address this, we propose MSU-3D, a diffusion-based framework for sketch-to-3D generation, leveraging Multifaceted Semantic Understanding to explicitly analyze the construction information of sketches from multiple facets before providing fine-grained guidance over 3D shape generation. Specifically, we decompose sketches through three interpretative facets (semantics, depth, and normal), introducing reasoning of three representations to capture 3D features from distinct perspectives: local components, basic 3D geometry, and 3D surface details. One step further, we propose a multifaceted perception module. It aggregates multifaceted feature representations and leverages local component features as a two-pronged guiding representation to jointly guide the perception of basic shapes and surface details. To ensure fine-grained control, the hierarchical perception strategy adaptively injects varying granularity of perception features at different stages of the 3D generation. Extensive experiments and comparisons with state-of-the-art methods on various complex posture datasets validate the effectiveness of our framework in mitigating semantic ambiguity and geometry incompleteness in 3D generation.}, archive = {J_ESWA}, author = {Yuxiao Zhang and Jin Wang and Yang Zhou and Senyun Jia and Zhi Zheng and Dongliang Zhang and Guodong Lu}, doi = {10.1016/j.eswa.2025.129748}, journal = {Expert Systems with Applications}, month = {3}, pages = {129748}, shortjournal = {Expert Syst. Appl.}, title = {3D modeling from a single sketch with multifaceted semantic understanding}, volume = {298}, year = {2026}, }
• (2026). Continuous learning approach to synergize shimmering image enhancement and de-fogging with small sample. ESWA, 298, 129747. (www)

  @article{ , abstract = {Shimmering Image Enhancement and Defogging (SIED) are two important aspects of image recovery. However, most methods are often fail to consider image context information, overexposure of image and the intrinsic correlation between SIED without enough sample. Furthermore, current methods may lead to the amplification of external color interference during image recovery, and can’t fine-tune the model with new samples. Firstly, we propose an Adjustable Multiscale Attention Codec Network (AMACNet) architecture. AMACNet includes variable restorative coder decoder and group channel attention to fuse multi-level contextual and channel information of images, respectively. These components are designed as plug-and-play modules. Secondly, a Continuous Learning with Small Sample (CLS) training method is presented. It utilizes few samples based on a front-and-back stage receding structure. The method synergizes the tasks of SIED, allowing the network to perform both tasks without incresing the number of parameters. It also enables the network to adapt to new tasks with a small number of unpaired samples. Finally, a color adjustment module for image post-processing is designed. The post-processing method is used to balance the impact of color illumination on the inherent color of materials. Extensive experiments demonstrate that training AMACNet by CLS allow the final image recovery results to exceed the GT in terms of ENIQA, FES, PIQE, and other unparameterized metrics.}, archive = {J_ESWA}, author = {Fenglin Yao and Zhengxiang Liu}, doi = {10.1016/j.eswa.2025.129747}, journal = {Expert Systems with Applications}, month = {3}, pages = {129747}, shortjournal = {Expert Syst. Appl.}, title = {Continuous learning approach to synergize shimmering image enhancement and de-fogging with small sample}, volume = {298}, year = {2026}, }
• (2026). Learning domain-invariant representation for generalizable iris segmentation. ESWA, 298, 129746. (www)

  @article{ , abstract = {Cross-domain iris segmentation (CDIS) seeks to transfer knowledge from a labeled source dataset to an unlabeled target dataset. Existing CNN-based iris segmentation methods commonly assume that training and application stages share the same data distribution and modality setting, thus their performance may decline substantially on open-domain iris datasets unseen before. Furthermore, the process of annotating pixel-wise labels is labor-intensive and time-consuming, resulting in limited applicability of these methods in realistic scenarios. Therefore, we propose a generic domain adaptation iris segmentation framework ( DAIrisSeg ), which can be flexibly incorporated into existing methods. First, a domain-sensitive feature whitening strategy is proposed to effectively mitigate the domain-specific styles while preserving the domain-invariant content, thereby improving the model’s generalizability to unknown domain distribution. We then utilize the prototype estimation and the context-similarity learning adapter to produce reliable segmentation labels. In addition, DAIrisSeg incorporates prior constraints of the iris to further refine the segmentation results. Extensive experiments on three iris datasets demonstrate that the proposed method has shown consistent improvements over state-of-the-art (SOTA) methods.}, archive = {J_ESWA}, author = {Dawei Lin and Meng Yuan and Ying Chen and Xiaodong Zhu and Yuanning Liu}, doi = {10.1016/j.eswa.2025.129746}, journal = {Expert Systems with Applications}, month = {3}, pages = {129746}, shortjournal = {Expert Syst. Appl.}, title = {Learning domain-invariant representation for generalizable iris segmentation}, volume = {298}, year = {2026}, }
• (2026). Cycle-CFM: An unsupervised framework for robust multimodal anomaly detection in industrial settings. ESWA, 298, 129745. (www)

  @article{ , abstract = {Industrial multimodal anomaly detection is confronted with three pivotal challenges: cross-modal feature drift, noise sensitivity, and modality imbalance. To address these issues, we propose Cycle-Consistent Cross-Modal Feature Mapping (Cycle-CFM), an unsupervised framework that integrates cycle-consistent cross-modal mapping with channel-attention-guided adaptive loss weighting. Cycle-CFM establishes bidirectional feature alignment between RGB and 3D modalities via reversible cycle mappings, yielding consistent representations robust to vibration and depth noise. To further mitigate dynamic interferences such as illumination variations, we introduce a joint optimization strategy that combines cross-consistency and cycle-consistency losses. Experimental results on our self-constructed SteelDefect-3D-AD dataset demonstrate that Cycle-CFM achieves an AUPRO@1 % of 0.371, outperforming state-of-the-art methods by 17–45 %. It also attains a pixel-level AUROC (P-AUROC) of 0.991 and an image-level AUROC (I-AUROC) of 0.998. On the public MVTec 3D-AD benchmark, Cycle-CFM reaches a mean P-AUROC of 0.960 and improves accuracy by 37.5 % for elongated anomalies. With a runtime of 11.03 FPS and 469.52 MB of parameters, the model highlights both its effectiveness and deployability for real-time industrial inspection.}, archive = {J_ESWA}, author = {Yikang Shi and Xin Zhan and Yaqian Li and Zhongqiang Wu and Wenming Zhang and Haibin Li}, doi = {10.1016/j.eswa.2025.129745}, journal = {Expert Systems with Applications}, month = {3}, pages = {129745}, shortjournal = {Expert Syst. Appl.}, title = {Cycle-CFM: An unsupervised framework for robust multimodal anomaly detection in industrial settings}, volume = {298}, year = {2026}, }
• (2026). An explainable transfer learning approach to predict carbon emission intensity of coal-fired power plants with multi-source monitoring data. ESWA, 298, 129743. (www)

  @article{ , abstract = {Carbon mitigation policies and emission trading systems have heightened the need to monitor and predict the carbon emission intensity (CEI) of coal-fired power plants. Leveraging big data and machine learning (ML) technologies, this study trains predictive models of CEI using operational parameters, load rate, and coal-quality data from three Chinese power plants. The performance of Random Forest (RF), eXtreme Gradient Boosting (XGBoost), Support Vector Machine (SVM), and Artificial Neural Network (ANN) was evaluated, and the challenge of limited data in individual plants was mitigated through instance-based transfer learning (ITL) and graft learning (GL) technologies. The results indicate that while traditional ML models struggle with poor data quality and limited samples, transfer learning between different plants will improve predictive accuracy substantially, and GL delivers the greatest gains. Among the most influential features, air supply temperature and load rate critically impact CEI and therefore should be carefully managed to achieve emission reductions. Nevertheless, the effectiveness of transfer learning depends on source data quality and model choice, and the proposed operational strategies require further validation before practical adoption. Our findings offer a robust framework for enhancing the predictive accuracy of plant CEI under data-scarce conditions and inform effective strategies for promoting a low-carbon transition in the energy sector.}, archive = {J_ESWA}, author = {Xiaodong Jin and Lingzhen Zhang and Fangyi Li and Wu Xie and Dawei Ma and Yan Wu}, doi = {10.1016/j.eswa.2025.129743}, journal = {Expert Systems with Applications}, month = {3}, pages = {129743}, shortjournal = {Expert Syst. Appl.}, title = {An explainable transfer learning approach to predict carbon emission intensity of coal-fired power plants with multi-source monitoring data}, volume = {298}, year = {2026}, }
• (2026). Uncertainty-guided denoising bi-classifier adversarial domain adaptation network for cross-domain fault diagnosis. ESWA, 298, 129742. (www)

  @article{ , abstract = {Intelligent fault diagnosis is crucial for ensuring the safety and reliability of modern industrial systems. However, the performance of deep learning models often significantly degrades due to the domain shift between training and testing data. Domain Adaptation (DA) methods, particularly bi-classifier adversarial networks, have proven effective in transferring knowledge from a labeled source domain to an unlabeled target domain. However, existing approaches often pay insufficient attention to target sample prediction accuracy, resulting in reduced feature discriminability and generalization. Additionally, due to the absence of labeled target data, most approaches rely on pseudo-labels, which are often noisy and unreliable, especially in the early stages of training. To address these issues, this paper proposes a novel uncertainty-guided denoising bi-classifier adversarial domain adaptation network (UGDBAN) for cross-domain fault diagnosis. Specifically, a feature generator based on Transformer layers is designed to capture long-range dependencies and local features. To mitigate the impact of noisy pseudo-labels, an uncertainty-based denoising pseudo-labeling mechanism is introduced to enhance the discriminability of features by redefining pseudo-labels and dynamically selecting high-confidence samples as clean samples. Building upon this denoised pseudo-label set, a Dirichlet uncertainty estimation-based class prototype alignment strategy is proposed to align domain features at the class level by selecting low-uncertainty samples representative of each class as prototypes. Extensive experiments demonstrate the effectiveness of UGDBAN, and comparative results with mainstream methods highlight its superiority.}, archive = {J_ESWA}, author = {Zheng Li and Lei Geng and Yanbei Liu and Feng Rong and Ming Ma and Jun Tong and Zhitao Xiao}, doi = {10.1016/j.eswa.2025.129742}, journal = {Expert Systems with Applications}, month = {3}, pages = {129742}, shortjournal = {Expert Syst. Appl.}, title = {Uncertainty-guided denoising bi-classifier adversarial domain adaptation network for cross-domain fault diagnosis}, volume = {298}, year = {2026}, }
• (2026). Partially view-aligned clustering via data recoupling and elastic bi-consistency learning. ESWA, 298, 129741. (www)

  @article{ , abstract = {Modern multi-view data often suffer from partial view alignment issues, yet most existing multi-view clustering (MVC) methods assume that the data are fully aligned, which is rarely the case in real-world scenarios. This misalignment leads to False Negative Pairs (FNPs), disrupting the learning process. While some methods address partial alignment, they often neglect intra-view consistency and multi-scale inter-view relationships, limiting their ability to capture both global and local structural dependencies. Additionally, the prevalent use of Mean Squared Error (MSE) as a reconstruction loss is suboptimal for discrete data, potentially causing severe performance degradation. To overcome these limitations, we propose Partially View-aligned Clustering via Data Recoupling and Elastic Bi-consistency Learning (PVC-DREBL). Our method integrates two key components: (1) a Data Recouple Module, which realigns the data to mitigate the effects of FNPs while leveraging an exponential contrastive loss to enhance learning stability and prevent overfitting; (2) an Elastic Bi-consistency Learning Module, designed to reconstruct diverse data types robustly while enforcing intra-view and multi-scale inter-view consistency. Extensive experiments on six benchmark datasets demonstrate that PVC-DREBL significantly outperforms existing methods, highlighting its effectiveness in handling partially view-aligned clustering tasks.}, archive = {J_ESWA}, author = {Wenzhe Liu and Jiongcheng Zhu and Jingbo Tan and Huibing Wang and Yong Zhang}, doi = {10.1016/j.eswa.2025.129741}, journal = {Expert Systems with Applications}, month = {3}, pages = {129741}, shortjournal = {Expert Syst. Appl.}, title = {Partially view-aligned clustering via data recoupling and elastic bi-consistency learning}, volume = {298}, year = {2026}, }
• (2026). Attention-based CNN for lithological identification from logging curves: A case study in the qaidam basin, china. ESWA, 298, 129740. (www)

  @article{ , abstract = {Subsurface lithological distribution is essential for extrapolating geological information from core to block or basin scales. Given the limited availability of core data, there is a critical need to develop a reliable method for establishing robust correlations between logging curves and lithologies in cores, thereby maximizing the value of large historical logging data. Here, we propose a novel attention-based convolutional neural network (ATT-CNN), which employs a 1D-CNN to transform six types of logging curves into high-dimensional feature space at each depth, and applies an attention mechanism to the 1D-CNN outputs along both the depth and feature dimensions. The architecture is designed to mimic human perceptual processing for lithology identification, leveraging curve combination, thresholding, and local pattern recognition within this enriched and high-dimensional feature representation. In addtion, the study employs wavelet-based preprocessing on logging curves to eliminate the impact of compaction-induced data drift on model generalization—an issue rarely considered in prior studies. The result showes that: ① The proposed ATT-CNN model demonstrates superior performance over benchmark models—the bidirectional gated recurrent unit (BiGRU) and an ensemble of machine learning models (En-ML)—across all evaluation metrics; ②Wavelet-based preprocessing enhances the generalization capability of both ATT-CNN and BiGRU, yielding higher metric scores and improved predictions, particularly in shallow-depth intervals; ③ For blind wells, the ATT-CNN outperforms BiGRU and En-ML in both accuracy and its ability to capture lithological variations even from low-amplitude curve deviations. The integration of ATT-CNN with wavelet-based preprocessing demonstrates significant potential for accurately characterizing subsurface lithological distribution, then provides critical support for key petroleum geology workflows, including provenance analysis, sedimentary facies mapping, and reservoir property prediction.}, archive = {J_ESWA}, author = {Jianguo Yin and Shuai Zhang and Zhixiong Wu and Shouji Pang and Rui Wang}, doi = {10.1016/j.eswa.2025.129740}, journal = {Expert Systems with Applications}, month = {3}, pages = {129740}, shortjournal = {Expert Syst. Appl.}, title = {Attention-based CNN for lithological identification from logging curves: A case study in the qaidam basin, china}, volume = {298}, year = {2026}, }
• (2026). Clustering-based brain functional segmentation via deep collapsed nonparametric von mises-fisher mixture models. ESWA, 298, 129739. (www)

  @article{ , abstract = {This paper presents a clustering-based framework for the analysis of functional magnetic resonance imaging (fMRI) data, with a particular focus on brain segmentation into functional sub-regions. The proposed approach comprises two key modules: representation learning and brain functional segmentation. To extract meaningful latent representations from high-dimensional fMRI signals while preserving temporal dependencies, we introduce the Spherical Variational Recurrent Autoencoder (SVRAE), a deep generative model built upon the Variational Autoencoder (VAE) architecture. Unlike conventional VAEs that assume a Gaussian prior, SVRAE employs the von Mises-Fisher (vMF) distribution to model latent variables on a unit hypersphere, which is more suitable for L 2 -normalized data. To further enhance temporal modeling, we replace standard fully connected layers with Long Short-Term Memory (LSTM) networks. For the segmentation module, we adopt a Collapsed Nonparametric von Mises-Fisher Mixture Model (Co-vMFMM), formulated within a Bayesian nonparametric framework. This model automatically adapts its complexity to the input data without requiring a predefined number of clusters. An efficient variational Bayes learning algorithm is developed to perform inference in a collapsed parameter space. Extensive experiments on publicly available fMRI datasets demonstrate the effectiveness and robustness of the proposed method in delineating functionally coherent brain sub-regions.}, archive = {J_ESWA}, author = {Wentao Fan and Wenchuan Zhang and Xiao Dong and Nizar Bouguila}, doi = {10.1016/j.eswa.2025.129739}, journal = {Expert Systems with Applications}, month = {3}, pages = {129739}, shortjournal = {Expert Syst. Appl.}, title = {Clustering-based brain functional segmentation via deep collapsed nonparametric von mises-fisher mixture models}, volume = {298}, year = {2026}, }
• (2026). An optimized hierarchical path planning method based on deep reinforcement learning for mobile robots. ESWA, 298, 129736. (www)

  @article{ , abstract = {With the development of elderly mobile robot technology, the training efficiency and path planning of robots have become key issues in research. Current mobile robot training faces challenges such as local optima and slow convergence speeds. To address these issues, this paper proposes a hierarchical path planning method based on deep reinforcement learning (H-DDQN). This method first introduces a global path planning module, which uses a density function to select high-value key points. In areas with dense obstacles, these key points provide the robot with effective global path guidance, enabling it to avoid getting stuck in a local optimum due to reliance solely on local information. In the local path planning module, we introduce a spatial attention mechanism based on global information, which weights global path points to enable the robot to focus on critical areas, thereby enhancing local decision-making capabilities and addressing dynamic obstacles on the basis of global optimality. Finally, this paper designs a new comprehensive reward function that combines path guidance from global key points with goal-oriented dense rewards, avoiding excessive unnecessary exploration and providing timely feedback to accelerate the model’s convergence speed. Experimental results show that compared to other existing algorithms, the H-DDQN algorithm converges more quickly during training and generates shorter and more efficient paths. In dynamic obstacle environments, the algorithm also demonstrates strong adaptability, combining global and local capabilities to achieve superior performance.}, archive = {J_ESWA}, author = {Jilin Zhang and Jia Qiao and Ke Huang and Menghua Zhang}, doi = {10.1016/j.eswa.2025.129736}, journal = {Expert Systems with Applications}, month = {3}, pages = {129736}, shortjournal = {Expert Syst. Appl.}, title = {An optimized hierarchical path planning method based on deep reinforcement learning for mobile robots}, volume = {298}, year = {2026}, }
• (2026). Assessing the renewable energy sources for sustainable energy generation systems: Interval-valued q-rung orthopair fuzzy SWARA-TOPSIS. ESWA, 298, 129735. (www)

  @article{ , abstract = {Renewable Energy Sources (RESs) help decarbonize power systems, but selecting among them is a challenging decision problem due to multiple, often conflicting, technical, economic, environmental, and health-related criteria. Consequently, numerous studies in the literature have attempted to address this decision-making issue using objective, subjective, and fuzzy decision-making procedures. However, there are still unaddressed research gaps in the literature, particularly regarding the explicit modeling of expert hesitation and ambiguity in real-world RES selection cases. The current study develops a decision-making model based on Step-wise Weight Assessment Ratio Analysis (SWARA) and Technique of Order Preference Similarity to the Ideal Solution (TOPSIS) methods integrated with Interval-Valued q-Rung Orthopair Fuzzy Sets (IV-q-ROFSs) to fill these gaps. Unlike previous studies that have predominantly applied conventional fuzzy MCDM techniques, our model introduces the first integration of IV-q-ROFS into RES selection. This novelty enables a more accurate representation of expert hesitation and uncertainty. The study is applied to a real industrial case in Turkey, where six RES alternatives are evaluated across 43 criteria by five senior experts under the supervision of a three-member professionals’ board. Furthermore, the structured robustness check and systematic literature mapping ensure that the proposed approach is methodologically robust and practically relevant for policymakers and energy planners. The application results of the developed model demonstrate that the estimated energy production potential of the RES and the effects of carcinogens generated from utilizing these energy sources are the critical factors influencing the selection of the most appropriate RESs. Solar energy ranked first among the alternatives. The applicability and validity of the developed model are examined by a comprehensive robustness check consisting of tests of sensitivity, comparison, and resilience to the rank reversal problem. Overall, the study provides (i) a novel methodological framework integrating IV-q-ROFS with SWARA and TOPSIS, (ii) empirical evidence from a comprehensive real-world RES selection case, and (iii) policy-relevant insights into the drivers of renewable energy adoption.}, archive = {J_ESWA}, author = {Ömer Faruk Görçün and Ahmet Aytekin and Selçuk Korucuk and Erfan Babaee Tirkolaee}, doi = {10.1016/j.eswa.2025.129735}, journal = {Expert Systems with Applications}, month = {3}, pages = {129735}, shortjournal = {Expert Syst. Appl.}, title = {Assessing the renewable energy sources for sustainable energy generation systems: Interval-valued q-rung orthopair fuzzy SWARA-TOPSIS}, volume = {298}, year = {2026}, }
• (2026). Enhancing liver cancer detection: An innovative deep learning approach combining GAN, ResNet, and vision transformer. ESWA, 298, 129734. (www)

  @article{ , abstract = {Liver cancer is a complex and life-threatening disease with significant diagnostic and therapeutic challenges. Automated liver cancer detection assists radiologists in identifying tumors and their severity accurately. In recent years, several deep-learning techniques have been implemented for diagnosing liver tumors and classification. Despite advancements in deep learning for medical imaging, existing liver cancer detection approaches continue to face several critical limitations. These include suboptimal diagnostic accuracy due to inadequate feature extraction, excessive computational demands that hinder real-time deployment, significant class imbalance within medical datasets leading to biased predictions, and overfitting caused by limited annotated training data. To address these challenges, this study introduces a novel and automated deep learning framework called CustomLiverNet, specifically designed for accurate and efficient liver cancer diagnosis using Computed Tomography images. The Generative Adversarial Network is introduced for generating realistic synthetic images, effectively improving the performance of the proposed technique and reducing class imbalance problems. The proposed technique integrates the strengths of Residual Networks and Vision Transformer to extract significant information from the input images and further enhance the performance of the proposed framework. The Residual Networks capture both low-level and high-level semantic features, whereas the Vision Transformer derives global and contextual feature representations from the input images. The model designs a customized fusion layer for combining the extracted features from both Residual Networks and Vision Transformer models. The classification layer predicts whether the liver tumor is benign or malignant. Further, Gradient-Weighted Class Activation Mapping is applied to highlight the critical regions of the image to enhance model transparency. The CustomLiverNet framework was trained and validated on two publicly available liver cancer datasets, including the liver tumor segmentation dataset, which contains 131 contrast-enhanced abdominal Computed Tomography scans, and the 3D image reconstruction for comparison of algorithm database, which includes 20 computed tomography scans. Experimental evaluation using standard metrics shows that CustomLiverNet achieved an accuracy of 98.79 %, precision of 98.64 %, recall of 98.58 %, and specificity of 98.35 %. These results demonstrate that the proposed model holds strong potential for enhancing early and accurate liver cancer diagnosis compared to previous studies.}, archive = {J_ESWA}, author = {Shivani Joshi and Avinash Dwivedi and Rajiv Kumar and Ashish Kumar and Raju Kumar and Amrita}, doi = {10.1016/j.eswa.2025.129734}, journal = {Expert Systems with Applications}, month = {3}, pages = {129734}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing liver cancer detection: An innovative deep learning approach combining GAN, ResNet, and vision transformer}, volume = {298}, year = {2026}, }
• (2026). Unleashing the power of large language models for low-resource relation triplet extraction by structure-to-text data generation. ESWA, 298, 129733. (www)

  @article{ , abstract = {Scaling language models have revolutionized widespread NLP tasks, yet little investigation has been conducted to assess the ability of Large Language Models (LLMs) to explore low-resource relation triplet extraction. This paper investigates essential methodologies, k -shot demonstration of in-context learning, and many-shot instruction tuning for few-shot and zero-shot relation triplet extraction using FlanT5, supported by exhaustive experiments. To enhance low-resource setting performance, we further propose different types of demonstration examples and task-related instructions for data generation. Specifically, we leverage LLMs to construct a structured prompt template for generating synthetic training data based on structured text and efficiently explore the boundary issues of examples in both instruction tuning and in-context learning, assessing their impact on model performance. To address the challenge of extracting multiple relation triplets from a single sentence, we design a novel Multiple Triplet Search (MTS) algorithm. Furthermore, we find that in-context learning can match the performance of previous prompt learning methods. Additionally, integrating synthetic data with the LLM can improve existing solutions in low-resource scenarios, achieving new state-of-the-art results. Experiments conducted on six relation extraction datasets demonstrate the efficacy of the proposed model for the zero-shot and few-shot RTE tasks. Our source code is publicly available at https://github.com/Phevos75/LLMRTE.}, archive = {J_ESWA}, author = {Qian Guo and Yi Guo and Jin Zhao}, doi = {10.1016/j.eswa.2025.129733}, journal = {Expert Systems with Applications}, month = {3}, pages = {129733}, shortjournal = {Expert Syst. Appl.}, title = {Unleashing the power of large language models for low-resource relation triplet extraction by structure-to-text data generation}, volume = {298}, year = {2026}, }
• (2026). LDATA-net: Dynamic feature adaptation for efficient feature learning in resource-limited UAV detection. ESWA, 298, 129725. (www)

  @article{ , abstract = {Unmanned Aerial Vehicle (UAV) image analysis faces the dual challenges of complex background interference and limited onboard computational resources, particularly when processing extreme scale variations across multiple viewpoints. Existing approaches typically enhance detection accuracy by increasing model complexity, but this often leads to parameter proliferation that exceeds the deployment limits of airborne platforms. To address this fundamental contradiction, we propose LDATA-Net (Lightweight Dynamic Aggregation Task-Aligned Network), which pioneers a “Dynamic Feature Adaptation” design paradigm aimed at achieving synergistic optimization between parameter efficiency and detection accuracy. This framework systematically realizes end-to-end dynamic adaptive capabilities through three core components that operate collaboratively across feature extraction, fusion, and detection stages: (1) Dynamic Multi-Branch Depthwise Block (DMBD-Block), whose core innovation is our proposed novel operator DIDWConv, which adaptively adjusts receptive fields according to input features to capture targets of extreme scales and orientations; (2) Lightweight Dynamic Aggregation Network (LDANet), which effectively preserves critical spatial contextual information through hierarchical fusion architecture and dynamic weighting mechanisms; (3) Dynamic Adaptive Head (DA-Head), which effectively mitigates task conflicts through geometric and semantic dynamic feature alignment. LDATA-Net achieves 35.4 %, 77.9 %, and 51.2 % AP 50 on VisDrone2019, DOTA1.0, and AI-TODv2 datasets respectively with only 2.8M parameters, establishing a new paradigm for designing memory-efficient yet high-performance detection systems, particularly for resource-constrained heterogeneous computing aviation platforms.}, archive = {J_ESWA}, author = {Shuming Lin and Sang Feng and Junnan Tan}, doi = {10.1016/j.eswa.2025.129725}, journal = {Expert Systems with Applications}, month = {3}, pages = {129725}, shortjournal = {Expert Syst. Appl.}, title = {LDATA-net: Dynamic feature adaptation for efficient feature learning in resource-limited UAV detection}, volume = {298}, year = {2026}, }
• (2026). Exploring intra- and inter-organizational collaboration opportunities across a technological knowledge ecosystem: A metapath2vec approach. ESWA, 298, 129724. (www)

  @article{ , abstract = {Due to the increasing complexity and scale of technological knowledge ecosystems, organizations face challenges in identifying intra- and inter-organizational collaboration opportunities. In this respect, prior studies have proposed patent-based approaches, but they are subject to several limitations: (1) insufficient consideration of technological relationships within the ecosystem, (2) simplified unit of analysis, and (3) limited organization-centric assessments. This study proposes a network embedding and text-reranking approach to explore potential intra- and inter-organizational collaboration opportunities. First, the technological knowledge ecosystem is represented as a heterogeneous patent network comprising patents, inventors, assignees, and technology classification codes. Second, inventor nodes are embedded using metapath2vec, which performs random walks along predefined metapaths to capture diverse knowledge flows within the ecosystem. Third, potential collaborators are explored through (1) screening candidates based on technological reachability, which measures the possibility of knowledge exploration based on contextual similarity within the network, and (2) reranking candidates based on technological relevance, which quantifies the possibility of knowledge exploitation based on the similarity of technological know-how and experiences. Finally, ten quantitative patent indicators are developed to assess the implications of these opportunities at both the inventor and organization levels. The validity of the proposed approach is demonstrated through a case study involving 28,888 US patents and 9,196 inventors in the field of energy storage technology. This study contributes to advancing the theoretical understanding of technological knowledge ecosystems while also serving as a supplementary tool to explore organizational collaboration opportunities.}, archive = {J_ESWA}, author = {Jaemin Chung and Jaewoong Choi and Janghyeok Yoon}, doi = {10.1016/j.eswa.2025.129724}, journal = {Expert Systems with Applications}, month = {3}, pages = {129724}, shortjournal = {Expert Syst. Appl.}, title = {Exploring intra- and inter-organizational collaboration opportunities across a technological knowledge ecosystem: A metapath2vec approach}, volume = {298}, year = {2026}, }
• (2026). An improved actor-critic architecture with PPO for the traveling salesman problem. ESWA, 298, 129723. (www)

  @article{ , abstract = {The traveling salesman problem (TSP) is a classic NP-hard problem in combinatorial optimization with extensive practical applications. In this paper, we present an improved Actor-Critic architecture incorporating Proximal Policy Optimization (PPO) to effectively solve TSP. We introduce adaptive temperature scheduling, comprehensive state representation, and layer normalization to enhance learning stability. Experimental results demonstrate our Improved Actor-Critic approach achieves significant improvements ranging from 8.7 % to 55.9 % for different problem sizes compared to established reinforcement learning baselines including Q-Learning, SARSA, Double Q-Learning, Actor-Critic with Experience Replay (ACER), and Trust Region Policy Optimization (TRPO), with particularly strong performance on smaller instances between 20 to 100 cities. When testing on standard TSPLIB benchmarks, our method shows consistent advantages of 12 % to 33 % compared to classical approaches While tabular methods become computationally infeasible beyond 250 cities due to memory constraints, our approach maintains high solution quality for problems up to 1432 cities on our experimental setup (Intel® Core™i9-10900X CPU @ 3.70GHz × 20 with four NVIDIA Quadro RTX 5000 GPUs). Our ablation studies confirm the importance of each component in our proposed architecture, in which the improved state representation provides the most significant contribution to our model performance. This research significantly advances reinforcement learning approaches to combinatorial optimization, with practical implications for logistics, telecommunications, and manufacturing. The developed source code is available at: https://github.com/LetuQingge/TSP_Environment .}, archive = {J_ESWA}, author = {Hailemicael Lulseged Yimer and Pei Yang and Letu Qingge}, doi = {10.1016/j.eswa.2025.129723}, journal = {Expert Systems with Applications}, month = {3}, pages = {129723}, shortjournal = {Expert Syst. Appl.}, title = {An improved actor-critic architecture with PPO for the traveling salesman problem}, volume = {298}, year = {2026}, }
• (2026). Synchronization of semi-markov jump two-time-scale fuzzy neural networks dealing with dual-scale hybrid attacks and its application. ESWA, 298, 129718. (www)

  @article{ , abstract = {In this paper, the synchronization issue of the semi-Markov jump two-time-scale fuzzy neural networks dealing with dual-scale hybrid attacks is addressed, in which the dual-scale hybrid attacks mean that hybrid attacks can be encountered in different time scales transmission channels. Based on mismatched membership functions, a new ϵ -dependent combined synchronization controller is proposed to ensure the synchronization of the master semi-Markov jump two-time-scale fuzzy neural networks and the slave ones while it is capable of resisting independent dual-scale hybrid attacks. Through the development of a Lyapunov function incorporating the singular perturbation parameter ϵ , stability conditions and a computational approach for determining the synchronization controller gain are derived for semi-Markov jump two-time-scale fuzzy neural networks. Finally, some simulations and two encryption and decryption processes are used to show the effectiveness of obtained results.}, archive = {J_ESWA}, author = {Feng Li and Ya-Nan Wang and Lei Su and Sangmoon Lee}, doi = {10.1016/j.eswa.2025.129718}, journal = {Expert Systems with Applications}, month = {3}, pages = {129718}, shortjournal = {Expert Syst. Appl.}, title = {Synchronization of semi-markov jump two-time-scale fuzzy neural networks dealing with dual-scale hybrid attacks and its application}, volume = {298}, year = {2026}, }
• (2026). Automated recognition and measurement of cellular and dendritic microstructures in alloys via machine learning. ESWA, 298, 129717. (www)

  @article{ , abstract = {The dendritic or cellular morphologies of alloys and metals formed during casting processes significantly influence key properties such as mechanical strength, toughness, hardness, and electrical or thermal conductivities. The literature presents correlations between these properties and the microstructural length scale, which requires accurate characterization at the micrometer level. However, traditional evaluation methods demand extensive experimental efforts, including careful metallographic preparation, high-quality imaging, and a large number of measurements for statistical reliability - often relying on analyst proficiency. This study proposes a machine learning-based workflow tailored for the automated processing of microstructure images. The approach enables the autonomous measurement of key microstructural features while minimizing bias and inconsistencies among analysts. By integrating advanced image processing techniques with object detection algorithms based on Convolutional Neural Networks (CNNs), the method autonomously identifies microstructural morphologies and quantifies their spacing scales. Three model types-Cell, Dendrite, and Hybrid (exhibiting both dendritic and cellular features)-were trained and validated on using a dataset of 200 images. Among them, the Cell detection model achieved the highest performance, with a mean Average Precision (mAP) of 78.77 %, followed by the Hybrid (75.63 %) and Dendrite (72.87 %) models. Finally, the automated measurements models were applied to literature images and compared to reported microstructural growth correlations.}, archive = {J_ESWA}, author = {Guilherme Marim da Silva and Rafael Kakitani and Carlos Henrique da Silva Santos and Amauri Garcia and Noé Cheung}, doi = {10.1016/j.eswa.2025.129717}, journal = {Expert Systems with Applications}, month = {3}, pages = {129717}, shortjournal = {Expert Syst. Appl.}, title = {Automated recognition and measurement of cellular and dendritic microstructures in alloys via machine learning}, volume = {298}, year = {2026}, }
• (2026). Online reinforcement learning strategies driven artificial bee colony algorithm for bi-objective distributed reentrant flowshops scheduling problem with sequence-sependent setup time. ESWA, 298, 129716. (www)

  @article{ , abstract = {With the increasing complexity of manufacturing systems, reentrancy has become prevalent in many production environments. This study investigates a bi-objective distributed reentrant flow shop scheduling problem with sequence-dependent setup times (DRFSP-SDST). The objectives are to minimize the total energy consumption (TEC) and the maximum completion time (makespan), simultaneously. First, a bi-objective mathematical model for the DRFSP-SDST is formulated based on practical reentrant production scenarios. Second, the artificial bee colony (ABC) algorithm and its variants are employed to solve the DRFSP-SDST. According to the characteristics of the DRFSP-SDST, six local search operators are specifically designed to enhance the performance of the proposed algorithms. For promoting greener and more energy-efficient production, two speed-scaling strategies are developed. Third, two reinforcement learning (RL) algorithms, Q-learning and State-Action-Reward-State-Action (SARSA), are integrated into the iterative process as online learning strategies to guide the selection of high-quality local search strategies during the iterations of the proposed algorithms. For each RL algorithm, two distinct selection strategies for local search operators are designed. Finally, the effectiveness of the proposed enhancement strategies is evaluated through comprehensive numerical experiments on 36 benchmark instances. The performance of the proposed algorithms is further validated via the Friedman test. The experimental results and analysis demonstrate that the ABC algorithm enhanced by SARSA-based local search exhibits superior competitiveness in solving the DRFSP-SDST.}, archive = {J_ESWA}, author = {Ao Yao and Kaizhou Gao and Ponnuthurai Nagaratnam Suganthan and Hongyan Sang}, doi = {10.1016/j.eswa.2025.129716}, journal = {Expert Systems with Applications}, month = {3}, pages = {129716}, shortjournal = {Expert Syst. Appl.}, title = {Online reinforcement learning strategies driven artificial bee colony algorithm for bi-objective distributed reentrant flowshops scheduling problem with sequence-sependent setup time}, volume = {298}, year = {2026}, }
• (2026). Defects inspection system for building facades using drones and deep learning method. ESWA, 298, 129715. (www)

  @article{ , abstract = {Regular inspection and maintenance of building facades are essential for preserving structural integrity and aesthetic quality, especially in aging urban high-rises. While drone-based visual inspection powered by artificial intelligence (AI) offers benefits in speed, safety, and scalability, existing methods are typically limited to single defect types or uniform facade categories due to the challenges of detecting multi-scale defects in complex, heterogeneous environments. This study introduces an automated multiclass defects inspection system for building facades by integrating drone technology, an AI-driven segmentation platform, and automatic report generation. Central to the system is a segmentation AI model capable of detecting multiclass defects with orders-of-magnitude differences in scale across diverse facade backgrounds. To handle the pixel imbalance of defects ranging from fine cracks to large spalling and glass breakage, the model is built upon EfficientUNet++, trained on a carefully curated dataset and optimized using adjustable batch sizes and active learning rates to improve multi-scale feature learning and mitigate overfitting. Evaluations on validation and out-of-sample datasets demonstrate that the proposed model achieves superior performance across all defect classes. Real-world drone experiments further confirm the model’s practical applicability, with high recall rates in detecting spalling, water seepage, cracks, and glass breakage across different types of facades. This work pioneers a robust, scalable, and efficient AI-based framework for automated multiclass facade defect inspection, providing actionable information for engineers and supporting urban infrastructure maintenance.}, archive = {J_ESWA}, author = {Xiaoling Zhou and Robert Lee Kong Tiong}, doi = {10.1016/j.eswa.2025.129715}, journal = {Expert Systems with Applications}, month = {3}, pages = {129715}, shortjournal = {Expert Syst. Appl.}, title = {Defects inspection system for building facades using drones and deep learning method}, volume = {298}, year = {2026}, }
• (2026). Cross-modal multitask learning for automated quantitative characterization of infrastructure airhole defects. ESWA, 298, 129713. (www)

  @article{ , abstract = {Quantitative characterization of apparent quality defects in infrastructure is a crucial component of operations and maintenance. It enables rapid assessment of defect severity and supports the timely formulation of preventive strategies. However, a singular visual modality struggles to simultaneously ensure the dual tasks of defect detection and measurement accuracy. To solve these problems, this paper proposes a novel framework for cross-modal multitask learning networks, which comprehensively integrates the advantages of image detection and point cloud measurement. The pixel points identified in the image are mapped to their corresponding three-dimensional coordinates in the point cloud through intensive feature matching. A measurement strategy for the inherent characteristics of the defect is subsequently proposed. Based on prior knowledge of the defect, the area and volume of defects are quantified accurately. Finally, extensive experiments on detection, matching and measurement demonstrate the efficacy of the proposed method. The results provide a valuable reference for the quantitative characterization of infrastructure defects.}, archive = {J_ESWA}, author = {Yu Wang and Yingchao Dai and Xiaodong Gan and Zhengtao Yang and Zhou Wu}, doi = {10.1016/j.eswa.2025.129713}, journal = {Expert Systems with Applications}, month = {3}, pages = {129713}, shortjournal = {Expert Syst. Appl.}, title = {Cross-modal multitask learning for automated quantitative characterization of infrastructure airhole defects}, volume = {298}, year = {2026}, }
• (2026). Language proficiency assessment of autistic children using large language models. ESWA, 298, 129712. (www)

  @article{ , abstract = {Language impairment is a common comorbidity in children with autism spectrum disorder (ASD), and language proficiency assessment is a primary method for identifying such impairments. However, traditional assessment tools are often subjective and inefficient, while existing computer-assisted methods are limited by a narrow focus and insufficient use of natural language samples. To address these issues, this study proposes a framework for assessing children’s language abilities based on large language models (LLMs). We first preprocess the natural language samples from children and design multiple assessment dimensions and workflows. To enhance the stability of the assessment, we introduce a multi-expert voting mechanism and perform a comparative analysis of various large language models’ performance. The experimental results demonstrate a strong correlation between the framework’s assessment results and the Mullen Scales of Early Learning (MSEL) verbal developmental quotients, with a Pearson correlation coefficient of 0.8 ( p < 0.001). Furthermore, the results show that the multi-dimensional evaluation can accurately differentiate between ASD and typically developing (TD) children, achieving a classification accuracy of 0.98. These findings suggest that the proposed framework has significant potential for improving the accuracy of ASD identification.}, archive = {J_ESWA}, author = {Saige Qin and Min Liu and Tongquan Wei and Qiaoyun Liu}, doi = {10.1016/j.eswa.2025.129712}, journal = {Expert Systems with Applications}, month = {3}, pages = {129712}, shortjournal = {Expert Syst. Appl.}, title = {Language proficiency assessment of autistic children using large language models}, volume = {298}, year = {2026}, }
• (2026). EQUINAS: Equilibrium-guided differentiable neural architecture search. ESWA, 298, 129711. (www)

  @article{ , abstract = {Recent research has significantly mitigated the performance collapse issue in Differentiable Architecture Search (DARTS) by either refining architecture parameters to better reflect the true strengths of operations or developing alternative metrics for evaluating operation significance. However, the actual role and impact of architecture parameters remain insufficiently explored, creating critical ambiguities in the search process. To address this gap, we conduct a rigorous theoretical analysis demonstrating that the change rate of architecture parameters reflects the sensitivity of the supernet’s validation loss in architecture space, thereby influencing the derived architecture’s performance by shaping supernet training dynamics. Building on these insights, we introduce the concept of a Stable Equilibrium State to capture the stability of the bi-level optimization process and propose the Equilibrium Influential ( E I ) metric to assess operation importance. By integrating these elements, we propose EQUINAS, a differentiable NAS approach that leverages the Stable Equilibrium State to identify the optimal state during the search process and derives the final architecture using the E I metric. Extensive experiments across diverse datasets and search spaces demonstrate that EQUINAS achieves competitive test accuracy compared to state-of-the-art methods while significantly reducing search costs. Additionally, EQUINAS shows remarkable performance in Transformer-based architectures and excels in real-world applications such as image classification and text recognition.}, archive = {J_ESWA}, author = {Weisheng Xie and Xiangxiang Gao and Xuwei Fang and Hui Li and Chen Hang and Shaoyuan Li}, doi = {10.1016/j.eswa.2025.129711}, journal = {Expert Systems with Applications}, month = {3}, pages = {129711}, shortjournal = {Expert Syst. Appl.}, title = {EQUINAS: Equilibrium-guided differentiable neural architecture search}, volume = {298}, year = {2026}, }
• (2026). Freq-DETR: Frequency-aware transformer for real-time small object detection in unmanned aerial vehicle imagery. ESWA, 298, 129710. (www)

  @article{ , abstract = {Recent advancements in unmanned aerial vehicle (UAV) and remote sensing technologies have propelled UAV object detection to the forefront of computer vision research. Despite significant progress in deep learning-based detection algorithms, critical challenges persist in small object detection, including high-frequency information loss, inadequate multiscale feature representation, etc. To address these limitations, this paper proposes Freq-DETR, a frequency-aware real-time transformer detection framework leveraging frequency domain analysis to enhance edge detail preservation and global contextual modeling through three novel innovations. First, the frequency-enhanced convolution module (FECM) synergistically integrates spatial and frequency features via dual-branch processing; Second, the decoupled intra-feature scale interaction module (DSC-Clo block) facilitates the integration of high-frequency local and low-frequency global information; Finally, the attention-guided selective feature pyramid network (AGS-FPN) employs context-aware attention for high-level screening feature fusion. Extensive evaluations on the VisDrone2019 benchmark demonstrate that Freq-DETR outperforms the baseline RT-DETR by 4.9 % m a p @ 50 gain while maintaining computational efficiency. There are also remarkable improvements on both UAVDT and HIT-UAV datasets. Ablation investigations and visual interpretability analyses further confirm the complementary benefits of its frequency-domain components and the framework’s robustness in complex aerial scenarios.}, archive = {J_ESWA}, author = {Jiayi Chen and Ningzhong Liu and Han Sun and Yu Wang}, doi = {10.1016/j.eswa.2025.129710}, journal = {Expert Systems with Applications}, month = {3}, pages = {129710}, shortjournal = {Expert Syst. Appl.}, title = {Freq-DETR: Frequency-aware transformer for real-time small object detection in unmanned aerial vehicle imagery}, volume = {298}, year = {2026}, }
• (2026). Companion learning networks: A deep reinforcement learning algorithm with partner networks. ESWA, 298, 129709. (www)

  @article{ , abstract = {Existing deep reinforcement learning (DRL) agents suffer from severe reward instability during late-stage exploration, particularly when encountering novel states in complex continuous environments. A variety of existing studies focus on improving an agent’s reward exploration. However, they ignore the instability problem that arises when the agent faces new states in the later stages of exploration. This paper proposes a novel companion learning network (CLN) based on the idea that the guidance can accelerate human learning efficiency and reduce the risk of making mistakes. The CLN integrates a short-term partner network to intensively learn localized environmental patterns, offering adaptive action guidance for recent states. Simultaneously, a global Q-network dynamically incorporates the partner’s decaying guidance signals, balancing autonomous exploration with error mitigation. As training progresses, the partner’s influence gradually diminishes, allowing the Q-network to solidify robust policies without persistent dependence. Extensive experiments on four OpenAI Gym environments demonstrate that the CLN can significantly improve the exploration stability in most tested scenarios, achieving up to 49% reduction in late-stage reward standard deviation compared to baseline DRL methods.}, archive = {J_ESWA}, author = {Jin Xu and Jinfeng Bu and Yu Zhang and Jia-Dong Zhang and Chi-Yin Chow}, doi = {10.1016/j.eswa.2025.129709}, journal = {Expert Systems with Applications}, month = {3}, pages = {129709}, shortjournal = {Expert Syst. Appl.}, title = {Companion learning networks: A deep reinforcement learning algorithm with partner networks}, volume = {298}, year = {2026}, }
• (2026). Expensive multiobjective immune algorithm using a novel differential evolution in objective space. ESWA, 298, 129708. (www)

  @article{ , abstract = {Generating offspring solutions with strong convergence and diversity is critical when solving expensive multiobjective optimization problems due to the limited number of objective function evaluations. However, existing algorithms produce offspring solutions in the decision space, causing significant uncertainty in obtaining offspring with strong convergence and diversity. To address this issue, we devise a novel differential evolution based on the objective space rather than the decision space, called Differential Objective Evolution (DOE). Specifically, DOE generates objective values with strong convergence and diversity and then maps these values to the decision space to achieve high-quality offspring. Furthermore, we utilize a multiobjective immune algorithm to produce high-quality samples for effectively training the mapping in DOE. When compared with eleven recently proposed algorithms on 105 expensive multiobjective optimization problems, the experiments demonstrate the superiority of our algorithm and the contributions of DOE in both population convergence and diversity.}, archive = {J_ESWA}, author = {Yuchao Su and Wu Lin and Daxin Zhu and Anhui Tan and Ka-Chun Wong and Qiuzhen Lin}, doi = {10.1016/j.eswa.2025.129708}, journal = {Expert Systems with Applications}, month = {3}, pages = {129708}, shortjournal = {Expert Syst. Appl.}, title = {Expensive multiobjective immune algorithm using a novel differential evolution in objective space}, volume = {298}, year = {2026}, }
• (2026). Talk with graph: A fuzzy sentiment-aware framework for explainable recommendation. ESWA, 298, 129707. (www)

  @article{ , abstract = {User reviews reflect user preferences and item characteristics, optimizing the predictive accuracy and explanation generation of personalized recommendation systems. However, existing models face challenges due to subjective uncertainty in user feedback and a lack of transparency. Reviews often contain ambiguous emotional expressions, with the same product receiving positive, neutral, and negative sentiments. Many recommendation models assume alignment between ratings and review sentiments, but in practice, users may give high ratings while expressing dissatisfaction or vice versa. These inconsistencies complicate accurate modeling of user preferences. To address these issues, a Large Language Model (LLM)-driven sentiment-enhanced heterogeneous graph neural network framework is proposed. This framework jointly models interaction data and fuzzy sentiment information from reviews to improve both recommendation accuracy and explainability. By leveraging LLM with dual-prompt strategies, high-quality sentiment distributions and semantic insights are extracted. Review sentiments are then quantified using intuitionistic fuzzy numbers to address data sparsity and uncertainty, capturing implicit relationships between users, items, and entities in a sentiment-enhanced heterogeneous relational graph. A fuzzy sentiment-weighted graph convolutional network (FSGCN) is introduced for dynamic higher-order feature learning, adjusting sentiment weights based on user-item interactions and emotional context. The framework also integrates LLM-driven query interpretation to generate recommendations with transparent, context-aware rationales. This approach enables users to understand the reasoning behind recommendations, significantly enhancing explainability and trust.}, archive = {J_ESWA}, author = {Zhinan Li and Zhenyu Liu and Guodong Sa and Mingjie Hou and Jiacheng Sun and Jianrong Tan}, doi = {10.1016/j.eswa.2025.129707}, journal = {Expert Systems with Applications}, month = {3}, pages = {129707}, shortjournal = {Expert Syst. Appl.}, title = {Talk with graph: A fuzzy sentiment-aware framework for explainable recommendation}, volume = {298}, year = {2026}, }
• (2026). Geodesic-based path planning for port transfer robots on riemannian manifolds. ESWA, 298, 129706. (www)

  @article{ , abstract = {With the rapid intelligent transformation of the automotive industry and the surge in production volume, intelligent autonomous robots equipped with integrated perception and planning systems are playing an increasingly vital role in vehicle transfer operations. Optimizing dispatch paths of robots is essential for improving overall operational efficiency, yet achieving a balance among path length, feasibility, and safety margin remains a significant challenge. To address this issue, we propose a geodesic-based path planning method formulated on Riemannian manifolds. The approach jointly considers directional motion constraints, steering effort, and obstacle accessibility boundaries to construct a Riemannian metric tensor that encodes local path cost structures. This transforms the planning task into a geodesic shortest path problem, which is efficiently solved using the Geometric heat flow (GHF) method. The resulting paths naturally comply with kinematic constraints and exhibit strong obstacle-avoidance capabilities, significantly enhancing safety and executability. Extensive simulations and real-world experiments in high-density port yard environments demonstrate the practicality and robustness of the proposed method under complex spatial constraints and obstacle configurations.}, archive = {J_ESWA}, author = {Runjiao Bao and Junzheng Wang and Shoukun Wang}, doi = {10.1016/j.eswa.2025.129706}, journal = {Expert Systems with Applications}, month = {3}, pages = {129706}, shortjournal = {Expert Syst. Appl.}, title = {Geodesic-based path planning for port transfer robots on riemannian manifolds}, volume = {298}, year = {2026}, }
• (2026). A social balance theory-based modeling framework for group-to-empirical decision-making transition with cognitive inertia and trust propagation. ESWA, 298, 129705. (www)

  @article{ , abstract = {Inspired by empirical decision-making (EDM) processes, we propose a novel modeling framework where agents iteratively integrate social neighbors’ opinions into their cognitive inertia sequences (CISs), gradually prioritizing their accumulated CISs over time. This framework simulates the transition from group decision-making (GDM) to EDM through dynamic trust/distrust propagation and aggregation mechanisms grounded in social balance theory–capturing relational scenarios such as “a friend of a friend is a friend”, “a friend of an enemy is an enemy”, “an enemy of a friend is an enemy”, and “an enemy of an enemy is a stranger”. The paradigm incorporates two core mechanisms: (1) an endogenous cognitive inertia mechanism that uses the psychological serial-positioning effect to model cognitive inertia weights, accounting for primacy, recency, and U-shaped memory effects; and (2) an exogenous mechanism that quantifies comprehensive trust/distrust degrees via opinion similarity, stability similarity, and network structure similarity. To prevent followers from falling into cognitive freezing, a cluster leader-based consensus-reaching strategy is introduced. Extensive comparative experiments on real-world network datasets confirm the model’s effectiveness and robustness.}, archive = {J_ESWA}, author = {Jianglin Dong and Yiyi Zhao and Shangqun Mu and Haixia Mao and Jiangping Hu}, doi = {10.1016/j.eswa.2025.129705}, journal = {Expert Systems with Applications}, month = {3}, pages = {129705}, shortjournal = {Expert Syst. Appl.}, title = {A social balance theory-based modeling framework for group-to-empirical decision-making transition with cognitive inertia and trust propagation}, volume = {298}, year = {2026}, }
• (2026). OTPS-VO: Enhanced RGB-D odometry for indoor service robots leveraging structural features. ESWA, 298, 129704. (www)

  @article{ , abstract = {Simultaneous Localization and Mapping (SLAM) is essential for indoor service robots to achieve reliable navigation and mapping. While point and line features have been extensively utilized to enhance the accuracy of visual odometry (VO), current methods often overlook the rich geometric information embedded in the spatial relationships among structural lines. In particular, the parallelism and collinearity within groups of line segments are underexploited, and geometric constraints are typically applied only heuristically or post hoc, limiting robustness in low-texture and repetitive environments. To address these challenges, a robust VO system is proposed that integrates structural feature grouping with adaptive MW tracking. A unified feature extraction strategy is introduced to detect point and line features simultaneously, improving computational efficiency. To mitigate pose drift caused by unreliable line segments, a set of parallel line features is constructed based on local geometric constraints, and a novel reprojection error model is formulated to enhance pose estimation. Furthermore, a tracking strategy based on local Manhattan World (MW) structure is developed to ensure low-drift estimation across various structured indoor scenes. Extensive experiments on multiple public datasets and a custom-built service robot platform demonstrate that the proposed method outperforms existing state-of-the-art approaches under dynamic lighting conditions and in environments rich in lines and planes. The system also operates at a real-time speed of 30 frames per second, meeting the requirements of practical robotic applications.}, archive = {J_ESWA}, author = {Zhiyu Wang and Weili Ding and Ying Zhang and Changchun Hua}, doi = {10.1016/j.eswa.2025.129704}, journal = {Expert Systems with Applications}, month = {3}, pages = {129704}, shortjournal = {Expert Syst. Appl.}, title = {OTPS-VO: Enhanced RGB-D odometry for indoor service robots leveraging structural features}, volume = {298}, year = {2026}, }
• (2026). Adaptive gated meta graph retention network: A model for urban traffic flow prediction. ESWA, 298, 129703. (www)

  @article{ , abstract = {Traffic flow prediction is crucial for urban transportation systems. Existing models are still deficient in training efficiency and modeling dynamic spatial-temporal dependencies, various external factors, time-varying topology. Based on this, this paper introduces the Adaptive Gated Meta Graph Retention Network (AGMGRN), a novel model for spatial-temporal traffic flow prediction. Specifically, the AGMGRN integrates the attention mechanism with the retention network to model spatial-temporal dependencies. The AGMGRN proposes a gated dynamic connection block to enhance the model’s dynamic modeling capabilities. The AGMGRN considers the influence of external factors on traffic conditions through meta-learning approaches. The AGMGRN proposes an adaptive graph block to construct time-varying topologies. Experiments on four actual large-scale datasets demonstrate that the AGMGRN achieves superior prediction accuracy and high applicability.}, archive = {J_ESWA}, author = {Xing Li and Yuequan Bao}, doi = {10.1016/j.eswa.2025.129703}, journal = {Expert Systems with Applications}, month = {3}, pages = {129703}, shortjournal = {Expert Syst. Appl.}, title = {Adaptive gated meta graph retention network: A model for urban traffic flow prediction}, volume = {298}, year = {2026}, }
• (2026). DASF-GRL: Dynamic agent-scaling framework with game-augmented reinforcement learning for defensive counter-air operations. ESWA, 298, 129702. (www)

  @article{ , abstract = {Defensive Counter-Air (DCA) operations are pivotal for modern air defense, but existing studies are limited by static defender populations and oversimplified attacker models. We address these limitations with the Dynamic Agent-Scaling Framework with Game-Augmented Reinforcement Learning (DASF-GRL), which dynamically scales defender populations based on real-time threat levels. Specifically, we introduce a hybrid imitation-reinforcement training strategy that integrates attention mechanisms into critic networks to enable dynamic agent scaling. By incorporating a safety barrier function rooted in differential game theory, we constrain agents’ action spaces and enhance policy reliability. Furthermore, we developed a DCA simulation platform supporting reinforcement learning validation and designed a novel Apollonius-based penetration strategy for attackers to improve algorithmic robustness. Experiments demonstrate that DASF-GRL adaptively adjusts defender populations across scenarios involving 20, 40, and 60 attackers, markedly outperforming baseline methods in convergence speed and defense success rates. This framework offers novel theoretical paradigms and practical tools for intelligent decision-making in DCA environments.}, archive = {J_ESWA}, author = {Yuxuan Chen and He Luo and Guoqiang Wang}, doi = {10.1016/j.eswa.2025.129702}, journal = {Expert Systems with Applications}, month = {3}, pages = {129702}, shortjournal = {Expert Syst. Appl.}, title = {DASF-GRL: Dynamic agent-scaling framework with game-augmented reinforcement learning for defensive counter-air operations}, volume = {298}, year = {2026}, }
• (2026). Coordinated low-carbon economic scheduling of integrated electricity-heat-gas-hydrogen-methanol multi-microgrids considering electricity-methanol transaction. ESWA, 298, 129701. (www)

  @article{ , abstract = {The uneven spatial and temporal distribution of renewable energy resources poses significant challenges for multi-microgrid (MG) systems, resulting in high operational costs and low renewable energy utilization. To overcome these challenges, this work investigates a peer-to-peer electricity transaction and hydrogen-methanol-hydrogen technology-based methanol transaction among multi-MG. Besides, to realize net-zero emissions and carbon cycle utilization, the carbon capture system and hydrogen blending system are introduced into MG to reduce carbon dioxide emissions and capture and reform carbon dioxide for methanol synthesis equipment. Additionally, a cooperative operation model based on the Nash bargaining theory for multi-MGs under the transaction amount and price constraints of electricity and methanol is constructed. Due to the characteristics of non-convex and non-linear, the Nash bargaining is transformed into minimizing operation costs (sub-problem one) and maximizing payment benefits (sub-problem two). During the process of benefit allocation in sub-problem two, this work adopts a nonlinear energy sharing mapping method to quantify the comprehensive contribution rate of each MG to the multi-MG system, thereby achieving fair allocation of benefits. Finally, the alternating direction multiplier method is used to solve the model, effectively protecting the privacy of each MG. The simulation results demonstrate that a multi-MG system considering electricity and methanol transactions can effectively decrease carbon emissions and the total operational costs by 21.53% and 27.01% compared to only considering electricity transactions, respectively. Overall, the proposed electricity and methanol transactions strategy simultaneously reduces the overall system operation costs and carbon emissions, underscoring its advantages and significance.}, archive = {J_ESWA}, author = {Jiale Li and Bo Yang and Yiming Zhou and Hongchun Shu and Hongbiao Li and Dengke Gao and Lin Jiang}, doi = {10.1016/j.eswa.2025.129701}, journal = {Expert Systems with Applications}, month = {3}, pages = {129701}, shortjournal = {Expert Syst. Appl.}, title = {Coordinated low-carbon economic scheduling of integrated electricity-heat-gas-hydrogen-methanol multi-microgrids considering electricity-methanol transaction}, volume = {298}, year = {2026}, }
• (2026). Heterogeneous cloud resource allocation: A case study on real-time transcoding in live streaming. ESWA, 298, 129700. (www)

  @article{ , abstract = {The explosion in popularity of crowdsourced live streaming (CLS) has led to a huge increase in demand for cloud resources to support real-time video transcoding. CLS transcoding is real-time, geographically distributed and computationally intensive. Therefore, transcoding service providers need to cost-effectively utilize diverse heterogeneous cloud resources, while guaranteeing quality of service standards to ensure a good streaming experience for the viewers. To support the above, we developed a novel proactive-reactive resource allocation framework that optimizes the overall cost of supporting the CLS transcoding service using heterogeneous edge and cloud computing resources. The offline proactive policy evaluator aims to provide a good and adaptable resource usage plan in advance, matching the predicted demand with the heterogeneous resources. The reactive execution module monitors the actual demand online and controls the resource usage to compensate for deviations from the offline prediction. Our experiments show that the proposed approach leads to a cost reduction of 42 % compared to the fixed usage ratio strategy based on expert knowledge.}, archive = {J_ESWA}, author = {Yinuo Li and Jin-Kao Hao and Kwong Meng Teo and Liwei Song}, doi = {10.1016/j.eswa.2025.129700}, journal = {Expert Systems with Applications}, month = {3}, pages = {129700}, shortjournal = {Expert Syst. Appl.}, title = {Heterogeneous cloud resource allocation: A case study on real-time transcoding in live streaming}, volume = {298}, year = {2026}, }
• (2026). Adaptive multi-step path planning for multi-robot in dynamic environments based on hybrid optimization approach. ESWA, 298, 129699. (www)

  @article{ , abstract = {The multi-robot path planning problem requires algorithms with high convergence speed and accuracy, as well as the completeness of the search probability for the optimal path. The integration of metaheuristic algorithms in path planning has proven to be remarkably efficient. This paper introduces a novel hybrid metaheuristic algorithm, Beluga Whale-Crayfish Optimization (BWCOA), for enhanced global optimization in path planning applications. While the Crayfish Optimization (COA) demonstrates superior convergence speed, its inherent probabilistic path completeness remains suboptimal. To address this limitation, we present three key innovations: a dynamic probability completion mechanism, adaptive convergence acceleration factors, and balanced exploration–exploitation trade-off parameters. The proposed BWCOA synergizes Beluga Whale Optimization (BWO)’s basin-hopping capability with COA’s swarm intelligence through parallel combined exploration strategies. To prove its powerfulness, a series of comparative analyses were conducted between BWCOA and other leading algorithms across two comprehensive test function suites. The numerical experiment results underscore the significant superiority of BWCOA over its counterparts. In the context of path planning simulations, BWCOA demonstrated notable improvements over COA within the same number of function evaluations, with average enhancement rates of 6.49 %, 7.42 %, 15.09 %, 76.42 %, and 0.73 % across five evaluation metrics. Similarly, when compared to BWO on the same set of indicators, BWCOA showed average improvement rates of 22.39 %, 27.71 %, 70.53 %, 260.86 %, and 41.22 %. Furthermore, the running time of BWCOA is comparable to that of similar algorithms.}, archive = {J_ESWA}, author = {Liguo Yao and Guanghui Li and Taihua Zhang and Abdelazim G. Hussien and Yao Lu}, doi = {10.1016/j.eswa.2025.129699}, journal = {Expert Systems with Applications}, month = {3}, pages = {129699}, shortjournal = {Expert Syst. Appl.}, title = {Adaptive multi-step path planning for multi-robot in dynamic environments based on hybrid optimization approach}, volume = {298}, year = {2026}, }
• (2026). A two-stage evolutionary algorithm based on hybrid penalty strategy and its application to multi-UAV path planning. ESWA, 298, 129698. (www)

  @article{ , abstract = {Constrained optimization problems with complex and dynamic constraints pose significant challenges for evolutionary algorithms, as the constraints reshape the solution space and create conflicts between feasibility maintenance and global exploration. To address this issue, this study proposes TSC-PSODE, a two-stage evolutionary algorithm based on a hybrid penalty strategy. The algorithm employs an external penalty in the early stage to preserve population diversity and enhance exploration, while an internal penalty in the later stage accelerates convergence toward high-quality feasible solutions. In addition, a cooperative strategy combining differential evolution operators strengthens robustness and helps the population escape local optima. Experimental evaluations on the CEC2017 benchmark suite (the IEEE Congress on Evolutionary Computation 2017 benchmark) and multi-Unmanned Aerial Vehicle path planning tasks demonstrate that TSC-PSODE consistently outperforms state-of-the-art algorithms. The results confirm that the proposed method not only provides an effective mechanism for constraint handling, but also achieves a favorable balance between exploration and exploitation by maintaining diversity and accelerating convergence. In practical terms, TSC-PSODE is capable of generating safe and feasible flight paths for multiple UAVs in complex environments, highlighting its adaptability and competitiveness for real-world applications.}, archive = {J_ESWA}, author = {Eryang Guo and Yuelin Gao and Chenyang Hu}, doi = {10.1016/j.eswa.2025.129698}, journal = {Expert Systems with Applications}, month = {3}, pages = {129698}, shortjournal = {Expert Syst. Appl.}, title = {A two-stage evolutionary algorithm based on hybrid penalty strategy and its application to multi-UAV path planning}, volume = {298}, year = {2026}, }
• (2026). Critical commentary on “Reptile search algorithm (RSA): A nature-inspired meta-heuristic optimizer”. ESWA, 298, 129697. (www)

  @article{ , archive = {J_ESWA}, author = {Ngaiming Kwok}, doi = {10.1016/j.eswa.2025.129697}, journal = {Expert Systems with Applications}, month = {3}, pages = {129697}, shortjournal = {Expert Syst. Appl.}, title = {Critical commentary on “Reptile search algorithm (RSA): A nature-inspired meta-heuristic optimizer”}, volume = {298}, year = {2026}, }
• (2026). 2PADMS: Two-stage prediction and data migration strategy based on hard disk failure time. ESWA, 298, 129696. (www)

  @article{ , abstract = {With the explosive growth of global data volume, the usage of hard disk drives (HDDs) is also increasing rapidly. Consequently, the number of failed disks is continuously rising, which can affect storage service quality and even lead to data loss when failures occur.In recent years, the active fault-tolerant technology, which collects hard disks’ Self Monitoring Analysis and Reporting Technology (SMART) data-set, predicts hard disk failure by machine learning model, and repairs near-failure disks’ data to health disks in advance, has become a common research hotspot in both academia and industry. Aiming at the existing problems such as interference characteristics, inaccurate failure time prediction, competition of system resources between data migration and front service, this paper researches the two-stage prediction model and data migration strategy based on hard disk failure time, including the two-stage hard disk information feature selection method, the two-stage prediction method of hard disk failure time, and the data migration elastic system resource allocation strategy. Feature selection is performed by combining embedding methods with visualization, and the importance of the selected features is evaluated using a random forest model. Based on the feature importance, further refinement is carried out to obtain the final feature set. Before predicting the failure time of hard drives, XGBoost is first used in a voting manner to identify drives predicted to be faulty. Then, a trained Bidirectional Long Short-Term Memory network (Bidirectional LSTM) enhanced with a self-attention mechanism is employed to predict the exact failure time.Experimental results show that on the Backblaze dataset, the model achieves a mean absolute error of 1.24 when predicting failure times. The recall rate for predicting failures within 7 days reaches 98.79 %, the error rate is 0.30 %, the F1 score is 99.24 %, and the precision is 99.69 %. The elastic system resource allocation strategy for data migration improves business IOPS by 47.19 % and reduces latency by 38.68 %.}, archive = {J_ESWA}, author = {Huiyuan Qiang and Yuequan Li and Hongzhang Yang and Ping Wang and Yaofeng Tu and Shang Yang}, doi = {10.1016/j.eswa.2025.129696}, journal = {Expert Systems with Applications}, month = {3}, pages = {129696}, shortjournal = {Expert Syst. Appl.}, title = {2PADMS: Two-stage prediction and data migration strategy based on hard disk failure time}, volume = {298}, year = {2026}, }
• (2026). Federated recommender system with data valuation for E-commerce platform. ESWA, 298, 129695. (www)

  @article{ , abstract = {Federated Learning (FL) is gaining prominence in machine learning as privacy concerns grow. This paradigm allows each client (e.g., an individual online store) to train a recommendation model locally while sharing only model updates, without exposing the raw interaction logs to a central server, thereby preserving privacy in a decentralized environment. Nonetheless, despite the abundance of publicly available datasets that could substantially enrich local training, most existing FL-based recommender systems continue to rely only on private client data, leaving this potential largely unexplored. To this end, we consider a realistic scenario wherein a large shopping platform collaborates with multiple small online stores to build a global recommender system. The platform possesses global data, such as shareable user and item lists, while each store holds a portion of interaction data privately (or locally). Although integrating global data can help mitigate the limitations of sparse and biased clients’ local data, it also introduces additional challenges: simply combining all global interactions can amplify noise and irrelevant patterns, degrading personalization and increasing computational costs. To address these challenges, we propose, which selectively augments each client’s local graph with semantically aligned samples from the global dataset. employs: (i) a pre-trained graph encoder to extract global structural features, (ii) a local valid predictor to assess the client-specific relevance, and (iii) a reinforcement-learning-based probability estimator to filter and sample only the most pertinent global interactions. improves performance by up to 34.86% on recognized benchmarks in FL environments.}, archive = {J_ESWA}, author = {Jongwon Park and Minku Kang and Wooseok Sim and Soyoung Lee and Hogun Park}, doi = {10.1016/j.eswa.2025.129695}, journal = {Expert Systems with Applications}, month = {3}, pages = {129695}, shortjournal = {Expert Syst. Appl.}, title = {Federated recommender system with data valuation for E-commerce platform}, volume = {298}, year = {2026}, }
• (2026). EEG emotion recognition through a domain-adversarial multi-feature fusion network. ESWA, 298, 129694. (www)

  @article{ , abstract = {Accurate recognition of EEG signals linked to emotions is crucial for neuroscience and human-computer interaction. However, variability in EEG emotion recognition among individuals results in inconsistent feature distributions and limited generalization across subjects. To enhance the robustness of the model, we propose a deep learning approach integrating a domain adversarial migration network with an attention mechanism. Initially, a feature extractor with a hierarchical architecture (low-medium-high levels) is employed to capture multi-scale EEG features, which are then normalized for age and encoded for genderand education before being aligned with EEG features through spatio-temporal replication. Subsequently, global distribution alignment is achieved using multi-kernel maximum mean difference (MK-MMD), subdomain adversarial alignment is accomplished with a gradient inversion layer (GRL), and decision boundary clarity is enhanced through joint emotion classification loss. The generalization capability and effectiveness of the model are validated using the DEAP and DREAMER datasets, offering insights for cross-subject emotion recognition research and applications.}, archive = {J_ESWA}, author = {Weitong Sun and Yuping Su and Yumei Zhang and Xiaojun Wu}, doi = {10.1016/j.eswa.2025.129694}, journal = {Expert Systems with Applications}, month = {3}, pages = {129694}, shortjournal = {Expert Syst. Appl.}, title = {EEG emotion recognition through a domain-adversarial multi-feature fusion network}, volume = {298}, year = {2026}, }
• (2026). DFHD: Dual-granularity fusion network using historical drugs for drug recommendation. ESWA, 298, 129693. (www)

  @article{ , abstract = {Drug recommendation is a task in clinical medicine aimed at suggesting a set of safe and effective medications based on a patient’s electronic health records. Current approaches either rely on diagnoses and procedures documented in electronic health records to recommend drug combinations or focus on enhancing drug recommendation safety by considering drug-drug interactions. However, these approaches often overlook the significance of historical medication information in drug recommendation despite its strong correlation with current diagnostic and prescription recommendation. Therefore, we propose a Dual-granularity Fusion Network using Historical Drugs. Specifically, at the time-series modeling level, recurrent neural networks are used to extract time-series features from historical drug data to construct coarse-grained drug characterizations. At the molecular structure modeling level, a graph neural network is used to build a relationship map between drug molecular structures and drug substructures to capture the fine-grained interactions within drug molecules. In addition, we designed a historical drug molecule awareness module to capture historical drug information during drug molecule modeling so as to identify the drugs that really help to cure patients. To effectively integrate dual-granularity information, we design a dual-granularity fusion module to realize the synergistic learning of temporal and structural features. To ensure drug safety, we introduce the DDI loss function to adaptively adjust the loss weights based on the drug interaction risk results, taking into account the optimization goals of efficacy and safety. Our source code is available at https://github.com/AK-321/DFHD .}, archive = {J_ESWA}, author = {Kang An and Ming-Yu Lu and Yan-Kai Tian and Yi-Jia Zhang}, doi = {10.1016/j.eswa.2025.129693}, journal = {Expert Systems with Applications}, month = {3}, pages = {129693}, shortjournal = {Expert Syst. Appl.}, title = {DFHD: Dual-granularity fusion network using historical drugs for drug recommendation}, volume = {298}, year = {2026}, }
• (2026). An acoustic-electromagnetic detection system based on joint parameter estimation of atomic norm algorithm. ESWA, 298, 129692. (www)

  @article{ , abstract = {The time delay and Doppler shift parameters in radar system echo signals serve as effective tools for multi-target identification and localization in covert environments. However, the nonlinear characteristics of stationary targets are often masked by surrounding environmental factors, and traditional joint parameter estimation algorithms tend to suffer from high computational complexity and errors during demodulation. To address these challenges, this paper proposes an acoustic-electromagnetic intermodulation detection system based on a novel atomic-paradigm algorithm, which ensures localization accuracy with minimal computational complexity and zero false alarms. Specifically, the system excites the target by introducing acoustic field energy coupling, generating discernible micromotion features. The resulting acoustically modulated signal is then modeled as a two-dimensional line spectral estimation problem, capturing the target’s time delay and Doppler shift. Furthermore, the joint parameter estimation algorithm is enhanced by relaxing dyadic constraints under sufficient conditions. In our experiments, a harmonic radar physical system is constructed to simultaneously localize and measure multiple non-clustered micromotion targets. The recognition accuracy is quantitatively evaluated using a classical neural network model, achieving 86.9 % accuracy across five classified targets. The improved algorithm’s performance in joint parameter estimation is also assessed under varying signal-to-noise ratios and demodulation error rates, with a detailed time complexity analysis provided.}, archive = {J_ESWA}, author = {Sheng Wu and Yilin Cai and Yijing Zheng and Dingzhao Li and Hongjun Lai and Haixin Sun}, doi = {10.1016/j.eswa.2025.129692}, journal = {Expert Systems with Applications}, month = {3}, pages = {129692}, shortjournal = {Expert Syst. Appl.}, title = {An acoustic-electromagnetic detection system based on joint parameter estimation of atomic norm algorithm}, volume = {298}, year = {2026}, }
• (2026). A novel convex-hull-based algorithm for classification problems with imbalanced and overlapping data. ESWA, 298, 129691. (www)

  @article{ , abstract = {Classification is a fundamental task in supervised machine learning. This problem becomes challenging when dealing with imbalanced and overlapping datasets. In such cases, learning algorithms often perform well in identifying the labels of majority class data points but exhibit high error rates in predicting the minority class. This paper proposes an innovative method based on the convex-hull concept to enhance classification for imbalanced and overlapping datasets. Unlike undersampling approaches that may lead to the loss of valuable information, our method focuses on preserving the data. The process begins by clustering the data points for each class separately in such a way that no points from the opposite class fall within the convex-hull of each cluster. Then, the support vector machine (SVM) is used to separate every cluster of a given class from the data points of the opposite class. Afterward, data points inside the SVM boundaries are considered as non-overlapping, while those outside the SVM boundaries are identified as overlapping data. The XGBoost algorithm is then employed to classify the data points within the overlapping region. Extensive experiments on a variety of simulated and real-world datasets confirm the effectiveness of the proposed method in terms of various evaluation metrics, compared to existing relevant algorithms for handling imbalanced and overlapping datasets.}, archive = {J_ESWA}, author = {Farnaz Hooshmand and Sogol Peik-Mortazavi}, doi = {10.1016/j.eswa.2025.129691}, journal = {Expert Systems with Applications}, month = {3}, pages = {129691}, shortjournal = {Expert Syst. Appl.}, title = {A novel convex-hull-based algorithm for classification problems with imbalanced and overlapping data}, volume = {298}, year = {2026}, }
• (2026). Unbiased representation learning via feature decoupling network for cross-scene hyperspectral image classification. ESWA, 298, 129690. (www)

  @article{ , abstract = {For hyperspectral cross-scene classification (HSIC) tasks, the model is trained on the source domains (SDs) and applied directly to the unseen target domains (TDs). For this domain generalization (DG) challenge, a significant issue is the contradiction between the overparameterized model and the limited training domain, which results in the absorption of spurious correlations from environmental features. To alleviate this contradiction, this study proposes a domain extension generator with a feature decoupling network (FDNet). The generator initially decouples the SD into reflectance and shading components, treating them as causal and environmental features, respectively. Considering possible causal residues in environmental features, the shading components are shuffled by style to eliminate undesired correlations. Then, the reflectance and sparsified shading are reconstructed for extension, enriching the training diversity without environmental interference. In addition, to enhance the stability of class-level causal representation, a supervised aggregation strategy is designed to minimize the intra-class distance of the reflectance domain, and supervised contrastive learning is employed to enhance the class-domain semantic consistency information. Comparative analysis with advanced domain generalization and adaptation approaches on three HSI datasets validates the superiority in accuracy and Kappa coefficient metrics of the proposed method.}, archive = {J_ESWA}, author = {Hanqing Zhao and Lianlei Lin and Zongwei Zhang and Sheng Gao and Junkai Wang}, doi = {10.1016/j.eswa.2025.129690}, journal = {Expert Systems with Applications}, month = {3}, pages = {129690}, shortjournal = {Expert Syst. Appl.}, title = {Unbiased representation learning via feature decoupling network for cross-scene hyperspectral image classification}, volume = {298}, year = {2026}, }
• (2026). Automated prompt engineering pipelines: Fine-tuning LLMs for enhanced response accuracy. ESWA, 298, 129689. (www)

  @article{ , abstract = {This paper presented an Automatic Role Prompting System that seeks to improve the performance of the Large Language Model (LLM) by allowing models to assume varied roles through role-based prompting and, as a result, qualitatively improve the relevance of outputs. Our Automatic Role Prompting System’s target audience is people who do not have domain knowledge. The guiding framework (consisting of an Automated Script for discovering roles and fields layered on top of prompt engineering, and Natural Language Inference (NLI) models trained in advance), was robustly tested through the use of three datasets: our set of 1990 curated prompts, WikiQA, and the AwesomeChatGPTPrompts. We implemented a novel evaluation strategy using GPT-Eval, which scales prompts according to completeness, clarity, and relevance. We found substantially better performance than traditional rule- and template-based approaches, yielding accuracy improvements as high as 97.6 %. Overall, this work demonstrates the promise of an Automated Role Prompting System to help people engage and work more effectively and efficiently with Large Language Models (LLMs).}, archive = {J_ESWA}, author = {Samar Hendawi and Tarek Kanan and Mohammed Elbes and Ala Mughaid and Shadi Alzu’bi}, doi = {10.1016/j.eswa.2025.129689}, journal = {Expert Systems with Applications}, month = {3}, pages = {129689}, shortjournal = {Expert Syst. Appl.}, title = {Automated prompt engineering pipelines: Fine-tuning LLMs for enhanced response accuracy}, volume = {298}, year = {2026}, }
• (2026). A hybrid fusion network using convolutional vision transformers for landslide identification. ESWA, 298, 129688. (www)

  @article{ , abstract = {Convolutional neural networks (CNN) have made great strides in the segmentation of remote sensing images, but they still have certain inherent drawbacks when working with small targets and complex geological structures. These drawbacks include incomplete contextual information integration, blurry edges, and inaccurate target localisation. This study suggests using a hybrid CNN-Transformer network to improve the segmentation of landslide regions in high-resolution remote sensing images in order to overcome these difficulties. A comprehensive investigation has been conducted on the use of CNN and transformers to accomplish the task of semantic segmentation. According to experimental data, our model outperforms the state-of-the-art CNN-based, Transformer-based, and even CNN-plus-Transformer combination models for image segmentation tasks by a large margin. When it comes to landslide area segmentation, it performs exceptionally well.}, archive = {J_ESWA}, author = {S. Sreelakshmi and S.~S. Vinod Chandra}, doi = {10.1016/j.eswa.2025.129688}, journal = {Expert Systems with Applications}, month = {3}, pages = {129688}, shortjournal = {Expert Syst. Appl.}, title = {A hybrid fusion network using convolutional vision transformers for landslide identification}, volume = {298}, year = {2026}, }
• (2026). Towards intelligent online cross-selling. ESWA, 298, 129686. (www)

  @article{ , abstract = {The ubiquity of online cross-selling for fashion demands a large number of qualified outfit compositions. This paper targets practical and intelligent online cross-selling by providing a more accurate fashion compatibility model and a reliable evaluation protocol for evaluating the fashion compatibility model. Firstly, a Hierarchical Outfit Network (HON) is proposed to leverage multi-layer relations among attributes, items, and outfits. The awareness of multiple relations hidden in various outfits enables the HON to outperform all state-of-the-art methods on fill-in-the-blank (FITB) accuracy and compatibility Area Under Curve (AUC) on the Maryland and Type-aware test sets. Meanwhile, a new evaluation protocol is introduced to assess the fashion compatibility model more objectively and accurately, namely, Aesthetic 100 (A100). A100 possess three desirable characteristics: 1) Completeness . All types of standards in the fashion aesthetic system are covered through two tests, namely LAT (Liberalism Aesthetic Test) and AAT (Academicism Aesthetic Test); 2. Reliability . It is an agnostic protocol and consistent with major indicators. It provides an objective and fair assessment for model comparison. 3. Explainability . A100 assesses the model on more fine-grained dimensions, e.g. , Color, Material, and Balance demonstrating its superiority in identifying essential characteristics of fashion aesthetics. Experimental results demonstrate the progress of A100 in the aspects of Reliability and Explainability. The evaluation results on A100 also show the generalization ability of HON from both quantitative and qualitative perspectives. Finally, solutions for multiple applications in fashion retailing are proposed to show how HON can be utilized to help online cross-selling.}, archive = {J_ESWA}, author = {Kaicheng Pang and Xingxing Zou and Zowie Broach and Waikeung Wong}, doi = {10.1016/j.eswa.2025.129686}, journal = {Expert Systems with Applications}, month = {3}, pages = {129686}, shortjournal = {Expert Syst. Appl.}, title = {Towards intelligent online cross-selling}, volume = {298}, year = {2026}, }
• (2026). GCMF-net: Global-aware cross-attention and mask-guided fusion for multispectral object detection. ESWA, 298, 129679. (www)

  @article{ , abstract = {Multispectral Object Detection has shown significant advantages under various lighting and weather conditions, with efficient fusion of RGB and thermal information playing a key role. Previous studies have demonstrated the effectiveness of feature fusion based on convolutional neural networks, but limited local feature interactions hinder the capture of global complementary information. To address these limitations, some methods adopt complex fusion strategies to enhance complementary feature extraction, yet fail to mitigate feature redundancy, which negatively impacts detection performance. In this paper, we propose a novel Global-aware Cross-attention and Mask-guided Fusion (GCMF) module for Multispectral Object Detection, following a fusion-refinement paradigm. In the fusion stage, we first introduce Efficient Channel Attention with Weighted Max-Pooling (ECA-WM) to focus on key information within each modality and achieve implicit alignment before fusion. Subsequently, the Global-aware Cross-Attention Transformer (GCAT) effectively captures complementary cross-modal information and models global features. In the refinement stage, the Mask-guided Refinement Strategy (MRS) generates segmentation masks to distinguish target features from the background. These masks are applied before and after cross-modal interaction to highlight target-relevant information while suppressing irrelevant features, resulting in highly discriminative fused representations. Extensive experimental comparisons demonstrate that the proposed GCMF fusion strategy achieves state-of-the-art performance on the publicly available FLIR, LLVIP and DVTOD datasets, with absolute improvements of 2.8 %, 4.2 % and 4.0 % over the previous methods, respectively. Moreover, the proposed strategy is general and effective, making it adaptable to various detection frameworks.}, archive = {J_ESWA}, author = {Zhong Qu and Jin Yang and Shufang Xia}, doi = {10.1016/j.eswa.2025.129679}, journal = {Expert Systems with Applications}, month = {3}, pages = {129679}, shortjournal = {Expert Syst. Appl.}, title = {GCMF-net: Global-aware cross-attention and mask-guided fusion for multispectral object detection}, volume = {298}, year = {2026}, }
• (2026). Oriented bounding box detection algorithm for dense scenarios of robotic arm operation. ESWA, 298, 129678. (www)

  @article{ , abstract = {In the context of the national promotion of intelligent manufacturing and the ’Industry4.0’ strategy, the demand for intelligent robotic arms in industrial production has steadily increased. However, challenges such as occlusion, significant object scale variations, and strict real-time requirements have made target detection in densely packed environments more challenging. This study, based on the YOLOv11 algorithm, proposes an efficient oriented bounding box detection method aimed at improving the model’s performance in feature extraction, computational efficiency, and network lightweighting to tackle target detection challenges in dense industrial settings. A Dynamic-Cross-Stage-Dual-Conv module was designed to enhance the Bottleneck section, employing a parallel dual-branch structure for local feature extraction and global context fusion. Simultaneously, a CIoU loss function with geometric perception was introduced to improve object localization accuracy and strengthen the network’s ability to handle densely stacked objects. Next, a Modulated-Deform-Conv deformable convolution module was integrated into the Backbone structure, dynamically adjusting the convolution kernel sampling positions, enabling the network to learn deformation features in dense scenes, improving adaptability to shape and scale variations while reducing computational load. Additionally, a C3K2_FasterBlock lightweight structure, utilizing partial convolutions and sparse connections, was proposed to minimize redundant calculations and optimize feature interactions. On a custom-built dense object dataset, the model achieved a 2.9 % increase in mAP@0.5 and reduced computational cost by 14 %. Finally, the improved model was deployed on the Jetson Orin Nano development board, demonstrating its practical value in robotic arm recognition and grasping tasks in dense industrial environments, offering a new paradigm for future applications.}, archive = {J_ESWA}, author = {Jinshun Dong and Lixia Deng and Dapeng Wan and Chenxu Liu and Jianqin Yin and Meiqi Guo and Hongyu Zhang and Shoujun Lin and Haiying Liu and Lida Liu}, doi = {10.1016/j.eswa.2025.129678}, journal = {Expert Systems with Applications}, month = {3}, pages = {129678}, shortjournal = {Expert Syst. Appl.}, title = {Oriented bounding box detection algorithm for dense scenarios of robotic arm operation}, volume = {298}, year = {2026}, }
• (2026). CrossModalNet: A dual-modal object detection network based on cross-modal fusion and channel interaction. ESWA, 298, 129677. (www)

  @article{ , abstract = {Object detection in complex environments, particularly under conditions such as low illumination or adverse weather, remains a significant challenge. Multispectral detection techniques that integrate visible and infrared imagery offer a promising solution by leveraging complementary modality information. However, substantial discrepancies between these modalities hinder traditional fusion strategies, which often fail to adaptively align and integrate features, resulting in information loss and diminished detection performance. To overcome this limitation, we propose CrossModalNet, a novel cross-modal fusion and channel interaction framework. CrossModalNet comprises two key modules: Convolutional Attention Interaction Module (CAIM) and Bidirectional Cross-Modal Attention Module (BiCAM). CAIM enables effective cross-modal integration across varying semantic levels by employing convolutional attention mechanisms combined with pixel-wise channel guidance. In parallel, BiCAM enhances inter-modal feature complementarity by modeling channel-level interactions through bidirectional attention pathways. Extensive experiments conducted on four public multispectral datasets, FLIR, LLVIP, M3FD, and VEDAI, demonstrate that the proposed method consistently outperforms existing state-of-the-art approaches across multiple performance metrics. Moreover, with an inference speed of 12.6 FPS on embedded platforms, the proposed model is suitable for real-time deployment.}, archive = {J_ESWA}, author = {Hanyun Li and Linsong Xiao and Lihua Cao and Di Wu and Yangfan Liu and Yi Li and Yunfeng Zhang and Haiyang Bao}, doi = {10.1016/j.eswa.2025.129677}, journal = {Expert Systems with Applications}, month = {3}, pages = {129677}, shortjournal = {Expert Syst. Appl.}, title = {CrossModalNet: A dual-modal object detection network based on cross-modal fusion and channel interaction}, volume = {298}, year = {2026}, }
• (2026). IPMMG: Information propagation with multi-granularity morphology-guided for nuclear segmentation and classification. ESWA, 298, 129676. (www)

  @article{ , abstract = {Nuclear segmentation and classification play a crucial role in pathological image analysis. However, it is frequently challenged by blurred nuclear boundaries and complex structures in digital pathology slides, due to factors such as staining techniques and imaging methods, posing a significant challenge for accurate segmentation and classification. To this end, we propose a novel and efficient approach for nuclear identification, termed Information Propagation with Multi-Granularity Morphology-Guided Network (IPMMG). Specifically, IPMMG progressively captures edge morphology information from different network layers while simultaneously incorporating structural morphology features at multiple granularities. By explicitly propagating features related to both the edge and the structure, our approach constrains semantic features to focus on contours of the region of interest in the nuclear segmentation task, thus mitigating the challenge of blurred morphology. Experiments on public datasets demonstrate that IPMMG achieves state-of-the-art (SOTA) performance in segmentation, as measured by Dice and IoU scores, while also attaining competitive results in classification with DQ, SQ, and PQ metrics. In particular, our proposal IPMMG excels in handling nuclei with blurred edges and complex structures.}, archive = {J_ESWA}, author = {Dawei Fan and Jun Li and Chengfei Cai and Lihui Lin and Riqing Chen and Yanping Chen and Lifang Wei}, doi = {10.1016/j.eswa.2025.129676}, journal = {Expert Systems with Applications}, month = {3}, pages = {129676}, shortjournal = {Expert Syst. Appl.}, title = {IPMMG: Information propagation with multi-granularity morphology-guided for nuclear segmentation and classification}, volume = {298}, year = {2026}, }
• (2026). MECA: Modular editing via customized expert networks and adaptors in large language models. ESWA, 298, 129675. (www)

  @article{ , abstract = {Updating language models with new information through targeted edits without resorting to expensive full model retraining remains a critical challenge, particularly when aiming to preserve pre-existing capabilities. In this work, we introduce M odular E diting via C ustomized expert networks and A daptors) (MECA), a unified framework that selectively integrates new knowledge into language models. MECA employs a module-level deferral router to evaluate whether incoming queries fall within the scope of existing edit requests. Queries are then dynamically routed to either customized editing experts or key-value adaptors. This modular strategy ensures that updates are localized, thereby mitigating risks of unintended alterations on unrelated outputs. We validate our approach on sequential editing tasks using Llama2-7B, Llama2-13B and Falcon 11B, benchmarked across two diverse datasets ZsRE and Hallucination. Experimental results show that MECA consistently outperforms several state-of-the-art knowledge editing techniques, achieving improved integration of new information while preserving the model’s original performance. Our analysis further demonstrates that the deferral routing mechanism for selecting modules effectively balances editing precision with overall model stability.}, archive = {J_ESWA}, author = {Roseline Nyange and Shanbao Qiao and Seung Hoon Na}, doi = {10.1016/j.eswa.2025.129675}, journal = {Expert Systems with Applications}, month = {3}, pages = {129675}, shortjournal = {Expert Syst. Appl.}, title = {MECA: Modular editing via customized expert networks and adaptors in large language models}, volume = {298}, year = {2026}, }
• (2026). An explainable hybrid bio-inspired feature selection framework using RSVP-evoked p300 EEG signals for identity authentication. ESWA, 298, 129674. (www)

  @article{ , abstract = {EEG-based personal identification confronts critical hurdles, including high dimensionality, noise, and real-time variability. While RSVP and P300 paradigms provide cognitive-response-driven security, feature extraction challenges prevent practical deployment. Although deep learning has addressed unstructured EEG data, pinpointing optimal RSVP and P300-specific features remains an unresolved issue. To overcome these limitations, we introduced a hybrid GWO-MSE-XAI framework integrating Grey Wolf Optimization (GWO), Multiscale Entropy (MSE), and SHAP-based Explainable AI (XAI) to select the most relevant features from RSVP-evoked P300 EEG signals. The framework prioritizes discriminative feature selection, improves class separability, and incorporates a hybrid cross-entropy loss function fused with Fisher’s score-based feature selection. Benchmark-driven optimization refines EEG-specific feature subsets, while evaluation using classifiers (Random Forest, LightGBM, CatBoost, XGBoost) demonstrates substantial dimensionality reduction, faster convergence, and superior performance (98.89% accuracy). Experimental results confirm robustness, scalability, and enhanced interpretability, positioning the framework as a viable solution for EEG-based identity authentication in real-world RSVP and P300 applications.}, archive = {J_ESWA}, author = {S Abinayaa and S.S. Sridhar}, doi = {10.1016/j.eswa.2025.129674}, journal = {Expert Systems with Applications}, month = {3}, pages = {129674}, shortjournal = {Expert Syst. Appl.}, title = {An explainable hybrid bio-inspired feature selection framework using RSVP-evoked p300 EEG signals for identity authentication}, volume = {298}, year = {2026}, }
• (2026). Interlink reconfiguration against cascading failures on cyber-physical power systems based on an improved memetic algorithm. ESWA, 298, 129673. (www)

  @article{ , abstract = {Cyber-physical power systems (CPPSs) are the deep integration of advanced information and other technologies applied to the grid to achieve fundamental changes in the power industry. Thus, it is very significant to enhance the robustness of the power communication system in order to ensure security. For instance, when an interdependent CPPSs is under attack, the failure can diffuse along interconnect topology to the whole system, even causing a system crash. Recall that most of the existing models are one-to-one coupling structures. Drawing close to reality, we develop a modified memetic algorithm to reconstruct CPPSs with multiple-to-multiple interlinks, called MA-Multiple, which is dedicated to improving the robustness of CPPSs. To improve the accuracy of the optimal solution of the MA-Multiple, we devise a crossover operator (CO) based on the null model to increase population diversity. Further improving the suitability of algorithms on CPPSs, we propose a new Kirchhoff centrality (KIC) based on the approximation of the inverse matrix to measure network connectivity and design a local search operator (LSO). In the experiment, we comprehensively compare the MA-Multiple with four closely relevant methods in different scenarios. The results imply that MA-Multiple performs better in enhancing network robustness and resisting attacks.}, archive = {J_ESWA}, author = {Wei Lin and Li Xu and Yuexin Zhang and Jie Li}, doi = {10.1016/j.eswa.2025.129673}, journal = {Expert Systems with Applications}, month = {3}, pages = {129673}, shortjournal = {Expert Syst. Appl.}, title = {Interlink reconfiguration against cascading failures on cyber-physical power systems based on an improved memetic algorithm}, volume = {298}, year = {2026}, }
• (2026). Multi-objective portfolio optimization for stock return prediction using machine learning. ESWA, 298, 129672. (www)

  @article{ , abstract = {This paper presents a novel approach that integrates stock return prediction with the mean–variance (MV) model to enhance the performance of the original model. Firstly, stock returns are predicted using machine learning algorithms, including Robust Linear Regression (OLS-H), Random Forest (RF), and Long Short-Term Memory Networks (LSTM), to select a pre-screened stock pool composed of stocks with high predicted returns. Secondly, a linear weighting method combines the predictions above with the MV model, constructing the Mean-Variance-Forecast Error (MVF) model and determining the investment proportions for the pre-selected stocks. Finally, empirical research is conducted using the components of the CSI 300 Index as sample data. The results indicate that the RF + MVF model outperforms other models and the CSI 300 Index in return and risk metrics. At the same time, a sensitivity analysis of relevant parameters further confirms that considering return uncertainty is beneficial for improving the out-of-sample performance of the MV model.}, archive = {J_ESWA}, author = {Meiyu Huang and Shili Dang and Miraj Ahmed Bhuiyan}, doi = {10.1016/j.eswa.2025.129672}, journal = {Expert Systems with Applications}, month = {3}, pages = {129672}, shortjournal = {Expert Syst. Appl.}, title = {Multi-objective portfolio optimization for stock return prediction using machine learning}, volume = {298}, year = {2026}, }
• (2026). EKT-ML: An efficient knowledge tracing model with multi-task learning. ESWA, 298, 129671. (www)

  @article{ , abstract = {Knowledge Tracing (KT) aims to trace a student’s mastery of knowledge, known as knowledge states, and has become a popular research area, with Self-Attention (SA)-based KT models achieving the state-of-the-art performance. However, existing SA-based KT models seem to still have issues that need further investigation. Firstly, there commonly exists incorrect question-knowledge concept (Q-KC) mapping, yet most models fail to address this issue. Secondly, existing SA-based KT models suffer from high time complexity due to their extensive use of the SA mechanism. Finally, from real-world datasets, we observe that there exists a repeated attempts pattern which is often overlooked by existing KT models. Motivated by the above observations, we propose a novel Efficient Knowledge Tracing Model with Multi-task Learning (EKT-ML), an SA-based model with three crucial features. Firstly, we formulate the KT as a Multi-task Learning, with Q-task and KC-task as two tasks; by training them simultaneously and treating Q-KC mapping as shared information, the proposed EKT-ML tends to mitigate the impact of incorrect Q-KC mapping. Moreover, we propose an SVD-MLP component to replace the initial SA layers commonly used in existing SA-based KT models, thereby reducing the time complexity of EKT-ML. Finally, experimental results show that EKT-ML improves performance by up to 8.84 % across four metrics on three widely used datasets. Furthermore, it demonstrates that the EKT-ML has reduced time complexity compared with the benchmark baseline.}, archive = {J_ESWA}, author = {Wei Liu and Bo Yang and Haotian Su and Yaowei Wang and Qing Li}, doi = {10.1016/j.eswa.2025.129671}, journal = {Expert Systems with Applications}, month = {3}, pages = {129671}, shortjournal = {Expert Syst. Appl.}, title = {EKT-ML: An efficient knowledge tracing model with multi-task learning}, volume = {298}, year = {2026}, }
• (2026). Attention dilated deep learning network-based distributed data mining with energy efficient heuristic-aided routing model in WSN. ESWA, 298, 129670. (www)

  @article{ , abstract = {Wireless Sensor Networks (WSNs) are comprised of autonomous nodes, where the physical devices and other equipment are embedded for monitoring the environment. Yet, it consumes larger energy consumption while it fails to provide the optimal routing path. The data aggregation in WSN is accomplished by several classification approaches, but the delay and utilization of the resource are high. So, it is necessary to solve the challenges by implementing the developed model for the energy efficient routing in WSN. A distributed data mining scheme is developed based on a deep learning approach to provide greater energy efficiency and optimal load balancing in WSN. The distributed data mining is performed to distribute the appropriate data to the sensor nodes. This data distribution highly reduces the overhead at the fusion center. The data are categorized via Fused Deep Structural Network (FDSNet), where the Attention-based Dilated Deep Temporal Context Networks (DTCN) are fused with a Deep Shallow Network. The necessary data are distributed to the sensor nodes. The optimal routing is carried out based on optimal path selection using Stability Bound-based Energy Valley Optimizer (SBEVO). The optimal routing is done via the multi-objective functions such as “energy consumption, PDR, delay, and shortest path”. The energy-efficient data transmission is accomplished with the help of developed distributed data mining with a routing scheme. The developed energy-efficient optimal routing in WSN is compared to conventional routing approaches with several performance metrics to show energy efficiency. While comparing with existing methods, the developed model attains the value of 0.95% with regards of accuracy, precision, and F1-score. These findings of the developed model show accurate performance with an efficient routing mechanism in WSN.}, archive = {J_ESWA}, author = {Kiran Goud Palakuri and Manjeet Singh}, doi = {10.1016/j.eswa.2025.129670}, journal = {Expert Systems with Applications}, month = {3}, pages = {129670}, shortjournal = {Expert Syst. Appl.}, title = {Attention dilated deep learning network-based distributed data mining with energy efficient heuristic-aided routing model in WSN}, volume = {298}, year = {2026}, }
• (2026). Curriculum learning for a hybrid approach for aspect-based sentiment analysis. ESWA, 298, 129669. (www)

  @article{ , abstract = {In the past years, the amount of unstructured online review data has grown exponentially. Many people express their opinions about different aspects of goods and services on the Web. Aspect-Based Sentiment Analysis (ABSA) automatically extracts the sentiments with respect to aspects given in a sentence. We improve the training procedure of the state-of-the-art Hybrid Approach for Aspect-Based Sentiment Analysis with deep contextual word embeddings and hierarchical attention (HAABSA++). In this method, a domain sentiment ontology is used as a main classifier, and if it is not conclusive, a neural network is employed as a back-up. We extend the training of the neural network by incrementally adding more difficult instances, also known as curriculum learning. Restaurant reviews obtained from the SemEval-2015 and SemEval-2016 datasets are used to evaluate the effect of implementing curriculum learning. Using baby steps curriculum learning and a specific curriculum strategy, the accuracy of HAABSA++ is improved from 86.3 % to 87.5 %.}, archive = {J_ESWA}, author = {Nana Lange and Flavius Frasincar and Maria Mihaela Truşcǎ}, doi = {10.1016/j.eswa.2025.129669}, journal = {Expert Systems with Applications}, month = {3}, pages = {129669}, shortjournal = {Expert Syst. Appl.}, title = {Curriculum learning for a hybrid approach for aspect-based sentiment analysis}, volume = {298}, year = {2026}, }
• (2026). A new edge detection method for noisy image based on discrete fractional wavelet transform and improved canny algorithm. ESWA, 298, 129668. (www)

  @article{ , abstract = {Edge detection is a key technique for extracting object structures and region boundaries in images, serving as an important foundation for visual tasks such as image segmentation and object recognition. However, during real-world image acquisition, various types of noise are inevitably introduced into the images. Traditional edge detection methods suffer significant performance degradation in noisy environments, often resulting in false edges or missing true edges. To address this issue, this paper proposes a novel edge detection method for noisy images. The method begins by adaptively selecting an optimal fractional order p , based on the distribution characteristics of the image’s subband modulus coefficients. This order is then used to perform a p -order discrete fractional wavelet transform (DFRWT) on the noisy image. Then, within the DFRWT domain, an enhanced Canny algorithm is applied to detect edges. This algorithm improves upon the standard method by replacing the traditional gradient operator with a more robust fractional-order Sobel operator to compute the gradient magnitude. This detection process is performed on both the low- and high-frequency subbands to capture features at different scales. Finally, the edge images from the low- and high-frequency components are reconstructed to obtain the final edge detection result. Experimental results demonstrate that, compared to four representative edge detection algorithms, the proposed method exhibits superior noise robustness and edge preservation capability in noisy environments.}, archive = {J_ESWA}, author = {Xiaozhong Yang and Chunmeng Li}, doi = {10.1016/j.eswa.2025.129668}, journal = {Expert Systems with Applications}, month = {3}, pages = {129668}, shortjournal = {Expert Syst. Appl.}, title = {A new edge detection method for noisy image based on discrete fractional wavelet transform and improved canny algorithm}, volume = {298}, year = {2026}, }
• (2026). Physics-constrained EBSD image inpainting via adversarial graph learning: Bridging crystallographic rules and multimodal deep learning. ESWA, 298, 129667. (www)

  @article{ , abstract = {Electron Backscatter Diffraction (EBSD) is a crucial characterisation method in materials engineering. The reliability of EBSD data is essential in the aerospace, nuclear, and automotive industries, as material performance greatly affects operational safety. While industrial practice makes perfect EBSD data difficult, with sample preparation errors, beam drift, and instrumental noise corrupting up to one-third of datasets. Automated crystallographic fidelity restoration solutions are needed because corrupted data force engineers to abandon valuable experiments or manually restore datasets at risk of errors. Current image inpainting techniques fail to maintain crystallographic constraints, resulting in restorations that violate the basic rules for crystalline materials. A novel physics-constrained framework is proposed to fill this gap. It integrates adversarial learning with graph neural networks (GNNs) for crystallographically consistent EBSD image inpainting. The proposed GTRG method consists of three elements: i ) a generative adversarial network (GAN) for reconstructing grain boundaries; i i ) a crystallography-guided graph transformer (T) that converts pixel data into orientation-boundary graphs; and i i i ) a regression graph convolutional network (RGCN) that links grain, orientation and boundaries to predict missing crystal orientations. The framework mandates a single orientation per grain and preserves grain boundary structure through structured graph representations. A strategy for creating automated EBSD datasets that incorporates realistic corruption patterns supports effective model training and evaluation. Experimental validation shows better performance than current methods, with a 3.5 % improvement in SSIM (0.950 vs. 0.918) and a 63.0 % reduction in FID (16.55 vs. 44.70) compared to AOT-GAN. The study on aerospace niobium alloys further validates practical utility, showing statistically consistent grain orientation and size distributions (Kolmogorov-Smirnov D = 0.02 , p > 0.98 ). This work introduces two key advancements: 1) the first integration of graph neural networks with adversarial learning for topology-aware image inpainting, and 2) a physics-informed framework bridging computer vision and materials science, enabling effective restoration of corrupted EBSD data for subsequent engineering applications.}, archive = {J_ESWA}, author = {Baiyang Zheng and Jiongran Wen and Yat-Sze Choy and Chengwei Fei}, doi = {10.1016/j.eswa.2025.129667}, journal = {Expert Systems with Applications}, month = {3}, pages = {129667}, shortjournal = {Expert Syst. Appl.}, title = {Physics-constrained EBSD image inpainting via adversarial graph learning: Bridging crystallographic rules and multimodal deep learning}, volume = {298}, year = {2026}, }
• (2026). Three-way large-scale group decision-making under incomplete multi-scale information systems: A perspective of quantum social networks. ESWA, 298, 129666. (www)

  @article{ , abstract = {The gathering and sharing of information lay the groundwork for decision-making, while large-scale group decision-making (LSGDM) strategies address biases, promoting a more comprehensive evaluation of alternatives. Regarding information representation, incomplete multi-scale information systems (MSISs), as an application of granular computing, combine inputs from decision-makers (DMs) and tackle data gaps through multi-level analysis to foster LSGDM. Furthermore, given the interference effect among DMs, quantum social networks (SNs) and three-way decisions (TWD) are vital for effective decision-making. Quantum SNs provide a framework for modeling complex trust relationships among DMs, while TWD offers a structured approach to manage uncertainty. Therefore, this paper seeks to investigate quantum SN-guided three-way LSGDM under incomplete MSISs. First, MSISs are designed to gather information across spatial dimensions. Second, trust propagation paths within SNs are aggregated using quantum theory. Following community clustering through the Leiden algorithm, each community is further divided into core and fringe regions by three-way clustering (TWC), where core alternatives reflect the central members and fringe alternatives represent uncertain members. Third, to achieve intra-group consensus, the weights of DMs in fringe regions and those with low consensus levels are adjusted, while for inter-group consensus, the weight and decision information of community representatives with low consensus levels are modified. Fourth, alternatives are classified using the TWD method, which is grounded in the Dempster-Shafer theory and incorporates the enhanced belief Jensen-Sharma-Mittal ( E B J S M ) divergence. Finally, air quality datasets are used to validate the practicality of this method through sensitivity analysis, simulation analysis, comparative analysis, and statistical analysis.}, archive = {J_ESWA}, author = {Rui Li and Chao Zhang and Hamido Fujita and Wentao Li and Witold Pedrycz and Oscar Castillo}, doi = {10.1016/j.eswa.2025.129666}, journal = {Expert Systems with Applications}, month = {3}, pages = {129666}, shortjournal = {Expert Syst. Appl.}, title = {Three-way large-scale group decision-making under incomplete multi-scale information systems: A perspective of quantum social networks}, volume = {298}, year = {2026}, }
• (2026). GDCR: Geometry-enhanced directional consistency representation for point cloud analysis. ESWA, 298, 129665. (www)

  @article{ , abstract = {Point clouds provide discrete representations of 3D scenes. The relative positions and directions between points collectively describe the objects. Variations in sampling angles, distances, or noises can introduce perturbations, disrupting these spatial and directional relationships. These pose significant challenges for achieving robust feature representations. However, research on the robust representation of point clouds is limited. Although advanced models achieve impressive performance, they exhibit poor robustness to perturbations. To address this issue, we propose Geometry-enhanced Directional Consistency Representation (GDCR), a novel method designed to enhance robustness. In GDCR, we introduce Statistic-based Geometric Reasoning (SGR) to achieve precise spatial geometric estimation for discrete point sets, explicitly enriching spatial geometric information. Furthermore, GDCR vectorizes features embedded with SGR information and applies feature rotation and relative direction refinement in the expanded feature space for robust directional representation. GDCR improves the flexibility and directional expressiveness of point cloud features, significantly improving robustness against perturbations. Extensive experiments demonstrate that GDCR exhibits outstanding robustness while surpassing or matching the performance of state-of-the-art methods.}, archive = {J_ESWA}, author = {Ziming Wang and Boxiang Zhang and Ming Ma and Yue Wang and Taoli Du and Ying Wang and Wenhui Li}, doi = {10.1016/j.eswa.2025.129665}, journal = {Expert Systems with Applications}, month = {3}, pages = {129665}, shortjournal = {Expert Syst. Appl.}, title = {GDCR: Geometry-enhanced directional consistency representation for point cloud analysis}, volume = {298}, year = {2026}, }
• (2026). APMoE-net: Fourier amplitude-phase joint enhancement and MoE compensation for low-light image enhancement. ESWA, 298, 129664. (www)

  @article{ , abstract = {Low-Light Image Enhancement (LLIE) plays a crucial role in computer vision applications. Beyond spatial-based approaches, recent works have explored the Fourier domain. To better preserve structural details in extremely dark scenes, infrared modality has also been introduced as a robust prior for capturing scene geometry. However, existing methods suffer from limited enhancement performance due to the independent modeling of Fourier amplitude and phase, the limitations of cross-modal guidance, and the information loss in sequential feature extraction. To address these challenges, we propose APMoE-Net, a dual-stage Fourier network framework with amplitude-phase joint enhancement and spatial Mixture of Experts (MoE) compensation. Stage one performs coarse enhancement by leveraging infrared images to jointly optimize Fourier amplitude and phase, enabling mutual guidance learning between them. Subsequently, a Modality Refinement Module leverages edge information to refine infrared inputs, producing a refined modality map as a more accurate cross-modal prior for subsequent processing. The second stage employs a dual-branch design for texture refinement. Our key innovation lies in the MoE Compensation Module integrated within the Multi-scale Convolution Branch. This module employs a dynamic routing network to selectively activate specialized experts, enabling the recovery of fine-grained textures that are lost during sequential processing. Meanwhile, the Fourier Branch integrates the refined modality map to improve overall detail and contrast. Comprehensive experiments demonstrate that APMoE-Net surpasses state-of-the-art (SOTA) methods in both qualitative and quantitative evaluations. Notably, APMoE-Net achieves outstanding performance with a lightweight design, offering an efficient LLIE solution.}, archive = {J_ESWA}, author = {Mengen Cai and Tongshun Zhang and Pingping Liu and Qiuzhan Zhou}, doi = {10.1016/j.eswa.2025.129664}, journal = {Expert Systems with Applications}, month = {3}, pages = {129664}, shortjournal = {Expert Syst. Appl.}, title = {APMoE-net: Fourier amplitude-phase joint enhancement and MoE compensation for low-light image enhancement}, volume = {298}, year = {2026}, }
• (2026). Enhanced edge detection of harmful algal blooms using diffusion probability models and sobel-convolutional attention mechanisms. ESWA, 298, 129663. (www)

  @article{ , abstract = {Accurate detection and identification of harmful algal bloom (HAB) images are crucial for developing effective early warning systems for HABs. However, existing edge detection models, primarily designed for natural scenes, struggle with HAB-specific challenges such as blurred cell contours and interference from impurity bubbles. To address these issues, we propose a novel edge detection approach tailored for marine HABs, integrating a diffusion probability model with Sobel convolutional inter-layer attention mechanisms. Firstly, we develop an image enhancement algorithm specifically for HABs images, significantly improving real-time dynamic sampling data by enhancing contrast, edges, and texture features. Next, we introduce the SIAnet network, which utilizes inter-layer attention and convolutional operations to generate comprehensive global information. This network enhances feature correlation by aggregating shared features across multiple layers and modeling both long-range and short-range dependencies, effectively suppressing noise and background interference. This facilitates precise extraction of algae boundaries and morphological characteristics. Additionally, an improved Sobel operator is employed to generate supplementary edge features, accelerating the training process. Experimental results demonstrate that the proposed method achieves robust performance on the HABs dataset, with an Optimal Dataset Scale (ODS) of 0.645, an Optimal Image Scale (OIS) of 0.702, and an Average Precision (AP) of 0.813. Compared to existing methodologies, our approach demonstrates strong generalization on BSDS and BIPED datasets, significantly enhancing performance and mitigating typical CNN issues of edge thickening and fragmentation. It offers essential technical support for efficient HAB early warning system development.}, archive = {J_ESWA}, author = {Gengkun Wu and Yining Fan and Xin Tian and Chao Cui and Jiazheng Han}, doi = {10.1016/j.eswa.2025.129663}, journal = {Expert Systems with Applications}, month = {3}, pages = {129663}, shortjournal = {Expert Syst. Appl.}, title = {Enhanced edge detection of harmful algal blooms using diffusion probability models and sobel-convolutional attention mechanisms}, volume = {298}, year = {2026}, }
• (2026). Predictive modeling of biogeographical ancestry using a novel SNP panel and supervised learning approaches. ESWA, 298, 129662. (www)

  @article{ , abstract = {Inferring an individual’s BioGeographical Ancestry (BGA) through DNA analysis is a valuable tool in various fields such as forensic science, especially when traditional methods fail to identify suspects or victims. Advances in Next-Generation Sequencing (NGS) have revolutionized genomic data acquisition, enabling the development of comprehensive Single Nucleotide Polymorphism (SNP) panels for ancestry inference. This study assessed the effectiveness of a novel panel containing 3234 SNPs at both inter-continental and a more detailed BGA level, using various supervised Machine Learning (ML) models, including Categorical Naive Bayes, Penalized Multinomial Logistic Regression, Linear Support Vector Machines, Random Forest, and tree-based Gradient Boosting. A nested cross-validation approach was employed for model tuning and evaluation, with balanced accuracy as the main performance metric to address class imbalance. At the inter-continental level, all ML models demonstrated high balanced accuracy, confirming their reliability for BGA inference. However, performance declined at the more detailed continental level, likely due to a combination of factors including increased class imbalance, reduced sample sizes for certain populations, and the inherent complexity of distinguishing genetically and geographically proximate groups. Nonetheless, promising results were observed for South Asians, Northeast Asians, Europeans, and West Africans classes. In contrast, performance was notably lower for underrepresented classes such as Inner Asians. Misclassification patterns at both levels appeared to reflect known geographical and historical relationships, although further analysis revealed that these were often concentrated in underrepresented or genetically complex groups. These findings highlighted the potential of this SNP panel and ML approaches as valuable tools for forensic investigations.}, archive = {J_ESWA}, author = {Cosimo Grazzini and Giorgia Spera and Stefania Morelli and Daniele Castellana and Giulia Cosenza and Michela Baccini and Giulia Cereda and Elena Pilli}, doi = {10.1016/j.eswa.2025.129662}, journal = {Expert Systems with Applications}, month = {3}, pages = {129662}, shortjournal = {Expert Syst. Appl.}, title = {Predictive modeling of biogeographical ancestry using a novel SNP panel and supervised learning approaches}, volume = {298}, year = {2026}, }
• (2026). RL-CoSeg: A reinforcement learning-based collaborative localization and segmentation framework for medical image. ESWA, 298, 129661. (www)

  @article{ , abstract = {Segmenting small regions of interest (ROIs) from abdominal CT images presents significant challenges, particularly due to class imbalance and variations in the sizes of foreground objects. A commonly adopted solution is the two-stage segmentation. However, this approach has two key limitations: i) Difficulty in balancing localization accuracy and target preservation. To reduce information loss in the first stage, existing methods typically enlarge the predicted bounding boxes, which improves coverage but compromises localization precision. ii) Independent optimization of the two stages, which lacks a collaborative mechanism. This fragmented pipeline limits the flow of information between stages, thereby constraining performance improvements. To address these limitations, we propose a reinforcement learning-based collaborative localization and segmentation (RL-CoSeg) framework, which comprises three sub-networks: localization network (LN), segmentation network, and localization-segmentation collaboration network (LSCN). The LN integrates prior knowledge and incorporates a dynamic reward mechanism to enhance the accuracy and efficiency of target detection through reinforcement learning (RL) strategies. The LSCN further introduces segmentation predictions as a reward signal, which, together with the localization reward, jointly drives policy learning. In addition, a heuristic exploration strategy is employed to avoid local optima and improve training stability. This design strengthens the information interaction and collaborative performance between the two tasks. Experimental results demonstrate that the proposed method achieves superior collaborative performance in small-target medical image segmentation.}, archive = {J_ESWA}, author = {Feilong Xu and Feiyang Yang and Xiaoli Zhang and Zhaojun Liu}, doi = {10.1016/j.eswa.2025.129661}, journal = {Expert Systems with Applications}, month = {3}, pages = {129661}, shortjournal = {Expert Syst. Appl.}, title = {RL-CoSeg: A reinforcement learning-based collaborative localization and segmentation framework for medical image}, volume = {298}, year = {2026}, }
• (2026). SH-ETRs:Learning soft-hard rules with entity type constraints for document-level relation extraction. ESWA, 298, 129660. (www)

  @article{ , abstract = {Document-level relation extraction (DocRE) aims to extract relations between entity pairs across the entirety of a document. Current methods have begun to adopt logical rules to enhance the performance of DocRE models. However, the pipeline’s rule learning framework will suffer from the issue of error propagation, and the end-to-end method may lead to mistakes in rule reasoning. Additionly, they ignore entity type information when learning the rules. To address these issues, we propose a novel framework named Soft-Hard Rules with Entity Type Constraints (SH-ETRs) for improving the rules’ expressiveness and quality. Specifically, we first propose a Hard Entity Type Rules Module (H-ETRs) to learn entity type information and provide hard rule constraints. Then, we propose a Soft Entity Type Rule Reasoning Module (S-ETRs), which parameterizes the rule inference process and reduces error propagation during the process. Furthermore, by applying a rule consistency loss function to S-ETRs, we achieve the learning of soft rules under hard rule constraints, thereby aiming to prevent the learning of inaccurate rules during the training process. The experimental results demonstrate that our method outperforms existing rule learning frameworks, achieving state-of-the-art performance with an F1 score of 74.39 and an IgnF1 score of 67.43 across three public datasets and two baseline models.}, archive = {J_ESWA}, author = {Haisong Chen and Nisuo Du and Qing He and Yuji Wang}, doi = {10.1016/j.eswa.2025.129660}, journal = {Expert Systems with Applications}, month = {3}, pages = {129660}, shortjournal = {Expert Syst. Appl.}, title = {SH-ETRs:Learning soft-hard rules with entity type constraints for document-level relation extraction}, volume = {298}, year = {2026}, }
• (2026). MCAD-EUC: Multi-context adaptive decoding with entropy-based uncertainty calibration for knowledge conflict mitigation. ESWA, 298, 129659. (www)

  @article{ , abstract = {The knowledge sources of large language models (LLMs) encompass both parametric internal knowledge and external contextual information. However, conflicts between these two sources can significantly impair model performance. Existing methods typically assume a priori correctness of either the context or the parametric knowledge, lacking dynamic coordination mechanisms and being limited to single-context scenarios. To address this issue, this work proposes a lightweight and training-free decoding method, M ulti- C ontext A daptive D ecoding ( MCAD-EUC ), which dynamically measures the effectiveness of both knowledge through E ntropy based U ncertainty C alibration. It does not concern itself with whether the knowledge is false or true, the internal or the external, but balancing them according to their contributions to correctly answering the question. Particularly, MCAD-EUC is naturally multi-contextual. It can dynamically amplify the distribution of golden context while mitigating the influence of noisy context, thereby optimizing the final logits for predicting the next token during the decoding process. To comprehensively evaluate the model performance in multi-context scenarios, this work constructs MCQA, a multi-context question answering dataset that includes golden context, irrelevant context, and six categories of misleading context (crowd, logic, temporal, authority, emotional, numeric), simulating the diversity of noise in real-world settings. Extensive experiments on four LLMs and four MCQA datasets demonstrate that MCAD-EUC achieves an average accuracy improvement of 3.17 % over the best-performing baseline methods. Further sensitivity analysis confirms that the entropy-based adaptive weighting mechanism consistently outperforms all fixed-weight settings. Our dataset and code will be publicly available.}, archive = {J_ESWA}, author = {Yimin Ou and Yifan Wang and Ping Jian and Tianhe Zhang and Xing Pei}, doi = {10.1016/j.eswa.2025.129659}, journal = {Expert Systems with Applications}, month = {3}, pages = {129659}, shortjournal = {Expert Syst. Appl.}, title = {MCAD-EUC: Multi-context adaptive decoding with entropy-based uncertainty calibration for knowledge conflict mitigation}, volume = {298}, year = {2026}, }
• (2026). Interpretable knowledge tracing with dual-level knowledge states. ESWA, 298, 129658. (www)

  @article{ , abstract = {Knowledge Tracing (KT) is a critical technology for achieving personalized learning. It estimates learners’ knowledge states and predicts future performance using historical interaction data. Despite recent advances, two significant challenges remain. First, the accuracy of knowledge state modeling is limited by the insufficient fusion of multi-scale information across temporal and spatial dimensions. Second, a trade-off persists between improving predictive performance and enhancing interpretability. This paper proposes an interpretable knowledge tracing method based on dual-level knowledge states (DIKT) to address these challenges. From the temporal perspective, DIKT incorporates a forgetting-aware RoLinear Transformer and a semantic similarity-based review mechanism to model learners’ problem-level knowledge states. From the spatial perspective, it leverages a Knowledge Concept (KC) relational graph to propagate influence among related KCs and dynamically update learners’ concept-level knowledge states through three sequential learning phases: forgetting, aggregation, and updating. Student performance is predicted using a two-parameter Item Response Theory (IRT) model, which incorporates guess and slip parameters to account for response anomalies. We conduct extensive comparisons between DIKT and 20 state-of-the-art KT models on five widely used public datasets. Experimental results demonstrate that DIKT achieves superior performance while preserving interpretability, highlighting its practical potential for real-world educational applications. The code is available at https://github.com/ting214/DIKT .}, archive = {J_ESWA}, author = {Yanting Li and Tao Zhou and Tianyu Cai and Shenggen Ju}, doi = {10.1016/j.eswa.2025.129658}, journal = {Expert Systems with Applications}, month = {3}, pages = {129658}, shortjournal = {Expert Syst. Appl.}, title = {Interpretable knowledge tracing with dual-level knowledge states}, volume = {298}, year = {2026}, }
• (2026). RASpan: Improving toponym recognition through span representation model with retrieval augmentation. ESWA, 298, 129657. (www)

  @article{ , abstract = {Toponym recognition aims to identify place names from natural language texts, which is vital for various applications including geographic information retrieval, emergency response, and natural disaster analysis. Currently, mainstream studies mainly adopt deep learning models for toponym recognition. However, these approaches encounter significant limitations due to the inherent ambiguity, variation, and abbreviation of toponyms. To address these issues, we propose a novel Span Representation Model with R etrieval A ugmentation ( RASpan ) that leverages more accurate span representation and effective external geo-entity information to enhance the semantic representation of place names for improving the performance of toponym recognition. On the one hand, RASpan retrieves diverse geo-entities and concatenates geo-entity knowledge with an input sequence to construct a new prompt sequence. On the other hand, RASpan utilizes the prompt encoder based on the language model to encode this prompt sequence and employs a dedicated span representation module to obtain more accurate span representations. In addition, a new geo-entity prediction task is designed to learn the entire representation of each geo-entity while minimizing noise interference. Experiments on three publicly available datasets demonstrate that our model achieves new state-of-the-art results, highlighting the effectiveness of RASpan in toponym recognition by introducing prior geo-entity knowledge.}, archive = {J_ESWA}, author = {Hui Wu and Anran Yang and Zhinong Zhong and Ye Wu and Fei Yang and Luo Chen and Ning Jing}, doi = {10.1016/j.eswa.2025.129657}, journal = {Expert Systems with Applications}, month = {3}, pages = {129657}, shortjournal = {Expert Syst. Appl.}, title = {RASpan: Improving toponym recognition through span representation model with retrieval augmentation}, volume = {298}, year = {2026}, }
• (2026). An interpretable automated optimized machine learning for predicting concrete compressive strength. ESWA, 298, 129656. (www)

  @article{ , abstract = {This study presents a novel, interpretable, and automated machine learning (AutoML) framework for accurately predicting the compressive strength of environmentally sustainable concrete mixtures that incorporate supplementary cementitious materials (SCMs) by addressing the growing need for transparent and data driven tools in structural material design, particularly for concrete mixes enriched with various SCMs. A robust unified dataset of 1,317 samples was curated by integrating peer-reviewed experimental studies for this study. The proposed methodology incorporates feature contribution ranking through mutual information, model screening with AutoML to identify the most effective regression models, Bayesian optimization for fine-tuning model parameters, and interpretability techniques including SHAP and counterfactual analysis. The best performance metrics, in training include R 2 of 0.999, a mean absolute error 0.114, root mean squared error 0.7094, and mean absolute percentage error of 0.51 %, in testing phase R 2 of 0.944, a mean absolute error 3.479, root mean squared error 4.8173, and mean absolute percentage error of 9.86 %. The weakest performance, with a training R 2 of 0.982 and a mean absolute error of 1.911 MPa, root mean squared error 2.7990 and mean absolute percentage error 5.43 %, in testing phase R 2 of 0.786 and a mean absolute error of 5.754 MPa, root mean squared error 9.4336 and mean absolute percentage error 16.16 %. The interpretability analysis values provided insights into the most important features, such as curing time and cement are crucial in predicting the strength. Counterfactual analysis further validated the model by illustrating the significant impact of cement, age and water on concrete strength.}, archive = {J_ESWA}, author = {Aparna Kamarthi and Baskar Kaliyamoorthy}, doi = {10.1016/j.eswa.2025.129656}, journal = {Expert Systems with Applications}, month = {3}, pages = {129656}, shortjournal = {Expert Syst. Appl.}, title = {An interpretable automated optimized machine learning for predicting concrete compressive strength}, volume = {298}, year = {2026}, }
• (2026). The power of text similarity in identifying AI-LLM paraphrased documents: The case of BBC news articles and ChatGPT. ESWA, 298, 129655. (www)

  @article{ , abstract = {Generative AI paraphrased text can be used for copyright infringement and the AI paraphrased content can deprive substantial revenue from original content creators. Despite this recent surge of malicious use of generative AI, there are few academic publications that research this threat. In this article, we demonstrate the ability of pattern-based similarity detection for AI paraphrased news recognition. We propose an algorithmic scheme, which is not limited to detect whether an article is an AI paraphrase, but, more importantly, to identify that the source of infringement is the ChatGPT. The proposed method is tested with a benchmark dataset specifically created for this task that incorporates real articles from BBC, incorporating a total of 2,224 articles across five different news categories, as well as 2,224 paraphrased articles created with ChatGPT. Results show that our pattern similarity-based method, that makes no use of deep learning, can detect ChatGPT assisted paraphrased articles at percentages 96.23% for accuracy, 96.25 for precision, 96.21% for sensitivity, 96.25% for specificity and 96.23% for F1 statistic.}, archive = {J_ESWA}, author = {Konstantinos F. Xylogiannopoulos and Petros Xanthopoulos and Panagiotis Karampelas and Georgios A. Bakamitsos}, doi = {10.1016/j.eswa.2025.129655}, journal = {Expert Systems with Applications}, month = {3}, pages = {129655}, shortjournal = {Expert Syst. Appl.}, title = {The power of text similarity in identifying AI-LLM paraphrased documents: The case of BBC news articles and ChatGPT}, volume = {298}, year = {2026}, }
• (2026). Dynamic collaborative evolutionary network: A novel spatio-temporal feature extraction framework for EEG emotion recognition. ESWA, 298, 129654. (www)

  @article{ , abstract = {In recent years, significant progress has been made in emotion recognition research based on electroencephalogram (EEG) signals. However, existing methods face two key limitations: on one hand, the reliance on fixed physical connections or static topological relationships makes it difficult to effectively represent the dynamic non-Euclidean spatial characteristics between EEG electrodes; on the other hand, spatiotemporal feature extraction is often conducted independently. This lack of a collaborative mechanism for spatiotemporal features results in insufficient fine-grained emotional representation capability. To address these issues, a dynamic collaborative evolutionary network (DCENet) is proposed based on graph-aware enhancement and global convolutional Transformer for EEG emotion recognition. DCENet constructs the causal relationship between electrodes by constructing the graph-aware enhancement (GAE) module, obtains spatial features with the causal relationship, and enhances key features. At the same time, DCENet constructs the global convolutional Transformer (GCT) module, which utilizes the global modeling advantage of the Transformer and the local perception ability of the convolutional operation to capture the temporal features with different scales. In addition, DCENet adaptively fuses temporal and spatial features through the local differential fusion (LDF) module to achieve cross-domain feature alignment and feature alignment of emotion categories to collaboratively evolve emotion representation features with more fine-grained information. This paper conducts experiments on the SEED, SEED-IV, and MPED datasets to validate the effectiveness of DCENet. The experimental results show that the model achieves cross-subject average accuracies of 87.55 %, 73.04 %, and 27.72 % on SEED, SEED-IV, and MPED, respectively, outperforming the state-of-the-art methods. The source code is publicly available at: https://github.com/cvmdsp/DCENet .}, archive = {J_ESWA}, author = {Shuaiqi Liu and Zhihui Gu and Yuan Zhang and Yanling An and Shuhuan Zhao and Bing Li and Yudong Zhang}, doi = {10.1016/j.eswa.2025.129654}, journal = {Expert Systems with Applications}, month = {3}, pages = {129654}, shortjournal = {Expert Syst. Appl.}, title = {Dynamic collaborative evolutionary network: A novel spatio-temporal feature extraction framework for EEG emotion recognition}, volume = {298}, year = {2026}, }
• (2026). Trust in recommender systems: A survey. ESWA, 298, 129653. (www)

  @article{ , abstract = {Trust-based recommender systems incorporate interpersonal trust relationships into the recommendation process, operating on the principle that users are more likely to accept suggestions from people they trust. Empirical studies have shown that trust-aware approaches often deliver more accurate recommendations than their trust-unaware counterparts. In this comprehensive, up-to-date survey, we analyze a variety of trust-based recommendation methods, categorize different trust inference techniques, and examine how trust is integrated into recommendation algorithms. We then organize the investigated approaches according to a clear taxonomy, explore their underlying concepts, and highlight the key challenges and open issues that remain in the field.}, archive = {J_ESWA}, author = {Imane Akdim and Loubna Mekouar and Youssef Iraqi}, doi = {10.1016/j.eswa.2025.129653}, journal = {Expert Systems with Applications}, month = {3}, pages = {129653}, shortjournal = {Expert Syst. Appl.}, title = {Trust in recommender systems: A survey}, volume = {298}, year = {2026}, }
• (2026). Composite human activity recognition utilizing knowledge distillation and sensor fusion focusing on resource constrained microcontrollers. ESWA, 298, 129652. (www)

  @article{ , abstract = {This study presents a cost-effective, low-computation system for composite Human Activity Recognition (HAR) that leverages knowledge-distilled neural networks on a Microcontroller Unit (MCU) to minimize reliance on cloud processing. A key contribution of this work is the investigation of plantar pressure sensor data within a knowledge distillation framework, addressing a notable gap in the existing literature. The proposed solution centers around the ESP32-S3 DevKit C1, equipped with a dual-core 240 MHz Tensilica chip, 320 KiB of usable Static Random Access Memory (SRAM), and built-in Wi-Fi and Bluetooth. Significantly, both the teacher and the student models surpass existing state-of-the-art methods, achieving F1-scores of 99.33 %, 98.36 %, and 97.68 % respectively, in classifying a comprehensive set of 21 activities (15 composite and 6 simple). The distilled student models demonstrate remarkable efficiency, with execution times of 1.83 and 0.64 s, memory footprints of only 62 KB and 82 KB, and flash memory usage of approximately 209 KB and 127 KB, while maintaining low power consumption of 210 mW and 215 mW, respectively. Furthermore, we have developed an end-to-end prototype that integrates the ESP32-S3 with a WitMotion Inertial Measurement Unit (IMU) sensor. This system autonomously manages data acquisition, feature extraction, and inference in under 7 s with a total power consumption of approximately 295 mW.}, archive = {J_ESWA}, author = {Athar Noor Mohammad Rafee and John Clear and Jannatun Noor}, doi = {10.1016/j.eswa.2025.129652}, journal = {Expert Systems with Applications}, month = {3}, pages = {129652}, shortjournal = {Expert Syst. Appl.}, title = {Composite human activity recognition utilizing knowledge distillation and sensor fusion focusing on resource constrained microcontrollers}, volume = {298}, year = {2026}, }
• (2026). Med-D3CG: Wavelet-based diffusion in the difference domain for cross-modality medical image generation. ESWA, 298, 129651. (www)

  @article{ , abstract = {The synthesis of cross-modal medical images plays a vital role in bridging diagnostic gaps between imaging modalities such as CT, MRI, and PET. This integration enables a more comprehensive evaluation of a patient’s condition, improving diagnostic accuracy and aiding clinical decision-making. However, the performance of conditional denoising diffusion probabilistic models is often hindered by pronounced structural and intensity discrepancies between modalities, as well as the inherently slow nature of the diffusion process. To address these challenges, this paper proposes Wavelet-Based Diffusion in the Difference Domain for Cross-Modality Medical Image Generation (Med-D3CG), a novel framework that transforms the synthesis process by emphasizing the difference domain. Instead of directly generating target images like conventional methods, Med-D3CG models the residual information between conditioned and target images. This strategy allows the framework to accurately capture essential structural and intensity variations between modalities, leading to more precise and realistic image synthesis. Additionally, Med-D3CG integrates the Discrete Wavelet Transform (DWT) to improve efficiency, accelerating the diffusion process while maintaining high image fidelity. On SynthRAD2023 and HMIFD datasets, state-of-the-art performance is achieved on pelvis and HMIFD using Med-D3CG , with the best Learned Perceptual Image Patch Similarity (LPIPS) and competitive FID observed on brain. Code and pretrained models are provided at https://github.com/ZgzTTTer/Med-D3CG .}, archive = {J_ESWA}, author = {Guangzhen Zhu and Midi Wan and Wenming Cao and Zhiwen Yu and Jin Hu and Bing Li and Xiaotao Fan}, doi = {10.1016/j.eswa.2025.129651}, journal = {Expert Systems with Applications}, month = {3}, pages = {129651}, shortjournal = {Expert Syst. Appl.}, title = {Med-D3CG: Wavelet-based diffusion in the difference domain for cross-modality medical image generation}, volume = {298}, year = {2026}, }
• (2026). Two-stage feature selection utilizing three-way adaptive neighborhood characteristic measure and optimal combination search. ESWA, 298, 129650. (www)

  @article{ , abstract = {The neighborhood rough set model(NRSM) has shown its powerful capacity in feature selection. However, a challenge still exists in describing the diversity between the attributes deeply while avoiding the impact caused by the neighborhood parameters. To address this problem, in this paper, we propose a two-stage feature selection by utilizing a three-way adaptive characteristic measure and an optimal combination search. First, we define a fitness function for applying the Stochastic Fractal Search(SFS) to design an novel adaptive neighborhood rough set model(ANRSM). To better utilize the construction characteristic of the adaptive model and reduce the computational cost, the lower and upper approximations of the SFS-based ANRSM are redefined through the fitness function. Second, based on the two approximations, we analyze the fitness function thresholds that can partition the universe into three regions and design the three-way adaptive neighborhood characteristic regions, which provide a more direct classification of samples without the inclusion and union operations. Third, we design different measures for the samples in diverse regions based on their corresponding characteristic. Afterward, a three-way adaptive characteristic measure is designed by integrating the three measures to evaluate the uncertainty of attributes. Then, we apply the measure to design a feature selection approach with greedy search. Considering that the greedy strategy may output redundant attributes, we introduce an optimal combination search approach through a novel wrapper technology to explore the potential optimal feature combinations. Compared with nine algorithms on fourteen public datasets, the experimental results show the effectiveness of our algorithm.}, archive = {J_ESWA}, author = {Bowen Lin and Duoqian Miao and Caihui Liu and Hongyun Zhang and Ruizhi Wang and Witold Pedrycz}, doi = {10.1016/j.eswa.2025.129650}, journal = {Expert Systems with Applications}, month = {3}, pages = {129650}, shortjournal = {Expert Syst. Appl.}, title = {Two-stage feature selection utilizing three-way adaptive neighborhood characteristic measure and optimal combination search}, volume = {298}, year = {2026}, }
• (2026). GE-adapter: A general and efficient adapter for enhanced video editing with pretrained text-to-image diffusion models. ESWA, 298, 129649. (www)

  @article{ , abstract = {Recent advancements in text-to-image (T2I) generation using diffusion models have enabled cost-effective video-editing applications by leveraging pre-trained models, eliminating the need for resource-intensive training. However, the frame-independence of T2I generation often results in poor temporal consistency. Existing methods address this issue through temporal layer fine-tuning or inference-based temporal propagation, but these approaches suffer from high training costs or limited temporal coherence. To address these challenges, we propose a General and Efficient Adapter (GE-Adapter) that integrates temporal-spatial and semantic consistency with Baliteral DDIM inversion. This framework introduces three key components: (1) Frame-based Temporal Consistency Blocks (FTC Blocks) to capture frame-specific features and enforce smooth inter-frame transitions via temporally-aware loss functions; (2) Channel-dependent Spatial Consistency Blocks (SCD Blocks) employing bilateral filters to enhance spatial coherence by reducing noise and artifacts; and (3) Token-based Semantic Consistency Module (TSC Module) to maintain semantic alignment using shared prompt tokens and frame-specific tokens. Our method significantly improves perceptual quality, text-image alignment, and temporal coherence, as demonstrated on the MSR-VTT dataset. Additionally, it achieves enhanced fidelity and frame-to-frame coherence, offering a practical solution for T2V editing. The project page is https://github.com/codepassionor/T2I_Adapter .}, archive = {J_ESWA}, author = {Yangfan He and Sida Li and Kun Li and Jianhui Wang and Binxu Li and Tianyu Shi and Yi Xin and Keqin Li and Jun Yin and Miao Zhang and Xueqian Wang}, doi = {10.1016/j.eswa.2025.129649}, journal = {Expert Systems with Applications}, month = {3}, pages = {129649}, shortjournal = {Expert Syst. Appl.}, title = {GE-adapter: A general and efficient adapter for enhanced video editing with pretrained text-to-image diffusion models}, volume = {298}, year = {2026}, }
• (2026). New semi-supervised fuzzy C-means clustering with asymmetric deviation constraints and fast algorithm. ESWA, 298, 129648. (www)

  @article{ , abstract = {Semi-supervised clustering leverages prior information to improve algorithm performance and is widely valued by researchers. This paper analyzes the traditional semi-supervised fuzzy C-means (SFCM) objective function, noting that as a labeled sample’s membership degree aligns with its prior information, the impact of this information on the deviation constraint weakens. This reduces its supervisory effect on optimizing the membership partition matrix, especially with a large regularization factor. To overcome this, we propose a novel semi-supervised fuzzy C-means method based on an asymmetric deviation constraint and develop a two-level alternating iterative optimization algorithm, supported by theoretical convergence analysis using Zangwill’s theorem and the bordered Hessian matrix. To address the slow convergence and high computational cost typical of semi-supervised fuzzy clustering, we further enhance the algorithm with affinity filtering and a membership scaling scheme for improved efficiency. Experimental results demonstrate that our methods significantly outperform existing state-of-the-art techniques, advancing semi-supervised fuzzy C-means clustering.}, archive = {J_ESWA}, author = {Chengmao Wu and Jun Hou}, doi = {10.1016/j.eswa.2025.129648}, journal = {Expert Systems with Applications}, month = {3}, pages = {129648}, shortjournal = {Expert Syst. Appl.}, title = {New semi-supervised fuzzy C-means clustering with asymmetric deviation constraints and fast algorithm}, volume = {298}, year = {2026}, }
• (2026). BayesAHDD: A new bayesian rule-based adaptive hypersphere data description for few-shot one-class classification. ESWA, 298, 129647. (www)

  @article{ , abstract = {Few-shot one-class classification (FS-OCC) is a challenging classification problem that involves learning from a very limited number of training samples, all from a single class. Recently, several data description methods have been proposed to address the FS-OCC problem. Unlike conventional one-class classification problems, the few-shot setting requires the model to generalize to novel tasks with previously unseen positive classes. Most existing methods learn decision boundaries in the feature space without explicitly modeling the underlying data distributions, which limits the generalization ability of the learned representations. To address this issue, we propose Bayesian Rule-based Adaptive Hypersphere Data Description (BayesAHDD), a probabilistic framework that represents data with multivariate Gaussian distributions and performs classification according to the Bayes decision rule. Based on the assumption that negative samples are more dispersed in the feature space, BayesAHDD models the negative class by scaling the positive class variance vector element-wise using a learnable vector. To address the challenges of exploding gradients and numerical overflow, we impose a lower bound on the positive class variance vector and introduce a trainable parameter that integrates the class prior probability ratio with the normalization constants of the Gaussian class-conditional densities. Experimental results on both benchmark and domain-specific datasets show that BayesAHDD consistently outperforms existing baselines and state-of-the-art FS-OCC methods. Moreover, quantitative analysis demonstrates that the learned feature representations exhibit superior discriminative ability compared to those produced by previous approaches.}, archive = {J_ESWA}, author = {Yuchen Ren and Xiabi Liu and Yan Pei and Yunlong Li and Yongxia Wei}, doi = {10.1016/j.eswa.2025.129647}, journal = {Expert Systems with Applications}, month = {3}, pages = {129647}, shortjournal = {Expert Syst. Appl.}, title = {BayesAHDD: A new bayesian rule-based adaptive hypersphere data description for few-shot one-class classification}, volume = {298}, year = {2026}, }
• (2026). A network selection algorithm for space-air-ground integrated network based on location prediction model and multi-attribute decision making. ESWA, 298, 129646. (www)

  @article{ , abstract = {As an indispensable component of 5G and even the future 6G networks, the Space-Air-Ground Integrated Network (SAGIN) is envisioned to provide ubiquitous network connectivity and services by integrating satellite, aerial, and terrestrial networks. However, due to the frequent network selection of in-vehicle terminals, the user’s Quality of Service (QoS) can significantly deteriorate. To address this issue, a network selection algorithm based on terminal location prediction has been proposed. Firstly, we enhanced the Particle Swarm Optimization (PSO) algorithm to optimize the hyper-parameters of the Long Short-Term Memory (LSTM) network, thereby improving the accuracy of terminal location prediction. After constructing the network sets of the current terminal position and the predicted position, respectively, we designed a network selection judgment mechanism with a dynamically adjustable switching threshold based on Fuzzy Logic and K-Means theory. Finally, through the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) algorithm, we have achieved robust network selection in fast-moving scenarios. The simulation results show that the proposed algorithm can adaptively adjust the switching threshold and provide precise positions. Compared to existing algorithms, it can significantly reduce the number of candidate networks and the number of selections, thereby reducing the computational load and increasing the throughput of users.}, archive = {J_ESWA}, author = {Jianli Xie and Weicheng Pan and Lei Wu and Zishan Wu}, doi = {10.1016/j.eswa.2025.129646}, journal = {Expert Systems with Applications}, month = {3}, pages = {129646}, shortjournal = {Expert Syst. Appl.}, title = {A network selection algorithm for space-air-ground integrated network based on location prediction model and multi-attribute decision making}, volume = {298}, year = {2026}, }
• (2026). Anomaly detection based on graph neural networks incorporating with domain knowledge for industrial cyber-physical systems. ESWA, 298, 129645. (www)

  @article{ , abstract = {Effective anomaly detection heavily relies on accurately modeling the normal behavior of the industrial cyber-physical systems (ICPSs). Current popular data-driven black-box methods’ performance depends on the quantity and quality of data from the ICPS, rather than integrating with the intrinsic characteristics of the system, such as mass conservation and structural dependencies of industrial processes. The data used to train these models often fails to cover all operating conditions of ICPSs, resulting in a distributional mismatch between training and testing data. This limitation significantly reduces the generalization capability of trained data-driven models for detecting anomalies under unseen and unknown operational conditions. Meanwhile, constructing well-generalized behavior models using white-box mechanism models (MM)–which represent the internal behavior of controllers and physical processes using first-principles equations or physical laws, such as conservation principles and kinetic dynamics–is not always feasible in real-world industrial applications. To address this issue, this paper presents a novel anomaly detection approach employing a domain knowledge-embedded hybrid graph neural network (HGNN) that integrates control, physical, and structural characteristics of ICPSs into a data-driven modeling framework. It establishes a domain knowledge-based MM to predict the behavior of controllers and physical processes, and utilizes a HGNN model with embedded state topology and spatial distribution knowledge to compensate for the predictive error of MM, forming a hybrid model called mechanism-embedded HGNN (MEHGNN). This model can detect anomalies in unknown operational conditions by analyzing the predictive error of MEHGNN. In the experiments, MEHGNN raises the detection accuracy of GNNs from 36.6 %–82.4 % to 79.4 %–96.3 % under distribution shift scenarios, achieving the best detection performance among all compared methods.}, archive = {J_ESWA}, author = {Xin Du and Chunjie Zhou and Yu-Chu Tian and Bo Xu}, doi = {10.1016/j.eswa.2025.129645}, journal = {Expert Systems with Applications}, month = {3}, pages = {129645}, shortjournal = {Expert Syst. Appl.}, title = {Anomaly detection based on graph neural networks incorporating with domain knowledge for industrial cyber-physical systems}, volume = {298}, year = {2026}, }
• (2026). Predictive modeling and multi-objective optimization of screw whirling milling based on ISSA-BP embedded NSGA-III algorithm. ESWA, 298, 129644. (www)

  @article{ , abstract = {In screw whirling milling, the relationship between machining quality and processing parameters exhibits highly nonlinear characteristics. The traditional multiple regression models may not be able to capture this complex relationship accurately. Therefore, it is necessary to consider more flexible and applicable algorithms to establish their connections and optimize processing parameters. It can improve the accuracy and reliability of products, and provide more scientific method guidance for screw whirling milling processing. The originality of this article lies in proposing an adaptive dynamic optimization hybrid model. This model combines improved sparrow search algorithm optimized backpropagation (ISSA-BP) and non-dominated sorting genetic algorithm (NSGA-III). It can effectively adapt to dynamic data and find the optimal balance point among multiple objectives to better predict and optimize responses (cutting force, vibration, roughness, and residual compressive stress) in screw whirling milling. Firstly, a suitable network structure is identified by comparing the effects of five improvement strategies, population size, and the ratio of producers to scouters on the sparrow search algorithm. Then, an ISSA-BP prediction model is developed for four responses based on this structure. On this basis, the superiority of the established ISSA-BP model is verified by comparing prediction performance of five algorithms, and the relative prediction errors are all within 2%. The R 2 values of the models are all above 0.99, and they also perform well in indicators such as MAE (Mean Absolute Error), MSE (Mean Squared Error), MAPE (Mean Absolute Percentage Error), and RMSE (Root Mean Squared Error). Then, ISSA-BP model is encapsulated and embedded into the optimization algorithm as the fitness function of NSGA-III. Finally, with the processing parameters of whirling milling as constraints, the NSGA-III algorithm is used to solve the proposed model and obtain the Pareto optimal solution set. Choosing appropriate processing parameters according to different needs in actual machining can help improve the quality and efficiency of screw machining.}, archive = {J_ESWA}, author = {Chao Liu and Hao Ding and Juanjuan Zheng and Yan He and Shaofu Huang and Junbo Tuo and Zuqing Luo and Gang Shen}, doi = {10.1016/j.eswa.2025.129644}, journal = {Expert Systems with Applications}, month = {3}, pages = {129644}, shortjournal = {Expert Syst. Appl.}, title = {Predictive modeling and multi-objective optimization of screw whirling milling based on ISSA-BP embedded NSGA-III algorithm}, volume = {298}, year = {2026}, }
• (2026). A survey of large language models for data challenges in graphs. ESWA, 298, 129643. (www)

  @article{ , abstract = {Graphs are a widely used paradigm for representing non-Euclidean data, with applications ranging from social network analysis to biomolecular prediction. While graph learning has achieved remarkable progress, real-world graph data presents a number of challenges that significantly hinder the learning process. In this survey, we focus on four fundamental data-centric challenges: (1) Incompleteness , real-world graphs have missing nodes, edges, or attributes; (2) Imbalance , the distribution of the labels of nodes or edges and their structures for real-world graphs are highly skewed; (3) Cross-domain Heterogeneity , graphs from different domains exhibit incompatible feature spaces or structural patterns; and (4) Dynamic Instability , graphs evolve over time in unpredictable ways. Recently, Large Language Models (LLMs) offer the potential to tackle these challenges by leveraging rich semantic reasoning and external knowledge. This survey focuses on how LLMs can address four fundamental data-centric challenges in graph-structured data, thereby improving the effectiveness of graph learning. For each challenge, we review both traditional solutions and modern LLM-driven approaches, highlighting how LLMs contribute unique advantages. Finally, we discuss open research questions and promising future directions in this emerging interdisciplinary field. To support further exploration, we have curated a repository of recent advances on graph learning challenges: https://github.com/limengran98/Awesome-Literature-Graph-Learning-Challenges .}, archive = {J_ESWA}, author = {Mengran Li and Pengyu Zhang and Wenbin Xing and Yijia Zheng and Klim Zaporojets and Junzhou Chen and Ronghui Zhang and Yong Zhang and Siyuan Gong and Jia Hu and Xiaolei Ma and Zhiyuan Liu and Paul Groth and Marcel Worring}, doi = {10.1016/j.eswa.2025.129643}, journal = {Expert Systems with Applications}, month = {3}, pages = {129643}, shortjournal = {Expert Syst. Appl.}, title = {A survey of large language models for data challenges in graphs}, volume = {298}, year = {2026}, }
• (2026). Region-aware prediction strategy based on shared points and multiple scales for dynamic multi-objective optimization. ESWA, 298, 129642. (www)

  @article{ , abstract = {In dynamic multi-objective optimization problems, effectively predicting and tracking the Pareto optimal front (POF) under environmental changes has been one of the core challenges. In this paper, we propose a region-aware prediction strategy based on shared points and multiple scales (RADMOEA) that combines global and local characteristics, aiming to enhance the algorithm’s ability to sense and adapt to POF. Firstly, the center-point movement strategy is used to move the non-dominated solution set from the previous moment to obtain the non-dominated solution set after the movement. The actual non-dominated solution set at the current moment and the non-dominated solution set after the movement share points in the objective space, and these shared points divide the non-dominated solution set at the current moment into several subregions. Within each region, all individuals are appropriately rescaled, and a local coordinate system is established. Then, within the local coordinate system, each individual is associated with the nearest post-movement non-dominated individual. Finally, new populations adapted to environmental changes are generated by combining centroid movement directions, Gaussian perturbations, and multi-scale individual association relationships. The proposed strategy is compared with six advanced algorithms, and the experimental results demonstrate that RADMOEA is effective in tracking the POF under dynamic environments.}, archive = {J_ESWA}, author = {Yaru Hu and Sitong Wang and Junwei Ou and Zhenlin Mei and Juan Zou and Shengxiang Yang}, doi = {10.1016/j.eswa.2025.129642}, journal = {Expert Systems with Applications}, month = {3}, pages = {129642}, shortjournal = {Expert Syst. Appl.}, title = {Region-aware prediction strategy based on shared points and multiple scales for dynamic multi-objective optimization}, volume = {298}, year = {2026}, }
• (2026). A transformer network for multi-dimensional nonuniform aperture synthesis radiometer image inversion. ESWA, 298, 129641. (www)

  @article{ , abstract = {Passive microwave remote sensing plays a vital role in Earth observation, with applications in soil moisture, ocean salinity, and atmospheric monitoring. However, improving spatial resolution at low frequencies remains challenging. Recently, combining multiple small antenna arrays into a larger one has emerged as a technological approach to enhance spatial resolution. Nevertheless, aperture synthetic radiometers formed by such combinations usually consist of non-uniform antenna arrays (one-dimensional, two-dimensional, or three-dimensional). Compared with regular antenna arrays, they complicate the inversion of brightness temperature (BT) images. This paper proposes NASRT, a transformer-based inversion method designed for multi-dimensional non-uniform ASRs. The network extracts and fuses spectral and UVW spatial distribution features from the visibility function (VF), and introduces a learnable position weight matrix during training to capture spatial information of the non-uniform array. Through supervised learning, NASRT effectively maps the VF to BT images. Simulations across 1-D, 2-D, and 3-D NASR scenes demonstrate that NASRT achieves higher accuracy and stability than traditional methods. In a 1-D NASR indoor experiment, the proposed method also shows improved inversion accuracy and lower sidelobes, validating its effectiveness.}, archive = {J_ESWA}, author = {Jian Dong and Jiaxin Li and Chengwang Xiao and Rigeng Wu and Haofeng Dou and Wenjing Wang and Yuanchao Wu and Liangbing Chen}, doi = {10.1016/j.eswa.2025.129641}, journal = {Expert Systems with Applications}, month = {3}, pages = {129641}, shortjournal = {Expert Syst. Appl.}, title = {A transformer network for multi-dimensional nonuniform aperture synthesis radiometer image inversion}, volume = {298}, year = {2026}, }
• (2026). OceanAgent: A small-scale multi-modal assistant for ocean exploration. ESWA, 298, 129640. (www)

  @article{ , abstract = {Extraction of key information and the subsequent generation of actionable knowledge from multimodal data are critical for ocean exploration. Traditional knowledge generation methods rely heavily on expert experience and are labor-intensive. Recently, Large Multimodal Models (LMMs) have shown exceptional capabilities for knowledge generation from multimodal data in many complex tasks. These models also have potential to assist knowledge mining in ocean exploration. However, two major challenges faced by the LMMs when used in ocean exploration include the scarcity of ocean instruction-following data and the degradation of underwater visual environments. In this paper, a small-scale LMM for ocean exploration, named the OceanAgent, is designed. First, a swarm-intelligence-based leaderless multi-agent collaboration framework is proposed to generate visual instruction-following data. Subsequently, we present a visual-language connector to simultaneously extract multi-scale features. It is formed by integrating a multi-scale residual network with a multi-layer perceptron, which can enhance the model’s performance on severely low-quality images. Experiments show that the proposed method for constructing visual instruction-following datasets improves both the textual quality and visual dialogue. When severely degraded ocean visual data are processed using the trained OceanAgent, the image description accuracy and image comprehension are improved by 23.6 % and 21.6 %, respectively, compared to existing models. Additionally, the model demonstrates superior domain expertise, with a 95.7 % win rate in dialogue quality assessments.}, archive = {J_ESWA}, author = {Yun Xu and Yue Liu and Junpeng Shang and Jianmin Lin and Dongfang Ma}, doi = {10.1016/j.eswa.2025.129640}, journal = {Expert Systems with Applications}, month = {3}, pages = {129640}, shortjournal = {Expert Syst. Appl.}, title = {OceanAgent: A small-scale multi-modal assistant for ocean exploration}, volume = {298}, year = {2026}, }
• (2026). SPS-GAD: Spectral-spatial graph structure learning for anomaly detection in heterophilic graphs. ESWA, 298, 129639. (www)

  @article{ , abstract = {Graph anomaly detection(GAD) plays a critical role in fields such as fraud detection and network security. Although existing graph anomaly detection methods have achieved promising performance, most graph neural networks (GNNs) rely on the homophily assumption, which presumes that connected nodes share similar labels. However, real-world graphs frequently exhibit pronounced heterophily. Owing to class imbalance, normal nodes tend to have lower heterophily while anomalous nodes display higher heterophily. Furthermore, feature inconsistency induced by node camouflage exacerbates the detection challenge, rendering many existing approaches ineffective. To overcome these limitations, we propose SPS-GAD, a spectral-spatial graph structure learning framework specifically designed for detecting anomalous nodes in heterophilic graphs. First, to alleviate the feature inconsistency resulting from node camouflage, we develop a node reconstruction module that learns intermediate node representations to mitigate camouflage-induced bias, and applies spectral filters to extract the graph’s inherent structural features. Second, to address the heterophily disparities arising from class imbalance, we introduce a subgraph-type-aware spectral filtering module that leverages edge scores generated by an edge partitioner to segregate the graph into homophilic, ambiguous, and heterophilic subgraphs. Distinct spectral filters are subsequently applied to capture features across various frequency bands. Additionally, we integrate a neighbor-type-aware graph attention module that employs edge scores within an attention mechanism to guide the feature aggregation process, thereby enhancing spatial representation learning. Experimental evaluations on six real-world datasets reveal that SPS-GAD significantly outperforms all baseline methods in key metrics such as F1-Macro and AUC, thereby confirming its effectiveness in graph anomaly detection. The source code is publicly available at https://github.com/cozy24/SPS-GAD .}, archive = {J_ESWA}, author = {Chen Zhu and Yaying Zhang}, doi = {10.1016/j.eswa.2025.129639}, journal = {Expert Systems with Applications}, month = {3}, pages = {129639}, shortjournal = {Expert Syst. Appl.}, title = {SPS-GAD: Spectral-spatial graph structure learning for anomaly detection in heterophilic graphs}, volume = {298}, year = {2026}, }
• (2026). An efficient vision transformer-based 3D adaptive residual densenet with gated recurrent unit for early detection of alzheimer disease from magnetic resonance imaging. ESWA, 298, 129638. (www)

  @article{ , abstract = {The precise identification of Alzheimer’s disease (AD) holds a crucial position in patient healthcare, particularly in the early stages. This early detection is essential, as it allows patients to understand the severity of the disease and take preventive measures before irreversible brain damage occurs. Although recent studies have harnessed machine learning techniques for Computer-Aided Diagnosis (CAD) of AD, many of these research efforts have encountered limitations in diagnostic performance. In this research, a novel AD detection system using Magnetic Resonance Imaging (MRI) is developed to identify subtle brain changes at an early stage through deep learning strategies. The goal is to reduce the risk for individuals facing challenges such as aging and brain-related diseases. The MRI images were obtained from the internet. The detection phase begins by receiving the MRI images. A Vision Transformer-based 3D Adaptive Residual DenseNet combined with a Gated Recurrent Unit (VARD-GRU) architecture is employed for effective AD identification. Here, the model parameters are optimized using the proposed Fitness-based Walrus Optimization Algorithm (FWOA). The AD detection system’s performance is evaluated against several existing frameworks using validation metrics to assess its effectiveness. The accuracy of the developed FWOA-VARD-GRU model is 94.11%. The results demonstrate that the FWOA-VARD-GRU model significantly enhances diagnostic accuracy, outperforming comparable methods. The model’s effectiveness confirms its strong capability in detecting early-stage AD. This system offers a promising approach to reduce risks for individuals affected by aging and neurological conditions by enabling timely and accurate detection.}, archive = {J_ESWA}, author = {Dr. A. Hemlathadhevi and Indumathy Paranthaman and Moorthy Agoramoorthy and Dr. Hari Kumar Palani}, doi = {10.1016/j.eswa.2025.129638}, journal = {Expert Systems with Applications}, month = {3}, pages = {129638}, shortjournal = {Expert Syst. Appl.}, title = {An efficient vision transformer-based 3D adaptive residual densenet with gated recurrent unit for early detection of alzheimer disease from magnetic resonance imaging}, volume = {298}, year = {2026}, }
• (2026). Pareto optimization of two-agent scheduling on parallel batch machines. ESWA, 298, 129637. (www)

  @article{ , abstract = {This paper considers a Pareto optimization problem of scheduling jobs of two competing agents on parallel batch machines. The jobs have equal processing times and non-identical job sizes. The objective is to find Pareto optimality and the corresponding schedules for minimizing both agents’ makespans. We analyze and identify an approximate Pareto region with a guarantee of 2-approximate Pareto optimal. We propose an integrated algorithm to find the approximate Pareto optimal points. Our computational study shows that the proposed algorithm outperforms the widely used non-dominated sorting genetic algorithm (NSGA-II), and that the obtained approximate Pareto optimal front is very close to the Pareto optimal front.}, archive = {J_ESWA}, author = {Cui-Lin Zhang and Guo-Qiang Fan}, doi = {10.1016/j.eswa.2025.129637}, journal = {Expert Systems with Applications}, month = {3}, pages = {129637}, shortjournal = {Expert Syst. Appl.}, title = {Pareto optimization of two-agent scheduling on parallel batch machines}, volume = {298}, year = {2026}, }
• (2026). Hybrid fleet composition and scheduling for road-based cross-border logistics under cost differentiation: A bi-level programming approach. ESWA, 298, 129636. (www)

  @article{ , abstract = {Under the dual pressure of explosive growth in cross-border e-commerce demand and increasing timeliness requirements from overseas customers, cross-border logistics service providers are compelled to establish logistics facilities and deploy fleets across multiple regions to ensure rapid response. However, during freight transportation, the lack of effective management over these complex and heterogeneous fleets—particularly in terms of fleet composition and routing decisions—has led to high transportation costs and low operational efficiency. This study is grounded in the practical operational context of cross-border logistics in the Guangdong–Hong Kong–Macau Greater Bay Area and models a multi-level, multi-node cross-border transportation network. To minimize the overall operational cost, the problem is addressed from two interrelated decision-making perspectives: fleet composition at the strategic level and routing planning at the operational level. Thus, a bi-level programming model is proposed to systematically capture the hierarchical structure and the logical relationship between these two decision layers. Furthermore, the model incorporates cost differences among trucks with different functional capabilities to reflect the significant disparity in logistics cost structures between domestic and overseas operations. To address the above multi-objective mixed-integer linear programming (MILP) problem, a tailored Non-dominated Sorting Genetic Algorithm II (MNSGA-II) is developed. Several key components of the algorithm are modified and enhanced to improve its search efficiency and solution quality in handling the problem’s complexity. Comparative experiments against classical algorithms demonstrate the superior solution quality and robustness of the proposed approach. The influence of cost differentials on composition and scheduling decisions is further analyzed, providing practical insights for the strategic planning of cross-border logistics systems.}, archive = {J_ESWA}, author = {Zhi Tang and Ting Qu and Yanghua Pan and George Q. Huang}, doi = {10.1016/j.eswa.2025.129636}, journal = {Expert Systems with Applications}, month = {3}, pages = {129636}, shortjournal = {Expert Syst. Appl.}, title = {Hybrid fleet composition and scheduling for road-based cross-border logistics under cost differentiation: A bi-level programming approach}, volume = {298}, year = {2026}, }
• (2026). A diversity-based niching differential evolution with neighborhood competition for nonlinear equation systems. ESWA, 298, 129635. (www)

  @article{ , abstract = {Solving nonlinear equation systems (NESs) has long been a fundamental challenge in the field of optimization. Due to the existence of multiple roots, such problems often exhibit complex and multimodal characteristics. Although numerous differential evolution-based algorithms have been developed to solve NESs, most of them employ only a single mutation operator, which is not adaptable to different problem scenarios. To this end, a diversity-based niching differential evolution with neighborhood competition (DNDE) is proposed to solve NESs. First, a control mechanism that takes into account population diversity and the evolutionary stage is proposed to adaptively assign appropriate mutation strategies to each subpopulation (niche), thereby enhancing the efficiency of root-finding. Second, a neighborhood priority competition mechanism is proposed to reduce cross-peak competition between populations, which ensures local convergence while improving global convergence. Finally, a reinitialization strategy based on opposition learning is introduced to guide the population toward more promising areas of the search space. Experimental results on 18 complex NESs and two real-world engineering problems show that DNDE outperforms many advanced algorithms in both root rate and success rate, demonstrating its effectiveness and value in practical applications.}, archive = {J_ESWA}, author = {Jianwei Li and Xinchao Zhao and Lingyu Wu and Yizhan Wu and Lingjuan Ye}, doi = {10.1016/j.eswa.2025.129635}, journal = {Expert Systems with Applications}, month = {3}, pages = {129635}, shortjournal = {Expert Syst. Appl.}, title = {A diversity-based niching differential evolution with neighborhood competition for nonlinear equation systems}, volume = {298}, year = {2026}, }
• (2026). Ill-posed regions-aware self-supervised stereo matching with left-right consistency. ESWA, 298, 129634. (www)

  @article{ , abstract = {Stereo matching presents a significant challenge due to the difficulty in accurately matching pixels between two images. These challenging pixels are typically found in ill-posed regions, which include areas with weak or repetitive textures, occlusions, and invisible regions. In recent years, there has been extensive research into stereo matching methods based on deep learning. However, these methods often struggle to accurately handle ill-posed regions, resulting in limited improvements in accuracy. To address this issue, this paper introduces a stereo matching model, IASSM-LRC, that is not constrained by disparity range. This model employs self-attention and cross-attention from the Transformer for dense attention computation and generates an initial disparity map. To effectively manage ill-posed regions, invalid masks are generated using left and right disparity maps. The initial disparity map is then fine-tuned through these invalid masks. IASSM-LRC is trained in an unsupervised manner. Experimental results from multiple different scenes demonstrate that the IASSM-LRC model exhibits strong disparity prediction performance. On KITTI2015, its D1-fg metric is 13.48 %, outperforming both PASM-Net’s 16.36 % and Flow2Stereo’s 14.62 %. The prediction results on the self-built calibration board dataset and Middlebury dataset show that the model has better predictive performance for both textureless and repetitive texture regions and has better generalization performance.This method can improve disparity measurement and depth measurement in binocular universal scenes.}, archive = {J_ESWA}, author = {Shengwei Yang and Yuehang Wang and Zenghui Li and Shan Zhou and Zheng Wang and Yining Hu and Lizhe Xie}, doi = {10.1016/j.eswa.2025.129634}, journal = {Expert Systems with Applications}, month = {3}, pages = {129634}, shortjournal = {Expert Syst. Appl.}, title = {Ill-posed regions-aware self-supervised stereo matching with left-right consistency}, volume = {298}, year = {2026}, }
• (2026). TGNet: Texture-enhanced guidance network for RGB-D salient object detection. ESWA, 298, 129633. (www)

  @article{ , abstract = {RGB-D salient object detection achieves salient region localization in complex scenes by fusing RGB images and depth images. Existing methods typically employ two-stream networks to extract features separately followed by cross-modal fusion. However, differences between heterogeneous modalities can easily lead to feature degradation during cross-modal fusion, while the inherent noise interference in low-quality depth maps may generate cumulative effects during multi-stage propagation, severely constraining detection performance. To address these challenges, this paper proposes a texture-enhanced guided network. The core innovations lie in three aspects: during the feature encoding stage, a texture-enhanced module is constructed to utilize high-frequency texture information from RGB images through attention mechanisms for hierarchical optimization of depth features; in the feature fusion stage, a dual-path adaptive interaction module is designed to establish cross-modal semantic correlations via channel-spatial cooperative driving mechanisms, effectively suppressing redundant feature interference; for the decoding reconstruction stage, a dynamic hierarchical guidance mechanism is proposed to drive progressive calibration of low-level spatial details by high-level semantic features through learnable cross-scale transformation modules. Extensive experiments conducted on five benchmark datasets demonstrate that our method achieves competitive performance compared to other approaches.}, archive = {J_ESWA}, author = {Xiaogang Song and Hexiang Huang and Qin Zhao and Xinwei Guo and Xinhong Hei}, doi = {10.1016/j.eswa.2025.129633}, journal = {Expert Systems with Applications}, month = {3}, pages = {129633}, shortjournal = {Expert Syst. Appl.}, title = {TGNet: Texture-enhanced guidance network for RGB-D salient object detection}, volume = {298}, year = {2026}, }
• (2026). Dual-stream temporal-spatial forgery detection via phase-consistent edge features and 3D visual state-space modeling. ESWA, 298, 129632. (www)

  @article{ , abstract = {Deepfake, as a generative technology, has opened up new avenues for the development of the film, television, and art industries. However, its abusive use has triggered serious social security threats, such as infringement of portrait rights and the spread of misinformation, which has drawn widespread attention to research on deepfake detection techniques. Current deep learning-based face forgery detection methods face critical challenges: 1) insufficient focus on common forgery traces leads to poor generalization performance on datasets generated by unknown forgery methods; 2) traditional spatio-temporal feature fusion mechanisms struggle to balance the representational weights of spatial details and temporal dynamics, and exhibit inadequate robustness against post-processing operations like compression and cropping. To address these issues, this paper first designs a phase consistency edge artifact mining module is designed to extract common forgery traces from edge textures by leveraging the deep-phase information of images, significantly enhancing the model’s generalization ability. Second, a multi-frame synthesis strategy is designed to effectively integrate spatial and temporal features while balancing the network’s attention to these two feature domains. Third, a visual state-space model based on 3D scanning is designed, which for the first time employs the Mamba model to analyze spatio-temporal forgery patterns, notably improving the robustness of the model against unknown perturbations. Experimental results on standard benchmarks–FaceForensics++, Celeb-DFv2, WildDeepfake and DFDC(Preview)–demonstrate that the proposed method achieves state-of-the-art performance in three core dimensions: detection accuracy, cross-dataset generalization, and robustness against perturbations.}, archive = {J_ESWA}, author = {Zhong Chen and Siyang Wang and Zuxi Wang}, doi = {10.1016/j.eswa.2025.129632}, journal = {Expert Systems with Applications}, month = {3}, pages = {129632}, shortjournal = {Expert Syst. Appl.}, title = {Dual-stream temporal-spatial forgery detection via phase-consistent edge features and 3D visual state-space modeling}, volume = {298}, year = {2026}, }
• (2026). LSTT: Long short-term feature enhancement transformer for video small object detection. ESWA, 298, 129631. (www)

  @article{ , abstract = {Leveraging temporal information is crucial for small object detection in videos. Existing methods typically incorporate long-term or short-term temporal information uniformly, neglecting distinct cues from different frames that are essential for small object detection. In this paper, we propose LSTT, an end-to-end multi-frame fusion network that concurrently extracts global scene context from long-term frames and fine-grained appearance and motion cues from short-term frames. First, we introduce a progressive spatiotemporal sampling module that sparsely samples long-range frames and densely samples short-range frames. Second, we design a spatiotemporal alignment encoder module to extract frame-level temporal and spatial pixel features. Finally, We propose a long short-term feature aggregation module that employs a dynamic query generator to derive adaptive queries by implicitly modeling motion relationships among short-term frames, and guides a cascaded fusion of aggregated features from long-term, short-term, and current frames to fuse temporal information. Compared to state-of-the-art methods, our LSTT achieves absolute gains of 1.4 % and 2.1 % in detection precision on VisDrone-VID and UAVDT datasets, respectively.}, archive = {J_ESWA}, author = {Jinsheng Xiao and Wenbo Liu and Ruidi Chen and Yuchen Yan and Wei Yang}, doi = {10.1016/j.eswa.2025.129631}, journal = {Expert Systems with Applications}, month = {3}, pages = {129631}, shortjournal = {Expert Syst. Appl.}, title = {LSTT: Long short-term feature enhancement transformer for video small object detection}, volume = {298}, year = {2026}, }
• (2026). Scale-invariant information bottleneck for domain generalization. ESWA, 298, 129628. (www)

  @article{ , abstract = {One significant challenge in deep learning is the inability to effectively generalize to new data whose distribution differs from that of the training data. Hence, domain generalization has received increasing attention in related fields. Classical methods aim to identify an invariant predictor that can recognize invariant representations across all the training domains. However, these methods limit the model to rely solely on invariant representations, which hinders the learning of important finer details. To address this challenge, we propose a Scale-invariant Information Bottleneck (SIB) method to identify both invariant and scale-invariant features. We subsequently introduce a tractable loss function derived from the variational analysis. This novel method captures more detailed information, including fine textures and unique characteristics, while also eliminating irrelevant or spurious representations by using information bottleneck. Finally, extensive experiments conducted on Rotated MNIST, Colored MNIST, Colored Fashion-MNIST, PACS, Office-Home and Camelyon17-WILDS validate the effectiveness of our SIB method in addressing the domain generalization problems. Notably, our approach outperforms 14 existing methods with an average improvement of 4.74 %. More significantly, it surpasses 6 recent, related methods by an average of 2.21 %. Furthermore, we demonstrate the superiority of our method through the analysis of hidden feature maps and representations.}, archive = {J_ESWA}, author = {Mengyao Li and Jiangshe Zhang and Chunxia Zhang and Junmin Liu and Lizhen Ji}, doi = {10.1016/j.eswa.2025.129628}, journal = {Expert Systems with Applications}, month = {3}, pages = {129628}, shortjournal = {Expert Syst. Appl.}, title = {Scale-invariant information bottleneck for domain generalization}, volume = {298}, year = {2026}, }
• (2026). Optimal pricing for transfer of development rights under risk sharing: The context of china’s inter-provincial construction land quota trading. ESWA, 298, 129627. (www)

  @article{ , abstract = {Scientific and rational prices are determinant for the success of transfer of development rights (TDR). Nevertheless, previous studies largely overlook the multifaceted impacts of risks on pricing, hampering market participation and value revelation. This is especially relevant in the context of China’s inter-provincial construction land quota trading due to its broader scope and dynamic complexities. This study addresses this gap by proposing an integrated decision-making framework to identify TDR risk factors and determine the optimal pricing for TDR under risk sharing. Results show that among 28 identified risk factors across the trading lifecycle, pre-transaction (remediation application and remediation acceptance) risk factors exhibit lower weights (0.017 and 0.218) but demand greater responsibility from quota-sending governments (80.5% and 73.0%); quota transfer risk factors hold the highest weight (0.306), with nearly balanced responsibility sharing between trading parties; while post-transaction (remediation acceptance and post monitoring) risk factors (weighted at 0.215 and 0.218) should be borne mainly by quota-receiving governments (64.1% and 60.9%). A paradigmatic trading case study between Muli and Jiashan Counties empirically reveals that risk factors elevate the optimal price to 621171.89 yuan/mu—24.23% above the current national standard price—by increasing costs, reducing profits, decreasing the supply–demand ratio, and complicating ecological compensation. These findings underscore the importance of risk responsibility management and risk-based pricing mechanisms.}, archive = {J_ESWA}, author = {Jia-He Zhou and Yu-Jia Wei and Yu-Ming Zhu and Hong-Li Lin}, doi = {10.1016/j.eswa.2025.129627}, journal = {Expert Systems with Applications}, month = {3}, pages = {129627}, shortjournal = {Expert Syst. Appl.}, title = {Optimal pricing for transfer of development rights under risk sharing: The context of china’s inter-provincial construction land quota trading}, volume = {298}, year = {2026}, }
• (2026). Intelligent urban on-street parking space management for autonomous vehicles. ESWA, 298, 129626. (www)

  @article{ , abstract = {Curbside lanes are valuable spatial assets, with on-street parking, driving, and other travel modes competing for the space. Autonomous vehicle (AV) transport is expected to park at the curbside for diverse purposes, raising conflicts between driving and parking in the city centre. This study presents a framework to determine on-street parking configurations under different traffic flow and parking supply scenarios for the downtown region. The main contribution stems from solving the macro-level parking configuration problem using customised metaheuristics while considering microscopic AV operations. We tested the framework using a road network comprising a downtown central business district and adjacent urban areas. Among the considered metaheuristics, the discrete particle swarm optimisation outperformed the genetic algorithm in minimising network-level travel delays but at the cost of higher computational time. Three main empirical findings are derived. First , parking lanes are more likely to be assigned to edges in downtown areas or those with lower traffic and driving speeds. Second , high parking supply negatively affects the macroscopic fundamental diagram by increasing congestion and reducing flow efficiency, but such an effect diminishes in congested networks. Third , there exists an optimal parking supply level (40 % in the case study) for most flow rate conditions that can help reduce congestion. The proposed framework was validated through a case study in Midtown Manhattan, New York City. This study provides valuable insights for urban and transportation agencies to manage on-street parking lane assignments to balance parking and driving demands in the AV transport era. The approach has broader applicability as it is transferable to human-driven vehicles and mixed autonomy scenarios.}, archive = {J_ESWA}, author = {Qiming Ye and Prateek Bansal and Yuxiang Feng and Simon Hu and Panagiotis Angeloudis}, doi = {10.1016/j.eswa.2025.129626}, journal = {Expert Systems with Applications}, month = {3}, pages = {129626}, shortjournal = {Expert Syst. Appl.}, title = {Intelligent urban on-street parking space management for autonomous vehicles}, volume = {298}, year = {2026}, }
• (2026). Cross-session interest extraction for recommendation. ESWA, 298, 129625. (www)

  @article{ , abstract = {In recommender systems, due to device privacy restrictions, sometimes we can only obtain anonymous users’ interaction behavior within a single session. This type of recommendation is called session-based recommendation. Modeling users’ interest based on session data is one of the core issues in session-based recommendation. However, most existing methods only model users’ interest within individual sessions, neglecting information propagation across sessions. This paper addresses this challenge by designing a contrastive learning module based on clustering to model inter-session information propagation. Specifically, in addition to propagating information within sessions using hypergraph convolution, a cluster algorithm is applied to group all nodes across sessions. Then a contrastive learning loss is designed based on the clustering results to facilitate information propagation across sessions, thereby explicitly modeling the semantic similarity of similar items across different sessions. We call our model Clustering Hypergraph Neural Network (CluHNN). CluHNN explicitly learns the correlation between similar items across different sessions, improving the quality of item representations and, consequently, yielding better interest representations through cross-session information propagation. Experimental results on two real-world datasets show the effectiveness of the proposed CluHNN. For example, in terms of MRR@20, CluHNN achieves significant improvements of 1.3 % and 2.0 % relative gains over the strongest baseline, respectively.}, archive = {J_ESWA}, author = {Jin Jin and Chaoqun Li and Liangxiao Jiang}, doi = {10.1016/j.eswa.2025.129625}, journal = {Expert Systems with Applications}, month = {3}, pages = {129625}, shortjournal = {Expert Syst. Appl.}, title = {Cross-session interest extraction for recommendation}, volume = {298}, year = {2026}, }
• (2026). Incorporating estimated depth maps and multi-modal pretraining to improve salient object detection in optical remote sensing images. ESWA, 298, 129624. (www)

  @article{ , abstract = {As a burgeoning theme in optical remote sensing image (ORSI) analysis, salient object detection (SOD) plays a vital role in traffic monitoring, agriculture, disaster management, and other fields. However, the existing ORSI-SOD methods are all single-modal (RGB images primarily), which suffer from performance drop when facing complex scenes (e.g., intricate backgrounds, low contrast scenes, and similar objects). To address this challenge, we introduce estimated depth map to complement RGB image in ORSI-SOD for the first time, which provides 3D geometric cues to improve detection accuracy in complex scenes, thus advancing ORSI-SOD from single-modal to multi-modal. Furthermore, we design a novel pretraining framework: multi-modal reconstructed image pretraining (MMRIP) to pretrain SOD model in multi-modal ORSI-SOD. MMRIP initially utilizes a masked autoencoder (MAE) to restore the masked RGB image; subsequently, it feeds the restored RGB image and clean depth map to the SOD model to generate the saliency map, which can help SOD model more effectively integrate cross modal information and extract better feature. Besides, we present a simple RGB-D SOD model, namely SimSOD, which is pretrained by MMRIP for ORSI-SOD. SimSOD has two major components: DFormer (encoder) and MLP head (decoder). Specifically, we first input RGB image and depth data into the encoder to generate four multi-scale features, then use the decoder to fuse these features and yield the prediction result. Without bells and whistles, our proposed method outperforms the state-of-the-art methods on three public ORSI-SOD datasets. The code can be accessed at: https://github.com/Voruarn/MMRIP .}, archive = {J_ESWA}, author = {Yuxiang Fu and Wei Fang}, doi = {10.1016/j.eswa.2025.129624}, journal = {Expert Systems with Applications}, month = {3}, pages = {129624}, shortjournal = {Expert Syst. Appl.}, title = {Incorporating estimated depth maps and multi-modal pretraining to improve salient object detection in optical remote sensing images}, volume = {298}, year = {2026}, }
• (2026). An effective new penetration test approach to detect web attacks on web applications. ESWA, 298, 129623. (www)

  @article{ , abstract = {As web applications increasingly involve sensitive transactions such as e-commerce, online banking, and public services, they have become primary targets for cyberattacks. Therefore, web application penetration testing is vital for discovering and protecting against vulnerabilities in web-based systems. This study introduces an automated penetration testing tool that systematically applies comprehensive penetration testing methodologies to effectively identify and mitigate web application vulnerabilities. The proposed tool uses a hybrid approach that includes automated and manual testing phases for multiple attacks, including SQL Injection, Cross-Site Scripting, and Cross-Site Request Forgery. System diversity is increased, and the penetration testing process is enriched using Python scripts and APIs. The tool provides an effective mechanism for uncovering critical vulnerabilities by simulating real-world attacker behavior. Practical evaluations on various web applications demonstrate the tool’s ability to identify vulnerabilities and increase system resilience. This research will help developers and security engineers apply this automated, specialized approach to security as our digital environment becomes more connected.}, archive = {J_ESWA}, author = {Muhammed Onur Kaya and Huseyin Alperen Dagdogen and Mehmet Ozdem and Resul Das}, doi = {10.1016/j.eswa.2025.129623}, journal = {Expert Systems with Applications}, month = {3}, pages = {129623}, shortjournal = {Expert Syst. Appl.}, title = {An effective new penetration test approach to detect web attacks on web applications}, volume = {298}, year = {2026}, }
• (2026). An approach for linking dynamic network information models based on ontology matching. ESWA, 298, 129622. (www)

  @article{ , abstract = {Dynamic network information models are typically heterogeneous and isolated systems that impede effective interoperability, significantly hindering end-to-end service integration and data sharing across network segments. To address this challenge, we propose a new approach for linking heterogeneous dynamic network models based on ontology matching, which can be applied in various domains utilizing dynamic networks. For ontologies matching we use different existing duplicate detection algorithms but we reduce the computational complexity of ontology matching due to splitting initial set of matched entities into a number of subsets using domain knowledge. Using telecommunications as case study, we represent operator networks as knowledge graphs and match them with standardized model ontologies using business process context to create an Extended Operator Network Ontology. Our approach ensures linking of dynamic network models used in operators information systems that is of primary importance for implementing complex business processes, and providing integrated services while maintaining existing models.}, archive = {J_ESWA}, author = {Tianxing Man and Igor Kulikov and Jiafeng Yang and Nataly Zhukova}, doi = {10.1016/j.eswa.2025.129622}, journal = {Expert Systems with Applications}, month = {3}, pages = {129622}, shortjournal = {Expert Syst. Appl.}, title = {An approach for linking dynamic network information models based on ontology matching}, volume = {298}, year = {2026}, }
• (2026). An improved differential evolution algorithm combined with vector NFP and mixed-integer programming for solving 2D irregular layout problem. ESWA, 298, 129621. (www)

  @article{ , abstract = {The two-dimensional irregular layout problem, which involves placing convex or non-convex components within a confined boundary without overlaps, is NP-complete and widely encountered in industrial applications such as glass cutting, garment manufacturing, and packaging. To overcome the limitations of existing methods in computational efficiency and material utilization, we propose a new hybrid algorithm IDE-V-NFP-MIP: (1) An improved differential evolution (IDE) algorithm combines the memory mechanism to guide the crossover and mutation operations; (2) A vector No-Fit Polygon (V-NFP) algorithm effectively handles complex geometric constraints, including voids and degradation; (3) A mixed-integer programming (MIP) model ensures accurate layout and non-overlapping constraints. Experimental results demonstrate superior performance: IDE ranked first in CEC2022 Friedman tests, while practical applications show 22.10% reduction in board length and 41.47% improvement in filling rate. The framework successfully handles real-world garment cutting applications and large-scale problems up to 1,280 polygons, demonstrating significant improvements in both computational efficiency and solution quality for industrial layout optimization. The source code for the algorithm is available at https://github.com/xhj-6/IDE-V-NFP-MIP .}, archive = {J_ESWA}, author = {Huijie Xu and Qifang Luo and Yongquan Zhou}, doi = {10.1016/j.eswa.2025.129621}, journal = {Expert Systems with Applications}, month = {3}, pages = {129621}, shortjournal = {Expert Syst. Appl.}, title = {An improved differential evolution algorithm combined with vector NFP and mixed-integer programming for solving 2D irregular layout problem}, volume = {298}, year = {2026}, }
• (2026). Intelligent localization of FDIA in smart grids: A multi-level wavelet spatio-temporal graph embedding approach. ESWA, 298, 129620. (www)

  @article{ , abstract = {In the realm of smart grid security, the precise identification of False Data Injection Attack (FDIA) is crucial for ensuring the stable operation of power systems. Existing approaches for handling measurement data often overlook the correlation between local time–frequency variations caused by FDIA nodes and global spatial information in analyzing measurement data, leading to inaccurate localization. To address this issue, we propose a novel approach: a multilevel wavelet spatio-temporal map embedded FDIA localization method. Initially, a multi-resolution time–frequency signal decomposition model is utilized to separate the time–frequency mutation signals induced by FDIA from the measurement data using fast wavelet transform. Subsequently, a multi-channel time–frequency feature extraction technique is developed to capture the mutation characteristics of FDIA in time–frequency signals. This involves extracting detailed features of the time–frequency signals pre and post-attack via a multi-channel convolution operation encompassing “temporal-local-global” aspects. Finally, we propose an FDIA localization model based on multi-level graph wavelet embedding. The model embeds spatio-temporal information into time–frequency features via graph wavelet convolution and builds a spatio-temporal dependency map through multi-level neighborhood sampling. To mitigate measurement loss and noise, graph smoothing regularization and graph dropout are introduced during training. A graph attention mechanism further captures spatio-temporal dependencies among nodes, enabling accurate FDIA localization. Experimental results verify the effectiveness of the proposed method.}, archive = {J_ESWA}, author = {Zhaoyang Qu and Feng Liang and Nan Qu and Tao Jiang and Xiaoyu Xu}, doi = {10.1016/j.eswa.2025.129620}, journal = {Expert Systems with Applications}, month = {3}, pages = {129620}, shortjournal = {Expert Syst. Appl.}, title = {Intelligent localization of FDIA in smart grids: A multi-level wavelet spatio-temporal graph embedding approach}, volume = {298}, year = {2026}, }
• (2026). AI-driven 5G-IoT optimization: Q-learning for real-time energy and network resource management. ESWA, 298, 129619. (www)

  @article{ , abstract = {In recent times, the integration of the 5G-enabled Internet of Things has revolutionized through high-speed data transmission, ultra-low latency, and interconnectivity of massive devices. However, the proliferation of 5G-enabled Internet of Things introduces major challenges, such as energy inefficiency and unreliable data delivery in the resource constrained Internet of Things devices. This research proposes a novel Q-Learning-based optimization framework tailored to address these challenges by integrating Radio Frequency energy harvesting, adaptive beamforming, and dynamic resource allocation within the massive Multiple-Input-Multiple-Output system. The proposed model utilizes reinforcement learning to manage the network resources including modulation schemes, beamforming, and energy allocation. By modeling the optimization problem as a Markov Decision Process, the proposed framework dynamically adapts to real-time network conditions to enhance energy efficiency, reliable data delivery, and throughput. The experimental validation demonstrates that the Q-Learning-based strategy effectively optimizes the energy efficiency as well as data transmission and achieves a higher energy efficiency of 98.87 %, higher packet delivery ratio of 98.85 %, lower latency of 1.5 ms, and higher throughput of 200Mbps compared to existing methodologies. This result indicates that the proposed Q-Learning-based framework has the potential to enhance the sustainability and reliability of the 5G-enabled Internet of Things.}, archive = {J_ESWA}, author = {Bavethra Murthy and Palani Uthirapathy}, doi = {10.1016/j.eswa.2025.129619}, journal = {Expert Systems with Applications}, month = {3}, pages = {129619}, shortjournal = {Expert Syst. Appl.}, title = {AI-driven 5G-IoT optimization: Q-learning for real-time energy and network resource management}, volume = {298}, year = {2026}, }
• (2026). Multi-behavioral recommendation algorithm based on decoupled graph convolution. ESWA, 298, 129618. (www)

  @article{ , abstract = {Traditional recommendation models primarily rely on display feedback and typically utilize a single type of user-item interaction data, which often results in significant data sparsity issues. In contrast, multi-behavioral recommendation models leverage various behaviors such as browsing, favoriting, and other interactions. These additional behaviors help improve the prediction of user-item interactions. Existing multi-behavioral recommendation methods often overlook the potential factors influencing multi-behavioral interactions and the differences between various behavior types. In this study, we introduce a multi-behavioral recommendation algorithm utilizing decoupled graph convolution (MBR-DGC), which effectively mitigates the data sparsity of the target behaviors and improves recommender system performance by capturing the differences between the semantics of different behaviors. Specifically, we construct multiple non-overlapping independent isomorphic graphs and separate potential factors affecting the interactions among users, items, and behaviors using decoupled convolutional networks to reconstruct the node features of users in different behaviors. Afterwards, multi-behavioral features of users are aggregated using contrastive learning to achieve personalized multi-behavioral information aggregation. Experimental results on multiple datasets show that MBR-DGC effectively leverages multi-behavioral data, significantly enhancing recommendation performance compared to other state-of-the-art methods.}, archive = {J_ESWA}, author = {Xu Yu and Pengju Ding and Jie Yu and Junyu Lin and Lei Guo and Guanfeng Liu and Liang Xi}, doi = {10.1016/j.eswa.2025.129618}, journal = {Expert Systems with Applications}, month = {3}, pages = {129618}, shortjournal = {Expert Syst. Appl.}, title = {Multi-behavioral recommendation algorithm based on decoupled graph convolution}, volume = {298}, year = {2026}, }
• (2026). An information aggregation decision making method for UAV swarm intelligence system based on joint communication and proximal strategy. ESWA, 298, 129617. (www)

  @article{ , abstract = {The swarm intelligence aggregation system represents a key capability in current-generation UAV swarm, demonstrating robust collective intelligence. Currently, leveraging Multi-Agent Deep Reinforcement Learning (MADRL) offers a promising approach for building UAV swarm intelligence aggregation systems. However, the MADRL methods are difficult to cope with the challenge of exponential increase in computation when facing the collaboration problem of large-scale swarms, and the agents also have the problem of partial observability of the environment. This paper proposes an Information Aggregation Decision Method for UAV swarm based on Joint Communication and Proximal Strategy (IADM-JCPS). This method designs a communication information aggregation (CIA) network to enable UAVs to gather observation information from neighbor UAVs, and uses the attention mechanism to screen important information. Then, the aggregated information is used as part of the input of the policy network to increase the information diversity of the decision-making process. Finally, the gradient clipping mechanism is used to trim the policy gradient to enhance the stability of the training process. A UAV swarm multi-target tracking (MTT) mission scenario is designed to verify the effectiveness of the proposed IADM-JCPS algorithm. Experimental results show that the proposed algorithm is superior to the baseline algorithm in terms of task collaboration and scalability.}, archive = {J_ESWA}, author = {Zhaotian Wei and Ruixuan Wei}, doi = {10.1016/j.eswa.2025.129617}, journal = {Expert Systems with Applications}, month = {3}, pages = {129617}, shortjournal = {Expert Syst. Appl.}, title = {An information aggregation decision making method for UAV swarm intelligence system based on joint communication and proximal strategy}, volume = {298}, year = {2026}, }
• (2026). Learning-based trajectory planning for AGVs in dynamic environment. ESWA, 298, 129616. (www)

  @article{ , abstract = {In this work, we present a learning-based framework for rapid trajectory planning of autonomous ground vehicles (AGVs) in dynamic environments. The approach integrates optimization techniques with deep learning to design a real-time planner capable of generating kinematically feasible trajectories. A continuous iterative method is first developed for dataset construction, enabling efficient generation of optimal trajectory sets. Based on this dataset, a neural network is trained to learn the mapping between AGV states and actions while capturing their temporal dependencies. During online planning, the trained model produces decision actions from the current state and sensor feedback, enabling real-time planning of safe and feasible trajectories. Results demonstrate the effectiveness of the proposed framework.}, archive = {J_ESWA}, author = {Runda Zhang and Zhida Xing and Senchun Chai and Yuanqing Xia and Runqi Chai}, doi = {10.1016/j.eswa.2025.129616}, journal = {Expert Systems with Applications}, month = {3}, pages = {129616}, shortjournal = {Expert Syst. Appl.}, title = {Learning-based trajectory planning for AGVs in dynamic environment}, volume = {298}, year = {2026}, }
• (2026). Model-agnostic post-hoc explainability for recommender systems. ESWA, 298, 129608. (www)

  @article{ , abstract = {Recommender systems often benefit from complex feature embeddings and deep learning algorithms, which deliver sophisticated recommendations that enhance user experience, engagement, and revenue. However, these methods frequently reduce the interpretability and transparency of the system. In this research, we develop a systematic application, adaptation, and evaluation of deletion diagnostics in the recommender setting. The method compares the performance of a model to that of a similar model trained without a specific user or item, allowing us to quantify how that observation influences the recommender, either positively or negatively. To demonstrate its model-agnostic nature, the proposal is applied to both Neural Collaborative Filtering (NCF), a widely used deep learning-based recommender, and Singular Value Decomposition (SVD), a classical collaborative filtering technique. Experiments on the MovieLens and Amazon Reviews datasets provide insights into model behavior and highlight the generality of the approach across different recommendation paradigms.}, archive = {J_ESWA}, author = {Irina Arévalo and Jose L. Salmeron}, doi = {10.1016/j.eswa.2025.129608}, journal = {Expert Systems with Applications}, month = {3}, pages = {129608}, shortjournal = {Expert Syst. Appl.}, title = {Model-agnostic post-hoc explainability for recommender systems}, volume = {298}, year = {2026}, }
• (2026). AERO-net: AutoEncoder-driven residual optimization network for latent bias correction of WRF-ROMS. ESWA, 298, 129607. (www)

  @article{ , abstract = {Reliable assessment of precipitation is crucial for incorporating meteorological and hydrological research into industrial and agricultural applications. Accurately estimating precipitation is a challenging task. In addressing this problem, we propose to develop AERO-Net, a novel deep learning framework designed to correct spatial, temporal, and amplitude biases in WRF-ROMS precipitation data. The integration of the Weather Research and Forecasting (WRF) model with the Regional Ocean Modeling System (ROMS) makes it a valuable tool for precipitation forecasting. AERO-Net incorporates autoencoders (AEs) for handling fluctuation and generalizing latent space representations, a latent module (LM) for transforming WRF-ROMS data into bias-corrected representations, a residual module (RM) for error minimization via boost, and a calibration module (CM) for improving near-zero precipitation. Empirical results show that AERO-Net achieves a balanced error reduction across precipitation cohorts grouped by intensity, reducing the macro-averaged root mean square error (macro RMSE) by 3.6 mm/day and the macro-averaged mean absolute deviation (macro MAD) by 0.68 mm/day compared to the original WRF-ROMS. AERO-Net is seen to improve the correlation coefficient (CC) by 26.32 %, increasing it from 0.38 to 0.48, in comparison to the original WRF-ROMS. These findings underscore its potential as an effective solution for enhancing precipitation estimates in high-resolution modeling systems.}, archive = {J_ESWA}, author = {Passin Pornvoraphat and Kanoksri Sarinnapakorn and Ken-Ichi Fukui and Peerapon Vateekul}, doi = {10.1016/j.eswa.2025.129607}, journal = {Expert Systems with Applications}, month = {3}, pages = {129607}, shortjournal = {Expert Syst. Appl.}, title = {AERO-net: AutoEncoder-driven residual optimization network for latent bias correction of WRF-ROMS}, volume = {298}, year = {2026}, }
• (2026). Contrastive learning and physics oriented evaluation for advanced segmentation in electron tomography. ESWA, 298, 129606. (www)

  @article{ , abstract = {Deep learning methods are now achieving strong results for segmentation tasks, and the standard metric for evaluating methods is the Intersection over Union (IOU). However, we show in this paper that IOU is not efficient in evaluating the quality of segmentation for electron tomography (ET) images of zeolites. We perform a physics-oriented evaluation to ensure that the segmentation results yield coherent physical measures. We also formalize Mixed Supervised / Self-Supervised Contrastive Learning Segmentation (M3S-CLS), a semi-supervised approach using a contrastive learning approach that uses expert annotations to train the neural network model. A detailed comparison of this method with a standard cross-entropy-based model is provided. In addition, we publish a database of five fully segmented ET volumes along with corresponding baseline results. The code and the database is available at http://gitlab.univ-st-etienne.fr/labhc-iscv/M3S-CLS .}, archive = {J_ESWA}, author = {Cyril Li and Christophe Ducottet and Maxime Moreaud and Sylvain Desroziers and Valentina Girelli Consolaro and Virgile Rouchon and Ovidiu Ersen}, doi = {10.1016/j.eswa.2025.129606}, journal = {Expert Systems with Applications}, month = {3}, pages = {129606}, shortjournal = {Expert Syst. Appl.}, title = {Contrastive learning and physics oriented evaluation for advanced segmentation in electron tomography}, volume = {298}, year = {2026}, }
• (2026). DSANet: Deep surrounding-aware network for camouflaged object detection via cross-refinement mirror strategy. ESWA, 298, 129605. (www)

  @article{ , abstract = {Camouflaged objects often closely resemble their surroundings, causing standard RGB images to be confounded by background, texture, and color variations. This often leads to incomplete or absent target segmentation, reducing overall accuracy. To address this issue, we present a Deep Surrounding-Awareness Mirror Network (DSANet) for camouflaged object detection, leveraging depth information to expose objects incongruent with their environment, thus improving localization accuracy. First, a Convolutional Spatial Gating module processes batched RGB and depth inputs, suppressing extraneous background noise while isolating fine-grained segmentation and structural features and unifying channel representation. Subsequently, a Deep Surrounding-Awareness Localization module and a Contour-Guided Integrity Aggregation module collaboratively refine and merge multi-level features, focusing on the global form of camouflaged objects while iteratively enhancing segmentation detail. Finally, a Guided Residual Channel Attention module further refines low-layer structural cues. Extensive experiments on ten challenging benchmark datasets using four widely used evaluation metrics demonstrate that our method exhibited superior performance, outperforming 40 state-of-the-art methods. The results demonstrate the versatility of our model. The source code and results of our method are available at https://github.com/lixu11/DSANet.}, archive = {J_ESWA}, author = {Xu Li and Xiaosheng Yu and Peng Chen}, doi = {10.1016/j.eswa.2025.129605}, journal = {Expert Systems with Applications}, month = {3}, pages = {129605}, shortjournal = {Expert Syst. Appl.}, title = {DSANet: Deep surrounding-aware network for camouflaged object detection via cross-refinement mirror strategy}, volume = {298}, year = {2026}, }
• (2026). FTUAttack: Feature truncation unrestricted attack based on stable diffusion model. ESWA, 298, 129604. (www)

  @article{ , abstract = {In the field of adversarial example generation and defense, compared to restricted attacks with L p -norm constraints, unrestricted attacks without L p -norm constraints emanate better visual imperceptibility. Existing unrestricted attacks typically manipulate the semantic content of examples (e.g. texture or color) to generate adversarial examples. However, current works usually ignore multifaceted features or loss optimization strategy, which limits attack performance. In this paper, we draw inspiration from stable diffusion model and propose a unrestricted attack method called Feature Truncation Unrestricted Attack (FTUAttack) to achieve both better transferability and imperceptibility. Specifically, we promote the performance of unrestricted attacks from the perspectives of both diffusion principle and feature truncation for the first time. Firstly, we propose a Global Deep Feature Extractor (GDFE) module to truncate global feature for the subsequent diffusion denoising process. Secondly, to further boost the transferability, we design a novel Critical Latent Feature Extractor (CLFE) module to obtain critical local feature that need to be truncated during the denoising process and investigate the influence of the different segmentation ways on critical local feature. Thirdly, we propose Multi-Loss Fusion (MLF) strategy to balance the conflict between perturbations and examples’ quality by guiding the optimization direction. Extensive experiments on various model structures and datasets demonstrate the superiority of our attack over the existing attack methods.}, archive = {J_ESWA}, author = {Shaojie Han and Gangzheng Zhai and Kun Chen and Shihui Zhang}, doi = {10.1016/j.eswa.2025.129604}, journal = {Expert Systems with Applications}, month = {3}, pages = {129604}, shortjournal = {Expert Syst. Appl.}, title = {FTUAttack: Feature truncation unrestricted attack based on stable diffusion model}, volume = {298}, year = {2026}, }
• (2026). Spatial-temporal hierarchical decoupled masked autoencoder: A self-supervised learning framework for electrocardiogram. ESWA, 298, 129603. (www)

  @article{ , abstract = {The difficulty of labeling Electrocardiogram (ECG) has prompted researchers to use self-supervised learning to enhance diagnostic performance. Masked autoencoders (MAE) are a mainstream paradigm where models learn a latent representation of the signal by reconstructing masked portions of the ECG. However, existing methods lack a specific design for the spatial–temporal characteristics of ECG. Specifically, leads represent spatial projections of cardiac activity, while timestamps capture temporal patterns, and the two correspond to different axes of information. Existing MAE frameworks tend to unify them prematurely, potentially weakening critical local dependencies. In this paper, we propose a Spatial-Temporal Hierarchical Decoupled Masked Autoencoder (STHD-MAE). This framework decouples ECG into isolated leads or time steps in the shallow layer to capture local dependencies with different views, then aligns spatial–temporal representations and re-establishes global dependencies in the deep layer to comprehensively represent pathological information. We also design a medical report fusion module during pre-training, which uses cross-attention to align the ECG report text encoded by a medical language model with the signal’s latent representation, thereby guiding the encoder to focus on pathological information through implicit cross-modal learning. We validate the effectiveness of STHD-MAE on multiple downstream classification and reconstruction tasks. The results show that STHD-MAE outperforms existing self-supervised learning methods by approximately 2% in F1-scores for both coarse-grained and fine-grained classification performance, and its reconstruction quality also exceeds the baseline generative model.}, archive = {J_ESWA}, author = {Xiaoyang Wei and Zhiyuan Li and Yuanyuan Tian and Mengxiao Wang and Yanrui Jin and Weiping Ding and Chengliang Liu}, doi = {10.1016/j.eswa.2025.129603}, journal = {Expert Systems with Applications}, month = {3}, pages = {129603}, shortjournal = {Expert Syst. Appl.}, title = {Spatial-temporal hierarchical decoupled masked autoencoder: A self-supervised learning framework for electrocardiogram}, volume = {298}, year = {2026}, }
• (2026). GARE-net: Geometric contextual aggregation and regional contextual enhancement network for image-text matching. ESWA, 298, 129602. (www)

  @article{ , abstract = {The local correspondence learning has gained increasing attention in image-text matching, which establishes fine-grained alignments between image regions and textual words to improve both interpretability and accuracy. While these approaches have made significant progress in identifying meaningful semantic correspondences, one critical limitation persists in current methods, i.e., overlooking the crucial spatial position information of visual regions in cross-modal interaction. To address this challenge, we propose a novel Geometric contextual Aggregation and Regional contextual Enhancement Network (GARE-Net) that introduces two innovative components: the Geometric Contextual Feature Aggregation (GCFA) module and the Regional Contextual Feature Enhancement (RCFE) module. Specifically, GCFA generates the spatial geometric information of visual regions to enhance the region features by feature aggregation. RCFE further refines the aggregated region features by constructing a region graph and graph convolution. Extensive experiments and analyses are conducted on Flickr30k and MSCOCO to evaluate the importance of our framework. The results demonstrate the superiority of our method in image-text matching. Moreover, the ablation studies and visualization case studies also highlight the importance of geometric contextual feature aggregation and regional contextual feature enhancement. The code is available at https://github.com/chinaBoy123/GARE-Net .}, archive = {J_ESWA}, author = {Fangming Zhong and Tao Zhou and Zhikui Chen and Suhua Zhang}, doi = {10.1016/j.eswa.2025.129602}, journal = {Expert Systems with Applications}, month = {3}, pages = {129602}, shortjournal = {Expert Syst. Appl.}, title = {GARE-net: Geometric contextual aggregation and regional contextual enhancement network for image-text matching}, volume = {298}, year = {2026}, }
• (2026). GSFF-SLAM: 3D semantic gaussian splatting SLAM via feature field. ESWA, 298, 129601. (www)

  @article{ , abstract = {Semantic-aware 3D scene reconstruction is essential for autonomous robots to perform complex interactions. Semantic SLAM, an online approach, integrates pose tracking, geometric reconstruction, and semantic mapping into a unified framework, shows significant potential. However, existing systems, which rely on 2D ground truth priors for supervision, are often limited by the sparsity and noise of these signals in real-world environments. To address this challenge, we propose GSFF-SLAM, a novel dense semantic SLAM system based on 3D Gaussian Splatting that leverages feature fields to achieve joint rendering of appearance, geometry, and N-dimensional semantic features. By independently optimizing feature gradients, our method supports semantic reconstruction using various forms of 2D priors, particularly sparse and noisy signals. Experimental results demonstrate that our approach outperforms previous methods in both tracking accuracy and photorealistic rendering quality. When utilizing 2D ground truth priors, GSFF-SLAM achieves state-of-the-art semantic segmentation performance with 95.03 % mIoU.}, archive = {J_ESWA}, author = {Zuxing Lu and Xin Yuan and Shaowen Yang and Jingyu Liu and Changyin Sun}, doi = {10.1016/j.eswa.2025.129601}, journal = {Expert Systems with Applications}, month = {3}, pages = {129601}, shortjournal = {Expert Syst. Appl.}, title = {GSFF-SLAM: 3D semantic gaussian splatting SLAM via feature field}, volume = {298}, year = {2026}, }
• (2026). Quantum probabilistic group consensus decision-making model based on matrix fluctuation grey correlation for engineering bid evaluation. ESWA, 298, 129600. (www)

  @article{ , abstract = {The existing quantum group decision-making models face significant challenges in the bid evaluation of engineering projects, including the strong subjectivity of expert evaluations, the difficulty in aggregating expert opinions, the large gap of expert opinions, and the complexity of expert psychological behaviors. To address these issues, this paper proposes a novel quantum probabilistic group consensus decision-making model based on matrix fluctuation grey correlation. Firstly, a quantum Bayesian network is constructed to aggregate expert opinions and capture the interference effect among experts. Secondly, the matrix fluctuation grey correlation degree is defined and applied to the calculation of quantum interaction terms that reflect the intricate psychological behavior of experts. Subsequently, a decision item search model is proposed and applied to adjust preferences during the consensus reaching process, thereby narrowing the gap of expert opinions. The consensus effect optimization model is utilized to determine optimal values for unknown parameters within this process, effectively reducing the subjectivity of expert evaluations. Finally, the proposed model is applied to a bid evaluation of bridge anti-collision engineering project, which verifies the feasibility and effectiveness of the model, and evaluates the stability and superiority of the model through sensitivity analysis and comparative analysis.}, archive = {J_ESWA}, author = {Jiuru Zhu and Xinping Xiao and Congjun Rao}, doi = {10.1016/j.eswa.2025.129600}, journal = {Expert Systems with Applications}, month = {3}, pages = {129600}, shortjournal = {Expert Syst. Appl.}, title = {Quantum probabilistic group consensus decision-making model based on matrix fluctuation grey correlation for engineering bid evaluation}, volume = {298}, year = {2026}, }
• (2026). DPCND: A dual-population based evolutionary approach for critical node detection problem in complex networks. ESWA, 298, 129599. (www)

  @article{ , abstract = {Critical node detection is an important tool for measuring network robustness. The main purpose of critical node detection is to detect a set of nodes that cause the greatest damage to the network connectivity, and it has been applied in many fields such as social network analysis and traffic network management. As a classic non-deterministic polynomial time complete problem, critical node detection faces enormous challenges with the continuous expansion of network size. The existing methods are difficult to achieve a good balance between effectiveness and efficiency, especially when the scale of complex networks becomes larger. To this end, this paper proposes a dual population based critical node detection method (DPCND) to effectively and efficiently obtain a set of critical nodes, which utilizes the co-evolution of auxiliary population generated from reduced graph and main population generated from original graph to find the optimal solution. In the proposed algorithm, a dual population interaction mechanism consists of influence and expansion strategies is proposed for information exchange, where the influence strategy transfers candidate good solutions from the auxiliary population to the main population to improve search efficiency, and the expansion strategy provides node information of the main population to guide the expansion of search space for the auxiliary population. Finally, the experimental results on 20 real-world complex networks clearly demonstrate the effectiveness of the proposed algorithm comparing to the state-of-the-arts.}, archive = {J_ESWA}, author = {Lei Zhang and Xinyi Feng and Yuanyuan Ge and Zhanpeng Wang and Haipeng Yang}, doi = {10.1016/j.eswa.2025.129599}, journal = {Expert Systems with Applications}, month = {3}, pages = {129599}, shortjournal = {Expert Syst. Appl.}, title = {DPCND: A dual-population based evolutionary approach for critical node detection problem in complex networks}, volume = {298}, year = {2026}, }
• (2026). A two-stage evolutionary algorithm with restart scheme for an integrated robot-task-scheduling and vehicle-dispatch-scheduling problem. ESWA, 298, 129598. (www)

  @article{ , abstract = {In modern agriculture, efficiently picking and distributing fresh product is crucial for the competitiveness of smart farms within the globalized agricultural market. However, the integrated scheduling problem involving both picking and distribution processes has received limited attention in existing research. To bridge this gap, this study establishes a mathematical model with dual objectives: (1) minimizing the picking completion time and (2) reducing penalties incurred due to early or delayed deliveries. A novel two-stage evolutionary algorithm incorporating a restart mechanism is proposed to effectively balance the optimization of these objectives with a high degree of consistency. The algorithm features an efficient encoding scheme and advanced genetic operators, specifically designed to enhance exploration and exploitation based on the characteristics of the problem. A comprehensive set of test instances is generated and the proposed method is benchmarked against several state-of-the-art metaheuristics from the literature. Experimental results demonstrate that the proposed algorithm outperforms the competing approaches by a significant margin for solving the problem under consideration.}, archive = {J_ESWA}, author = {Yiran Pan and Xuan He and Nan Li and Zhonghua Miao}, doi = {10.1016/j.eswa.2025.129598}, journal = {Expert Systems with Applications}, month = {3}, pages = {129598}, shortjournal = {Expert Syst. Appl.}, title = {A two-stage evolutionary algorithm with restart scheme for an integrated robot-task-scheduling and vehicle-dispatch-scheduling problem}, volume = {298}, year = {2026}, }
• (2026). An initial value insensitive method for phase equilibrium calculation: Constrained quadratic interpolation optimization algorithm. ESWA, 298, 129597. (www)

  @article{ , abstract = {The successful simulation of constrained differential evolution (CDE) algorithm for solving phase equilibrium calculation has first verified that heuristic optimization algorithms are effective ways to solve this kind of problems. Their insensitivity to initial values overcomes the limitations associated with two kinds of traditional methods, i.e., direct solution methods based on Newton’s method and indirect solution methods based on thermodynamic principles. This article proposes a constrained quadratic interpolation optimization algorithm (CQIO) for obtaining the satisfactory solutions of phase equilibrium calculation under given volume, temperature, and moles (NVT-flash). The proposed CQIO regards the total Helmholtz free energy of a NVT-flash problem as its objective function, while the moles vector and volume of a certain phase as its decision variables. The consistency between the four cases’ experimental results of CQIO and those of published articles demonstrates the effectiveness of CQIO in solving NVT-flash problems. Then the computational overhead and algorithmic stability of CQIO were analyzed. In Cases 1, 2 and 3, the average CPU time of CQIO compared to CDE has increased by 46.98 % , 54.56 % and 21.02 % respectively. The Std values of CQIO are significantly smaller than those of CDE in all cases except for Example 2. The proposed CQIO greatly promotes the application of heuristic algorithm in the field of phase equilibrium calculation.}, archive = {J_ESWA}, author = {Wangyu Tong and Baoduo Su and Yaqian Zhan}, doi = {10.1016/j.eswa.2025.129597}, journal = {Expert Systems with Applications}, month = {3}, pages = {129597}, shortjournal = {Expert Syst. Appl.}, title = {An initial value insensitive method for phase equilibrium calculation: Constrained quadratic interpolation optimization algorithm}, volume = {298}, year = {2026}, }
• (2026). Knowledge graph life cycle for cognitive agents – A case study on automated negotiation in smart grids. ESWA, 298, 129596. (www)

  @article{ , abstract = {Knowledge Graphs (KGs) can enhance cognitive artificial agents by improving their semantic understanding, adaptability to dynamic contexts, explainability, continuous learning, and informed, case-based decision-making. However, the development of any KG rarely follows an explicit and structured procedure to improve its consistency, modifiability, and interoperability. This ultimately restricts the utility of KGs for real-world agentic AI systems. To overcome this limitation, this paper proposes a life cycle for developing and evolving KGs in domain-specific applications, encompassing three phases to i) conceptualize the problem domain and competency questions, ii) formalize a schema using ontologies, and iii) implement the KG to foster agents’ cognition through queries and graph data science. The proposed approach is validated with a case study on context-aware automated negotiations within smart grids, where agents negotiate for energy trading while considering private and contextual circumstances. Agents may take actions with or without the aid of a KG, and can adopt one of three negotiation strategy configurations: heuristic, metaheuristic, or reinforcement learning-based. Negotiation outcomes consistently indicate that, regardless of the configuration employed, the use of a KG improves agents’ rewards by at least 1.21 % and up to 90.91 %. Results highlight that the proposed life cycle enables the integration of contextual and domain-specific data and metadata into a KG that enhances agents’ learning, while also allowing for the development and selection of relevant queries and graph data science algorithms to improve the strategic behavior of negotiation agents with cognitive abilities.}, archive = {J_ESWA}, author = {Dan E. Kröhling and Ernesto C. Martínez}, doi = {10.1016/j.eswa.2025.129596}, journal = {Expert Systems with Applications}, month = {3}, pages = {129596}, shortjournal = {Expert Syst. Appl.}, title = {Knowledge graph life cycle for cognitive agents – A case study on automated negotiation in smart grids}, volume = {298}, year = {2026}, }
• (2026). Research on multi-objective optimization of multi-endpoint VRP with time window for the distribution of seasonal products by multi-homing heterogeneous fleets. ESWA, 298, 129595. (www)

  @article{ , abstract = {This paper addresses a novel VRP variant integrating seasonal demand fluctuations, heterogeneous vehicle sources, and multi-endpoint constraints, focusing on the distribution of seasonal products in a steel parts enterprise. It tackles the complex vehicle routing problem with time windows involving heterogeneous fleets, which encompass different vehicle sources (owned and rented), types (fuel-powered and electric), capacities, ranges, and endpoints. To balance enterprise profitability, greenhouse gas emissions, and environmental quality, we develop a mathematical model centered on optimizing distribution costs, greenhouse gas emissions, and vehicle utilization. Drawing inspiration from ancient competitive activities, we propose a novel Huashan Swords Algorithm (HSSA). Through simulations using real enterprise data, we demonstrate the HSSA’s effectiveness, with comparative experiments against existing advanced algorithms highlighting its superiority. Applying the algorithm to design logistics distribution schemes, we conduct in-depth tests considering different customer groups and fuel station distributions. Analyzing the results from the perspectives of profitability, emissions, and environmental quality, we offer targeted operational suggestions for the enterprise based on its situation, geographical characteristics, and fiscal policies. Moreover, we provide recommendations to local governments on fuel station construction and vehicle subsidy policies, contributing practical solutions to both enterprise operations and regional development.}, archive = {J_ESWA}, author = {Zhang Yanhu and Yan Lijuan and Kong ShuMei and Miao Decheng}, doi = {10.1016/j.eswa.2025.129595}, journal = {Expert Systems with Applications}, month = {3}, pages = {129595}, shortjournal = {Expert Syst. Appl.}, title = {Research on multi-objective optimization of multi-endpoint VRP with time window for the distribution of seasonal products by multi-homing heterogeneous fleets}, volume = {298}, year = {2026}, }
• (2026). Revealing the correlation between economic indicators and gold prices for forecasting: Medium term forecast framework with data patch. ESWA, 298, 129594. (www)

  @article{ , abstract = {Predicting gold prices through the analysis of key economic indicators such as inflation rates, Government Bond Yields, and the U.S. Dollar Index, alongside historical Gold Prices, is crucial for enabling investors to better understand market dynamics and make vital decisions to maximize returns. However, previous studies have faced challenges in extracting hidden factors related to gold price prediction from diverse economic indicators, and the comprehensive exploration of gold price data is yet to be fully achieved. To address this, the present study introduces a mid to long-term gold price prediction model named DPformer. This model utilizes a patching strategy to investigate the relationships between different economic indicators and Gold Prices. It also employs a decomposition approach to discover the mid to long-term trend characteristics and yearly seasonal patterns of Gold Prices. The core of the model integrates a Transformer module, which is solely based on an Encoder structure, and enhances it with multiple attention mechanisms and convolutions. This enhancement allows the improved Transformer model to more effectively capture the long-term dependencies of Gold Prices. The empirical results demonstrate that DPformer consistently outperforms a suite of advanced models widely adopted in terms of mid to long-term forecasting accuracy, including LSTM, GRU, Transformer, DLinear, and PatchTST. Notably, for the 30-step gold price prediction task, DPformer achieves a 21.78 % reduction in Mean Squared Error compared to PatchTST. Moreover, by quantitatively analyzing how various economic indicators influence gold price forecasts, this study provides substantial support for investors in making informed decisions at critical moments.}, archive = {J_ESWA}, author = {Guanhao Bao and Yunbo Niu and Baisheng Cui and Wanying Ji}, doi = {10.1016/j.eswa.2025.129594}, journal = {Expert Systems with Applications}, month = {3}, pages = {129594}, shortjournal = {Expert Syst. Appl.}, title = {Revealing the correlation between economic indicators and gold prices for forecasting: Medium term forecast framework with data patch}, volume = {298}, year = {2026}, }
• (2026). AI-driven optimization of project portfolios in corporate ecosystems with synergies and strategic factors. ESWA, 298, 129593. (www)

  @article{ , abstract = {This paper studies the optimization of project portfolios in corporate ecosystems by considering both strategic factors and return synergies between projects. We propose a hybrid method that combines machine learning with mathematical programming to address this enhanced form of project portfolio optimization. Unlike traditional approaches, which evaluate projects mainly based on individual risks and returns, our framework considers strategic priorities and the extra value created when projects reinforce each other. Machine learning models predict synergies, while exact optimization ensures consistent portfolio selection under resource and strategic constraints. A numerical proof-of-concept illustrates the methodology. Computational experiments show that portfolios designed with synergy and strategy in mind might achieve a significantly higher performance than portfolios that do not account for project synergies. The paper also examines computational efficiency and scalability, highlighting the approach’s potential for practical application in complex and dynamic corporate ecosystems.}, archive = {J_ESWA}, author = {Patricia Rodriguez-Garcia and Angel A. Juan and Jon A. Martin and David Lopez-Lopez and Josep M. Marco}, doi = {10.1016/j.eswa.2025.129593}, journal = {Expert Systems with Applications}, month = {3}, pages = {129593}, shortjournal = {Expert Syst. Appl.}, title = {AI-driven optimization of project portfolios in corporate ecosystems with synergies and strategic factors}, volume = {298}, year = {2026}, }
• (2026). Overview of machine learning in class imbalance scenarios: Trends, challenges, and approaches. ESWA, 298, 129592. (www)

  @article{ , abstract = {This study presents a systematic mapping of machine learning in class imbalance scenarios, offering a broad overview of key challenges, promising emerging techniques, and established methodologies across various application domains. The investigation stands out by employing a hybrid search and selection protocol that combines methodological rigor with technical innovation. The adopted strategy integrated manual searches in reference sources with automated processes based on machine learning, semantic embeddings, and graph-based ranking algorithms. To enhance selection quality, the Quasi-Golden Set (QGS) method was used to build a reference set from manually selected articles – a critical foundation for calibrating and evaluating automated search strings. This combination ensured broad coverage of the topic while improving sensitivity and precision in identifying relevant studies. The initial analysis reviewed 25,593 publications. After screening and applying eligibility criteria, 468 articles were included in the final dataset. The results indicate that 55 % of the studies address multiple domains, with a strong predominance of tabular data ( 84 % ). SMOTE and hybrid approaches were among the most common techniques, present in 61 % of the studies. In terms of evaluation metrics, ROC-AUC was the most frequently used, followed by F1-score and accuracy – the latter noted for limitations in highly imbalanced scenarios. Building on these findings, we derive an empirically grounded taxonomy that links problem context, solution algorithms, and scenario-appropriate evaluation metrics, and we provide a minimal selection guideline table to support applied use. While sampling-based methods remain prevalent, deep learning approaches such as convolutional neural networks and graph-based models are increasingly adopted. Additionally, federated, contrastive, and semi-supervised learning are emerging as relevant paradigms, particularly suited for privacy-aware or low-label environments. This study consolidates current knowledge, identifies methodological and application gaps, and highlights trends that are likely to shape future research. It contributes both a comprehensive synthesis of the field and strategic insights for advancing machine learning techniques in the presence of class imbalance.}, archive = {J_ESWA}, author = {Gilberto Sussumu Hida and André Câmara Alves Do Nascimento}, doi = {10.1016/j.eswa.2025.129592}, journal = {Expert Systems with Applications}, month = {3}, pages = {129592}, shortjournal = {Expert Syst. Appl.}, title = {Overview of machine learning in class imbalance scenarios: Trends, challenges, and approaches}, volume = {298}, year = {2026}, }
• (2026). Multi-objective multi-product process planning with reconfigurable machines: Exact and metaheuristic approaches. ESWA, 298, 129591. (www)

  @article{ , abstract = {Process planning in reconfigurable manufacturing systems usually considers a single product, this reduces the efficiency of the overall production plan when multiple products are combined. This paper tackles the Multi-Product Process Planning Problem (MPPP), optimizing both individual process plans and their sequencing. We propose a 0–1 LP model, the model is relaxed by fixing the product sequencing variables and implemented in a Normal-Boundary Intersection method (NBI-es), the method uses a function for iteratively updating β values. Three metaheuristics are also developed: NSGA-II, and two variants of MOEA/D, one enhanced by Opposition-based learning (OBL). Computational experiments show that the update function enhances the performance of NBI over simple Normalized-Weighted Sum (NWS) method. Additionally, NBI-es performs better in HV metric for small size instances if it is given enough CPU times, while MOEA/D significantly outperforms NSGA-II on larger instances on most convergence and spread based metrics. OBL further enhances solution diversity for MOEA/D, albeit with less convergence. A special case of the MPPP is investigated, involving identical products: the Multi-Unit Process Planning (MUPP). An integrated approach was compared with a sequential separated approach. Results indicate that the integrated approach outperforms the separated method for smaller problem instances. Moreover, the analysis of high-quality MUPP solutions revealed a tendency towards diverse process plan combinations rather than repetitive identical ones.}, archive = {J_ESWA}, author = {Abdelkader Mechaacha and Fayçal Belkaid and Nadjib Brahimi}, doi = {10.1016/j.eswa.2025.129591}, journal = {Expert Systems with Applications}, month = {3}, pages = {129591}, shortjournal = {Expert Syst. Appl.}, title = {Multi-objective multi-product process planning with reconfigurable machines: Exact and metaheuristic approaches}, volume = {298}, year = {2026}, }
• (2026). A slack-based two-stage improved particle swarm optimization algorithm for robust scheduling of a flexible job-shop with new and remanufacturing jobs. ESWA, 298, 129590. (www)

  @article{ , abstract = {Remanufacturing has attracted increasing attention for its environmental and economic benefits. Since it is difficult to achieve economies of scale when processing small amounts of remanufacturing jobs alone, these jobs are processed in the same job-shop for new jobs in some enterprises. The processing times of remanufacturing jobs are uncertain due to unpredictable status, leading to certain impacts on scheduling performance. Therefore, we address a flexible job-shop scheduling problem with new and remanufacturing jobs to minimize makespan. To solve this problem, a slack-based two-stage improved particle optimization algorithm is proposed. The first stage aims to yield a solution set with minimum makespan, while the second stage aims to search the best robust solution with maximum total slack from the set. Both stages are executed alternately to optimize makespan and total slack. Moreover, a position updating mechanism with genetic operators and a tabu search inspired local search strategy are implemented to improve algorithmic performance. Computational experiments are conducted using adapted benchmark problems and an industrial case to validate the proposed algorithm.}, archive = {J_ESWA}, author = {Jun Liu and Zhui Gui and An Li and Qiong Liu}, doi = {10.1016/j.eswa.2025.129590}, journal = {Expert Systems with Applications}, month = {3}, pages = {129590}, shortjournal = {Expert Syst. Appl.}, title = {A slack-based two-stage improved particle swarm optimization algorithm for robust scheduling of a flexible job-shop with new and remanufacturing jobs}, volume = {298}, year = {2026}, }
• (2026). Evaluating and predicting green economic efficiency in chinese cities: A three-stage network SBM and machine learning approach. ESWA, 298, 129589. (www)

  @article{ , abstract = {This paper evaluates and predicts green economic efficiency (GEE) across 248 Chinese cities from 2010 to 2021 using a three-stage network SBM model based on subsystems of economic production, social development, and environmental governance. To enhance accuracy in both assessment and forecasting, machine learning methods are incorporated, and the Dagum Gini coefficient is employed to analyze regional disparities. This study innovatively proposes a three-stage network SBM model to resolve the “black box” limitation of conventional DEA approaches, while a DEA-ML model is developed to achieve enhanced prediction accuracy. The results reveal that GEE in Chinese cities remains low, with the eastern region leading and the western region trailing. However, efficiency has improved since 2016, primarily driven by advancements in environmental governance. Regional disparities, largely attributed to interregional differences, are gradually decreasing. Among forecasting models, the backpropagation neural network (BPNN) delivers the highest accuracy, predicting sustained leadership in the east, strong growth in the northeast, and a reduction in national disparities. This study offers a comprehensive framework for evaluating and predicting GEE, providing valuable insights for sustainable development policies.}, archive = {J_ESWA}, author = {Zhishuo Zhang and Hu Liu and Yunpeng Gong and Huayong Niu}, doi = {10.1016/j.eswa.2025.129589}, journal = {Expert Systems with Applications}, month = {3}, pages = {129589}, shortjournal = {Expert Syst. Appl.}, title = {Evaluating and predicting green economic efficiency in chinese cities: A three-stage network SBM and machine learning approach}, volume = {298}, year = {2026}, }
• (2026). HAEA: A heterogeneous alternating evolutionary algorithm for numerical optimization. ESWA, 298, 129587. (www)

  @article{ , abstract = {A hybrid algorithm integrating a couple of individual evolutionary algorithms (sub-algorithms) is widely recognized as an effective approach to enhance both robustness and optimization performance. Nevertheless, such integration often destroys the structure of the sub-algorithm and makes it difficult to incorporate additional evolutionary algorithms. To address these limitations, this study introduces a novel framework, the Heterogeneous Alternating Evolutionary Algorithm (HAEA), designed to integrate multiple evolutionary algorithms while enabling the flexible addition, removal, and replacement of internal sub-algorithms. To facilitate the integration of a broad spectrum of sub-algorithms, this study draws inspiration from the particle swarm optimization algorithm to devise a suite of information indicators for the transmission of optimization information between sub-algorithms with disparate structures. Furthermore, HAEA is endowed with an adaptive mechanism that dynamically modifies the selection probabilities of its sub-algorithms based on their long-term and short-term performance throughout the evolutionary process. We conducted a comparative analysis of HAEA against all its sub-algorithms across three widely recognized function test sets: CEC2013, CEC2017, and CEC2022. Meanwhile, we applied the HAEA separately to basic metaheuristic algorithms and advanced evolutionary algorithms in recent years and conducted two comparative experiments. Both experimental results show that HAEA outperforms all sub-algorithms in terms of robustness and optimization performance. Its distinctive flexibility allows for the incorporation of additional superior evolutionary algorithms in the future, thereby enhancing its overall performance.}, archive = {J_ESWA}, author = {Taiyong Li and Tianhao Yi and Zhenda Hu and Wu Deng and Donglin Zhu and Zhilong Xie and Jiang Wu}, doi = {10.1016/j.eswa.2025.129587}, journal = {Expert Systems with Applications}, month = {3}, pages = {129587}, shortjournal = {Expert Syst. Appl.}, title = {HAEA: A heterogeneous alternating evolutionary algorithm for numerical optimization}, volume = {298}, year = {2026}, }
• (2026). Deep analysis on MLSY for fractional-order higher-dimension-valued neural networks under the action of free quadratic coefficients. ESWA, 298, 129586. (www)

  @article{ , abstract = {In this article, free quadratic coefficients are proposed in order to deeply study the flexible criteria of synchronization problem for two kinds of fractional-order higher-dimension-valued neural networks (FOHDVNN) with usual neurons and threshold ones, respectively. First, the uniform system is constructed for two kinds of FOHDVNN which contains both fractional-order octonion-valued neural networks (FOOVNN) and fractional-order quaternion-valued neural networks (FOQVNN). Based on higher-dimension algebra multiplication rules, the studied FOHDVNN are directly decomposed into the eight or four subsystems in real-valued field. Subsequently, free quadratic coefficients are taken into the establishment of two types of Lyapunov-Krasovskii functional (LKF) which is newer and more general. Then, mainly based on the very recent lemmas and Lyapunov theories, the flexible criteria are generally acquired for the global Mittag-Leffler synchronization (MLSY) problem of FOHDVNN. The final criteria have the advantage in being easily calculated and widely used. It is worth noting that the optimal solutions of these criteria can be obtained through the genetic algorithm and the synchronization performance can be improved by optimizing the quadratic coefficients. Finally, three simulation examples are presented to express the availability and progress of the derived results.}, archive = {J_ESWA}, author = {Jianying Xiao and Yongtao Li}, doi = {10.1016/j.eswa.2025.129586}, journal = {Expert Systems with Applications}, month = {3}, pages = {129586}, shortjournal = {Expert Syst. Appl.}, title = {Deep analysis on MLSY for fractional-order higher-dimension-valued neural networks under the action of free quadratic coefficients}, volume = {298}, year = {2026}, }
• (2026). Complex-order darwinian particle swarm optimization. ESWA, 298, 129584. (www)

  @article{ , abstract = {The Particle Swarm Optimization (PSO) algorithm has been one of the most effective methods for solving various complex optimization problems. However, non-adaptive versions of the PSO do not use historical information for performance enhancement and suffer from performance degradation problems. This paper presents a Complex-Order Darwinian PSO (CoDPSO) algorithm, which effectively enhances the performance of the PSO. A complex-order derivative mechanism is introduced into the velocity update rule to improve local exploitation using historical velocity information. Additionally, a Degradation Elimination (DE) strategy is designed to mitigate performance drop during the optimization process. Sensitivity analysis is conducted to evaluate the impact of control parameters on the algorithm’s behavior, demonstrating its robustness across a wide range of settings. Comparative experiments on CEC 2022 benchmark functions show that the CoDPSO outperforms other PSO variants in terms of accuracy, stability, and convergence. Wilcoxon statistical tests further confirm the significance of these improvements. The experimental results indicate the feasibility and efficiency of the CoDPSO.}, archive = {J_ESWA}, author = {Xiaobo Wu and Liping Chen and Huafeng Li and António M. Lopes and Chuang Liu and Yangquan Chen and Yi Chai}, doi = {10.1016/j.eswa.2025.129584}, journal = {Expert Systems with Applications}, month = {3}, pages = {129584}, shortjournal = {Expert Syst. Appl.}, title = {Complex-order darwinian particle swarm optimization}, volume = {298}, year = {2026}, }
• (2026). A multi-objective framework for predicting public opinion trends on infectious diseases using NSGA-II and interval predictions. ESWA, 298, 129583. (www)

  @article{ , abstract = {Predicting public opinion trends during major infectious disease outbreaks is critical for guiding effective public health responses. However, predicting public opinion remains challenging because it is influenced by socio-economic, psychological, and media factors. This paper presents a novel framework for predicting public opinion trends related to significant infectious diseases, with a focus on COVID-19 as a case study. The proposed framework identifies the key factors influencing public opinion development and enables both point and interval predictions. The framework uses information ecology theory and applies the NSGA-II algorithm to select the features that best drive public opinion trends. By incorporating this framework, accurate point forecasts are produced alongside prediction intervals, effectively quantifying the uncertainty inherent in public opinion dynamics. This approach minimizes the quality-driven loss function to generate precise prediction intervals, providing decision-makers with critical insights into public opinion fluctuations during epidemics. The results offer valuable, real-time public sentiment warnings, supporting timely and effective interventions in epidemic prevention and control efforts.}, archive = {J_ESWA}, author = {Futian Weng and Meng Su and Petr Hajek and Mohammad Zoynul Abedin}, doi = {10.1016/j.eswa.2025.129583}, journal = {Expert Systems with Applications}, month = {3}, pages = {129583}, shortjournal = {Expert Syst. Appl.}, title = {A multi-objective framework for predicting public opinion trends on infectious diseases using NSGA-II and interval predictions}, volume = {298}, year = {2026}, }
• (2026). A deep reinforcement learning-guided multimodal multi-objective evolutionary algorithm with a serial-parallel mechanism. ESWA, 298, 129581. (www)

  @article{ , abstract = {The core challenge for multimodal multi-objective problem (MMOP) resolution lies in maintaining synergistic interactions between convergence and diversity. However, the existing algorithms usually consider convergence-first, which neglect to consider both diversity and convergence into account during the evolutionary process. Likewise, the optimization methods tend to gravitate toward locally optimal regions rapidly, leading to lose diversity for the local PS. This paper proposes a Deep Reinforcement Learning-guided multimodal multi-objective evolutionary algorithm with a serial-parallel mechanism (DRLMMEA) to investigate the impact of different operator selection on the performance of MMEAs, which greatly helps to balance the convergence and diversity. DRLMMEA utilizes Q-Network to select the operator with the highest reward to enhance the population’s search ability. An improved sorting method (ISM) based on neighborhood dominance updates the population by sorting individuals according to their convergence quality, thereby enhancing convergence performance in the objective space. Moreover, this study proposes a series-parallel mechanism, a series structure enhances the diversity in the decision space, while the parallel structure reduces the computational burden of the algorithm evidently. The proposed Deep Reinforcement Learning-assisted operator selection mechanism, which enables effective balance between diversity and convergence, and an improved crowding distance approach that enhances convergence performance. DRLMMEA undergoes comprehensive testing against 6 contemporary approaches using MMF and IDMP benchmark problems, achieving supremacy in 4 principal performance metrics according to experimental findings. The multimodal gearbox parameter optimization is addressed using the proposed DRLMMEA, which demonstrates superior performance against 6 algorithms in comparative evaluations. It has demonstrated a significant role in solving the MMOPs with the imbalance between convergence and diversity.}, archive = {J_ESWA}, author = {Ying Huang and Xiaojian Cao and Benben Zhou and Wei Li and Shuling Yang and S.M. Shafi and Zhou Yang}, doi = {10.1016/j.eswa.2025.129581}, journal = {Expert Systems with Applications}, month = {3}, pages = {129581}, shortjournal = {Expert Syst. Appl.}, title = {A deep reinforcement learning-guided multimodal multi-objective evolutionary algorithm with a serial-parallel mechanism}, volume = {298}, year = {2026}, }
• (2026). Evolutionary multitasking optimization based on cross-task association mapping strategy. ESWA, 298, 129580. (www)

  @article{ , abstract = {In multitasking optimization, knowledge transfer between tasks through subspace generation has been widely employed to enhance the convergence performance of algorithms. However, this approach fails to account for the inter-task knowledge mapping relationships. Therefore, cross-task knowledge transfer during the optimization process remains inherently blind, potentially leading to mismatched subspace information and consequently degrading the algorithm’s performance. To address this issue, this paper proposes a multitask evolutionary algorithm based on an association mapping strategy and an adaptive population reuse mechanism, namely PA-MTEA. Specifically, to fully represent the correlations between multitask domains and enhance the adaptability of transfer solutions in target tasks, this paper introduces a subspace projection strategy based on partial least squares, which achieves the correlation mapping between the source and target tasks during the dimensionality reduction of the search space. Additionally, to further enhance knowledge transfer across tasks, an alignment matrix is obtained by adjusting the subspace Bregman divergence after deriving the respective subspaces, minimizing variability between task domains. Finally, to balance the global exploration of algorithms with local exploitation, an adaptive population reuse mechanism based on the residual structure is designed. This mechanism reuses historically successful individuals to guide the evolutionary direction of the population, thus improving the algorithm’s convergence performance. Experimental results on various benchmark suites and real-world cases demonstrate that PA-MTEA exhibits significantly superior performance compared to six other advanced multitask optimization algorithms.}, archive = {J_ESWA}, author = {Tao Yin and Lizhong Yao and Xin Zong and Pengjie Qin and Haoming Dong}, doi = {10.1016/j.eswa.2025.129580}, journal = {Expert Systems with Applications}, month = {3}, pages = {129580}, shortjournal = {Expert Syst. Appl.}, title = {Evolutionary multitasking optimization based on cross-task association mapping strategy}, volume = {298}, year = {2026}, }
• (2026). UniTask+: Exploring and unifying strong and weak task-aware consistency for semi-supervised blastocyst image segmentation. ESWA, 298, 129578. (www)

  @article{ , abstract = {The segmentation of different tissues within blastocysts is essential for embryologists to objectively observe and evaluate embryos, thereby contributing to a higher success rate of in vitro fertilization treatment. Inspired by the primary observation of skeletal patterns and boundary information by clinical doctors, we present an interesting task-aware view for blastocyst segmentation with semi-supervised learning, focusing on task-invariant and task-specific dependencies of segmentation. Firstly, we explore one strong-correlation task with bidirectional transformation between its outputs and the segmentation results, and another weak-correlation task with monodirectional transformation from segmentation maps. The correlation among different tasks inspires us to propose Task-Aware Smoothness (TAS) Assumption , thereby deducing different types of task-aware consistency. Then, a new Unified Task-aware Consistency Interaction (UniTask+) framework is developed to unify and fully take advantage of these strong, weak, and strong-to-weak task-aware consistency. It is comprised of a medical segmentation (MS) branch to implement segmentation and two extra branches performing strong/weak-correlation tasks based on the same backbone. Concretely, a level-set (LS) branch promotes the strong consistency while a point-set (PS) branch stimulates the weak consistency with underlying task perturbations. Numerous experiments have been conducted on the inner cell mass (ICM), blastocyst, proving the effectiveness of our tactics. Furthermore, we have also conducted experiments with datasets from the left atrium (LA), which shares similar structural features with embryos, to validate the robustness of the model. Our methods have shown prominent improvements over up-to-date SSL methods, which advocates our precedent hypothesis.}, archive = {J_ESWA}, author = {Hua Wang and Linwei Qiu and Jingfei Hu and Jicong Zhang}, doi = {10.1016/j.eswa.2025.129578}, journal = {Expert Systems with Applications}, month = {3}, pages = {129578}, shortjournal = {Expert Syst. Appl.}, title = {UniTask+: Exploring and unifying strong and weak task-aware consistency for semi-supervised blastocyst image segmentation}, volume = {298}, year = {2026}, }
• (2026). Deep asymmetric semantic hashing with probability shifting for multi-label image retrieval. ESWA, 298, 129577. (www)

  @article{ , abstract = {Deep hashing has been widely used in large-scale multimedia retrieval due to its advantages in terms of low storage cost and computational efficiency. Deep hashing algorithms can jointly learn semantic features and hash functions, encoding the original data into compact binary codes with significant discriminative power. However, in multi-label scenarios, especially when the number of samples is extremely large, a high negative-positive imbalance may occur, particularly when the proportion of negative samples is too high, which can lead to bias in the semantic relationships between the learned images. To solve this problem, symmetric losses such as focal loss were proposed, which treat positive and negative samples equally, but the retrieval results are suboptimal. This may be because the equal-weighted processing strategy causes the model to over-focus on hard negative samples and ignore the learning of positive sample features. Besides, mislabeled negative samples, especially those with a probability close to 1, can lead the model to learn incorrect features, harming its discrimination ability, reducing accuracy and recall, and causing overfitting and poor generalization. Accordingly, this paper proposes a novel hashing model, Deep Asymmetric Semantic Hashing with Probability Shifting framework (DASH-PS), for discriminative binary code learning. Specifically, by combining asymmetric focusing strategy and probability shifting strategy, asymmetric semantic loss is designed to solve negative-positive imbalance and ground-truth mislabeling. To keep the contribution of positive samples while focusing on hard negative samples, asymmetric focusing strategy is proposed to decouple negative and positive samples and assign different attenuation factors. By offsetting the probability of negative samples, probability shifting strategy completely discards easy negative samples and very hard negative samples suspected of being mislabeled. Additionally, an adaptive asymmetric learning mechanism is proposed to reduce the fixed difference in average probabilities between positive and negative samples, thereby simplifying hyperparameter selection and improving retrieval efficiency. Extensive experimental results on multiple benchmark datasets validate that our DASH-PS outperforms various state-of-the-art hashing methods. The code for the implementation of our DASH-PS framework is available at https://github.com/QinLab-WFU/DASH-PS.}, archive = {J_ESWA}, author = {Yongyue Fu and Qibing Qin and Jinkui Hou and Congcong Zhu and Lei Huang and Wenfeng Zhang}, doi = {10.1016/j.eswa.2025.129577}, journal = {Expert Systems with Applications}, month = {3}, pages = {129577}, shortjournal = {Expert Syst. Appl.}, title = {Deep asymmetric semantic hashing with probability shifting for multi-label image retrieval}, volume = {298}, year = {2026}, }
• (2026). Physics-informed tensor autoencoder with memory for video anomaly detection. ESWA, 298, 129576. (www)

  @article{ , abstract = {Video data can be naturally represented as tensors. Despite great progress in anomaly detection with memory-augmented autoencoders, the memory module therein can only handle vectors and inevitably breaks tensor structures, thus leading to performance degradation. Moreover, after the mapping of the encoder, some abnormal features may directly fall into the normal convex polytope, as autoencoders only use the output error to guide the construction of latent variables without imposing any constraint. The memory module can not handle these abnormal features, so that the abnormal observations may not be identified. To solve these problems, we propose a Physics-Informed Tensor AutoEncoder (PITAE) framework, which incorporates both neural networks and physical laws, i.e., tensor operation rules. Specifically, we design a tensor decomposition network followed by an explicit tensor operation to decompose the latent variable into low-rank and sparse components, and only the low-rank component is inputted to the decoder. In this way, we reserve the tensor structure and meanwhile impose a low-rank constraint on the latent variable, thereby compressing the features of normal samples into a ”smaller” region where anomalies are less likely to fall into. Consequently, the non-low-rank anomalies can be identified. But the low-rank anomalies may still not be identified. To further solve this problem, we design a tensor Memory module, and the overall model is named as PITAEM. Finally, based on the proposed framework, we design a novel composite anomaly score to identify anomalies of various kinds. Experiments on various video datasets demonstrate the effectiveness of the proposed method, especially in the small data regime.}, archive = {J_ESWA}, author = {Jianan Liu and Chunguang Li}, doi = {10.1016/j.eswa.2025.129576}, journal = {Expert Systems with Applications}, month = {3}, pages = {129576}, shortjournal = {Expert Syst. Appl.}, title = {Physics-informed tensor autoencoder with memory for video anomaly detection}, volume = {298}, year = {2026}, }
• (2026). A robust medical image encryption technique using inverse cosine chaotic map. ESWA, 298, 129574. (www)

  @article{ , abstract = {With the rapid proliferation of digital imaging technologies, the need for robust and lightweight image encryption techniques has become increasingly critical, particularly for medical, military, and personal data applications. In this paper, we propose a novel image encryption scheme based on a one-dimensional inverse cosine chaotic map (1D-ICC), which introduces a highly sensitive and structurally complex nonlinear dynamical system. The proposed method integrates a dynamic Josephus-based intra-block scrambling mechanism, a global zigzag permutation strategy, and an adaptive diffusion process guided by chaotic sequences, thereby enhancing the confusion and diffusion characteristics of the cipher. Unlike conventional approaches, our scheme dynamically derives the encryption key from the SHA-512 hash of the original image, ensuring both sensitivity to plaintext changes and resistance to known-plaintext and chosen-plaintext attacks. The use of the 1D-ICC map, featuring a tunable control parameter r 5 enables rich chaotic behavior even in one dimension, reducing computational complexity without sacrificing security. Comprehensive experiments validate the robustness and efficiency of the encryption scheme, with performance metrics including correlation coefficients below 0.003, information entropy of 7.9993, a Number of Pixels Change Rate (NPCR) of 99.61 %, and a Unified Averaged Changed Intensity (UACI) of 33.42 %. These results demonstrate that our method surpasses several existing techniques in both security strength and computational performance, underscoring the potential of the 1D-ICC map for practical image encryption applications.}, archive = {J_ESWA}, author = {Jackson J and Perumal R}, doi = {10.1016/j.eswa.2025.129574}, journal = {Expert Systems with Applications}, month = {3}, pages = {129574}, shortjournal = {Expert Syst. Appl.}, title = {A robust medical image encryption technique using inverse cosine chaotic map}, volume = {298}, year = {2026}, }
• (2026). Enhancing text classification with neural label embedding and weakly-supervised learning. ESWA, 298, 129569. (www)

  @article{ , abstract = {Recent years have witnessed the widespread adoption of deep-learning-based models in a range of linguistic tasks including the fundamental text classification. These deep neural networks, however, often face challenges due to the limited availability of large-scale training data with high-quality label annotations. Furthermore, while supervised learning has proven to be superior in training sentence representations for downstream tasks like text classification, this aspect has received relatively little attention. In this study, a novel model named L abel Em bedding joint with We akly-supervised C lassification ( LemWec ) is proposed, which aims to establish a unified framework by combining supervised sentence embedding with multiclass classification. For supervised sentence embeddings, the model incorporates seed information such as label names and designs an encoder network with a new pooling layer. Additionally, the model adopts a pseudo-labeling approach to leverage a substantial amount of unlabeled samples. This approach specifically addresses the drawback of generating pseudo-labels with the highest confidence and introduces a noise adaptation method to mitigate this issue. The results of extensive experiments conducted on four real-world datasets demonstrate that the proposed LemWec model can significantly enhance the performance of text classification when compared to a comprehensive set of baselines.}, archive = {J_ESWA}, author = {Xiao Jing and Zhe Li and Zhiang Wu and Dejun Mu}, doi = {10.1016/j.eswa.2025.129569}, journal = {Expert Systems with Applications}, month = {3}, pages = {129569}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing text classification with neural label embedding and weakly-supervised learning}, volume = {298}, year = {2026}, }
• (2026). Self-supervised ZINB-based kernel representation learning of single-cell RNA sequencing data. ESWA, 298, 129568. (www)

  @article{ , abstract = {Cell clustering plays a vital role in single-cell RNA sequencing (scRNA-seq) data analysis. Although many deep cell clustering methods have been proposed to cluster the scRNA-seq data, they overlook the structural partitioning objectives during the representation learning process, leading to challenges with non-linearly separable structures. In this paper, we present a novel end-to-end deep kernel cell clustering model for scRNA-seq data based on self-supervised ZINB-based kernel representation learning, named scDKC, which simultaneously learns cell kernel representations and identifies cell clusters. Specifically, a kernel-aid hybrid representation learning encoder is developed to effectively learn the separable kernel representation of cells, consisting of cells’ expression characteristics and cell-cell topological interactions. To guide the direction of kernel representation learning, a ZINB-based kernel representation learning decoder is designed by capturing the global probabilistic structure, the representation and the cell graph structure of the scRNA-seq data. By leveraging the clustering self-supervised strategy, representation self-supervised strategy, ZINB-based distribution self-supervised strategy, and kernel self-supervised strategy, scDKC optimizes cell cluster label assignment and learns cell kernel representations through a joint mutual self-supervised mechanism. Extensive experiments on 15 real scRNA-seq datasets, comparing scDKC with 10 competing methods, highlight its competitive advantages.}, archive = {J_ESWA}, author = {Lina Ren and Maoxuan Yao and Ruizhang Huang and Yongbin Qin}, doi = {10.1016/j.eswa.2025.129568}, journal = {Expert Systems with Applications}, month = {3}, pages = {129568}, shortjournal = {Expert Syst. Appl.}, title = {Self-supervised ZINB-based kernel representation learning of single-cell RNA sequencing data}, volume = {298}, year = {2026}, }
• (2026). A dual uncertainty-aware fusion framework for face expression recognition in the wild. ESWA, 298, 129567. (www)

  @article{ , abstract = {Facial Expression Recognition(FER) is a key task in the broader landscape of affective computing and human-computer interaction, enabling machines to interpret human emotions. To better learn discriminative features under complex facial variations, recent FER research has increasingly adopted multi-branch fusion architectures that aim to capture complementary features from diverse perspectives. However, existing multi-branch fusion strategies, including static weighting, simple concatenation, or uncertainty-aware modeling, lack the capacity to comprehensively capture and reconcile the reliability variations across both individual instances and structural branches. To overcome these limitations, we propose a novel multi-branch fusion strategy, named Dual Uncertainty-Aware Fusion Framework(DUAFF), which improves the discriminability of integrated features by simultaneously modeling instance-wise uncertainty and inter-branch correlations. Specifically, the proposed method comprises two complementary modules: Instance-Discrepant Uncertainty-Aware Fusion Module (ID-UAFM) and Branch-Discrepant Uncertainty-Aware Fusion Module (BD-UAFM). ID-UAFM is introduced to perform channel-wise entropy analysis between semantically distinct samples to estimate instance-level uncertainty, enabling selective channel-wise fusion that emphasizes reliable representations while suppressing uncertain responses. BD-UAFM is further proposed to capture structural uncertainty by evaluating the relative reliability of features across multiple branches and adaptively weighting their contributions based on inter-branch discrepancies. Experimental results demonstrate that the proposed DUAFF consistently outperforms POSTER across three benchmark datasets, achieving accuracy improvements of 0.23 % on RAF-DB, 0.69 % on FER2013, and 0.29 % on AffectNet (7-class), thereby confirming its effectiveness in enhancing the reliability and discriminability of facial representations.}, archive = {J_ESWA}, author = {Wenfeng Jiang and Ziyi Zhao and Lin Wang and Fang Liu and Chunmei Qing and Xiaofen Xing and Xiangmin Xu and Weiquan Fan and Zhanpeng Jin}, doi = {10.1016/j.eswa.2025.129567}, journal = {Expert Systems with Applications}, month = {3}, pages = {129567}, shortjournal = {Expert Syst. Appl.}, title = {A dual uncertainty-aware fusion framework for face expression recognition in the wild}, volume = {298}, year = {2026}, }
• (2026). Forecasting tourism stock index dynamics: A multiscale deep learning framework integrating emerging media data. ESWA, 298, 129566. (www)

  @article{ , abstract = {This study introduces a novel multiscale and multivariable deep learning framework for tourism stock index forecasting. To address the research gap concerning emerging media’s impact on the tourism sector, our study innovatively integrate multi-source data, including Douyin (China’s prominent short video platform), into our predictive model. Our methodology employs a multiscale decomposition strategy to streamline feature extraction complexity, coupled with an enhanced temporal convolutional network model incorporating soft-thresholding denoising to mitigate noise interference. Furthermore, we implement an adaptive differentiated prediction strategy to optimize model flexibility. Empirical analysis utilizing the CSI Tourism Stock Index demonstrates that our proposed model outperforms benchmark models in both predictive accuracy and stability, thereby validating its efficacy in tourism stock index forecasting.}, archive = {J_ESWA}, author = {Feng Shen and Shuai Huang and Wanqing Zhao and Dao Lan}, doi = {10.1016/j.eswa.2025.129566}, journal = {Expert Systems with Applications}, month = {3}, pages = {129566}, shortjournal = {Expert Syst. Appl.}, title = {Forecasting tourism stock index dynamics: A multiscale deep learning framework integrating emerging media data}, volume = {298}, year = {2026}, }
• (2026). Enhancing adversarial transferability through frequency-domain boundary samples tuning. ESWA, 298, 129565. (www)

  @article{ , abstract = {Transfer-based attacks evaluate the robustness of deep learning models and advance adversarial research to improve the security and reliability of deep learning and its applications. Previous efforts have improved the transferability through advanced gradients, augmented models, or augmented data. In this paper, we understand and enhance the transferability from a new perspective. Delving into intermediate features, we empirically find a difference between the distances of adversarial and original samples from cluster centers of the original classes. The adversarial samples are simultaneously far from both the original samples and the cluster centers, close to generalized decision boundaries. Based on this observation, we propose a novel spectrum tuning attack. Boundary samples are utilized to guide the generation of adversarial samples that are far away from the cluster centers. Specifically, randomized boundary samples are generated by frequency-domain transformations. With the gradients of the diverse boundary samples, the adversarial perturbation moves the examples away from cluster centers, thus approaching generalized decision boundaries. In the optimization process, conjugate directions are employed to avoid oscillations and stabilize the update direction. Given the strong Wolfe parameters, the analysis of the descent direction and current gradient further ensures the convergence speed and stability of the optimization. In addition, Gaussian preprocessing is introduced to smooth the update direction, further stabilize the direction and enhance the transferability. The proposed method is flexible enough to be combined with existing methods to further improve the transferability. Experiments conducted on the ImageNet-compatible dataset validate the effectiveness of the proposed method, e.g., 92.6 % success rate against nine defense methods.}, archive = {J_ESWA}, author = {Shuyan Cheng and Peng Li and Keji Han and Yangjun Xiong and He Xu and Ruchuan Wang}, doi = {10.1016/j.eswa.2025.129565}, journal = {Expert Systems with Applications}, month = {3}, pages = {129565}, shortjournal = {Expert Syst. Appl.}, title = {Enhancing adversarial transferability through frequency-domain boundary samples tuning}, volume = {298}, year = {2026}, }
• (2026). When graph anomaly breaks the coherence: A multi-evidence approach with language models. ESWA, 298, 129557. (www)

  @article{ , abstract = {Graph anomaly detection is critical in domains such as healthcare and economics, where identifying deviations can prevent substantial losses. However, current detection methods, primarily reliant on Graph Neural Networks (GNNs), suffer from a critical limitation: they make judgment on a single piece of evidence – the classification of learned node representations. This “single-verdict” approach is inherently susceptible to misjudgments arising from noisy or biased representations. To address this limitation, we introduce Multi-AD, a novel Multi-evidence-based graph Anomaly Detection framework that leverages the power of Language Models (LMs) to enable more robust and reliable anomaly detection. We provide a paradigm shift by constructing multiple evidence sequences for each target node, and employing LMs to assess the coherence of these sequences. By aggregating coherence scores across multiple sequences, Multi-AD leverages converging evidence to make more informed decisions about anomaly status as the presence of anomalous nodes disrupts coherence. Furthermore, we introduce a coherence-aware edge representation method to enhance the discriminative power of the constructed sequences and a multi-round adaptive integration strategy to handle challenging scenarios where normal nodes might be surrounded by anomalies. Extensive experiments demonstrate that Multi-AD consistently outperforms state-of-the-art methods.}, archive = {J_ESWA}, author = {Xuan Cheng and Jiahui Lu and Chunjing Xiao and Meiyi Yang and Meihui Zhong and Fan Zhou}, doi = {10.1016/j.eswa.2025.129557}, journal = {Expert Systems with Applications}, month = {3}, pages = {129557}, shortjournal = {Expert Syst. Appl.}, title = {When graph anomaly breaks the coherence: A multi-evidence approach with language models}, volume = {298}, year = {2026}, }
• (2026). Multimodal joint subspace model for parkinson’s disease diagnosis. ESWA, 298, 129556. (www)

  @article{ , abstract = {Parkinson’s disease (PD) is an irreversible neurodegenerative disorder that significantly impacts patients’ lives. Accurate early diagnosis prediction is crucial for providing timely treatment to delay disease progression. However, current diagnostic methods predominantly rely on the experience and judgment of clinicians, introducing subjectivity and a lack of standardized, quantitative measures. Sparse subspace learning, as a machine learning technique, can extract critical information from multimodal data while addressing issues such as noise, high-dimensional complexity, and class imbalance. Our study utilizes longitudinal, multimodal neuroimaging data collected at multiple time points to develop a diagnostic model for PD. The approach involves extracting latent local features and leveraging deep learning techniques to generate a comprehensive global feature subset. Adaptive sparse selection is employed to reduce feature redundancy. Finally, support vector machine is used for classification and regression tasks, specifically for PD diagnosis and disease progression score prediction. Extensive experiments were conducted on the PPMI dataset, achieving an accuracy of 90.78 % for Scan Without Evidence of Dopaminergic Deficit (SWEDD) vs. Normal Control (NC) classification, 83.79 % for PD vs. NC, and 91.50 % for PD vs. SWEDD. The results demonstrate that the proposed method improves PD classification and prediction performance, showing promise for early diagnostic applications.}, archive = {J_ESWA}, author = {Haojie Song and Haijun Lei and Yukang Lei and Zhongwei Huang and Jiaqiang Li and Tianfu Wang and Peng Yang and Baiying Lei}, doi = {10.1016/j.eswa.2025.129556}, journal = {Expert Systems with Applications}, month = {3}, pages = {129556}, shortjournal = {Expert Syst. Appl.}, title = {Multimodal joint subspace model for parkinson’s disease diagnosis}, volume = {298}, year = {2026}, }
• (2026). A spectral relevance analysis approach to pattern recognition of financial time series. ESWA, 298, 129555. (www)

  @article{ , abstract = {Understanding patterns in financial time series is crucial for improving prediction accuracy in algorithmic trading and risk management. This paper presents a novel AI-based computer vision approach for classifying financial time series. Historical price sequences are transformed into Gramian Angular Difference Field (GADF) images and fed into a convolutional neural network (CNN) for pattern recognition. To interpret the CNN’s decision-making process, we apply Spectral Relevance Analysis (SpRAy), enabling the identification of distinct clusters based on relevance maps. Clustering the images according to their relevance profiles reveals groups with significantly higher predictive performance compared to the full dataset. The corresponding relevance patterns highlight favorable price movement structures and are identified via the associated clusters.}, archive = {J_ESWA}, author = {Christine Distler and Yarema Okhrin and Jonathan Pfahler}, doi = {10.1016/j.eswa.2025.129555}, journal = {Expert Systems with Applications}, month = {3}, pages = {129555}, shortjournal = {Expert Syst. Appl.}, title = {A spectral relevance analysis approach to pattern recognition of financial time series}, volume = {298}, year = {2026}, }
• (2026). A novel object detection system for computer night vision images using residual 3D transformer-based YoloV8 with adaptive GRU in edge and cloud sector. ESWA, 298, 129554. (www)

  @article{ , abstract = {Object identification is one of the computer vision-based methods used in locating and labelling objects in images. Object detection has been greatly advanced as it is now applicable for detecting night vision images with great accuracy. Most accurate object detection at night can be useful in many applications like nighttime driving, regulating harsh traffic in harsh weather conditions, and surveillance. Object detection in normal conditions can be smoother, but low illumination and harsh weather can lead to low versatility. Images captured at night can reflect a lot of noise with low visual features. Due to its challenging nature, a highly effective object detection model is a challenge for high-level applications. Traditional models still face issues and challenges related to uneven light conditions, brightness variations, different light sources, and noisy backgrounds that need to be addressed. Thus, it is necessary to develop an object detection model for dealing with images with low illumination and varying light conditions. Hence, in this work, an effective object detection framework is implemented for night vision images. At first, from the standard datasets, the significant night vision images are fetched and fed into the proposed model as a Residual 3D Transformer-based YoloV8 with an Adaptive Gated Recurrent Unit (R3DT-YAGRU) for detecting the objects. This includes combining spatial–temporal modelling capabilities into YOLOv8, particularly using 3D transformers for improved feature extraction and an adaptive GRU to manage temporal dependencies at night. Here, the Modified Random Variable-based Dollmaker Optimization Algorithm (MRV-DOA), which is a metaheuristic algorithm motivated by the doll-making procedure. Also, it helps in balancing the exploration phase and exploitation phase to discover the best solutions and is used for tuning the parameters of the R3DT-YAGRU model. At last, the experimental validation is carried out for the recommended object detection process by comparing with other models to establish the supremacy of the suggested work. From the study, the suggested framework achieves an accuracy of 96%, leading to enhanced decision making and better accuracy than other conventional models. The work has prepared its implementation accessible at https://github.com/charlesvprabhu56/Object-Detection .}, archive = {J_ESWA}, author = {V.Charles Prabu and Queen Mary Vidya. M and V. Sathiyamoorthi and P. Durgadevi and M. Gowthami}, doi = {10.1016/j.eswa.2025.129554}, journal = {Expert Systems with Applications}, month = {3}, pages = {129554}, shortjournal = {Expert Syst. Appl.}, title = {A novel object detection system for computer night vision images using residual 3D transformer-based YoloV8 with adaptive GRU in edge and cloud sector}, volume = {298}, year = {2026}, }
• (2026). Learning diversified features for pulmonary hypertension detection using chest X-ray. ESWA, 298, 129553. (www)

  @article{ , abstract = {Compared to traditional Computed Tomography (CT) scans and floatation catheters, chest X-ray offers an efficient, safe and timely examination paradigm, with broader range of scenarios (including intensive care units), for the detection of Pulmonary Arterial Hypertension (PAH). However, it is difficult to learn the variable radiological features of PAH from X-rays due to its low resolution and low contrast. To address the above issues, we propose a diversified features learning framework to fully explore the PAH-related representation from chest X-ray. We first employ a Chest Feature Enhancement Attention (CFEA) module to enhance the initial feature representation. Then, we employ the Deep Temporal Anti-Interference Metric Learning (TAIML) module to fully explore the PAH-related features. We incorporate the information on the temporal evolution of patients’ conditions. Specifically, a patient x , after undergoing treatment, may exhibit two possible states: x + (ill) and x − (cured). Therefore, we can define the distance d ( x , x + ) as the intra-class structural distance, and the distance d ( x , x − ) as the inter-class safe distance. Unlike existing metric learning, we adopt a new strategy: we push positive samples towards negative samples, but ensure distance between them is no less than d ( x , x − ) , thereby enhancing intra-class diversity while maintaining discriminability. Meanwhile, we ensure that the distance between positive samples is greater than d ( x , x + ) , thereby preserving the intra-class structure. Through these two steps, we can learn a diversified but discriminative representation of PAH. Comprehensive experiments showed the our model achieved an impressive accuracy of 86.27 % and an AUC of 0.857 in identifying PAH patients. The code is available at https://github.com/zgfdmn/PAH .}, archive = {J_ESWA}, author = {Chengjin Yu and Huanghui Wang and Yuanting Yan and Zhuyang Chu and Dongsheng Ruan}, doi = {10.1016/j.eswa.2025.129553}, journal = {Expert Systems with Applications}, month = {3}, pages = {129553}, shortjournal = {Expert Syst. Appl.}, title = {Learning diversified features for pulmonary hypertension detection using chest X-ray}, volume = {298}, year = {2026}, }
• (2026). TriHAtt-BERT-DBiLSTM: Deep learning model for medical emergency prediction from the unstructured data. ESWA, 298, 129552. (www)

  @article{ , abstract = {In recent years, the emergency triage has faced several challenges, including insufficient manual triage with physicians, limited medical resources contributing to incorrect triage, overcrowding in the emergency department (ED), and extended patient waiting time. Hence, the Medical Emergency prediction remains the major research area that identifies emergencies about specific diseases using the Medical Transcriptions (MT) provided by physicians. However, the existing methods face the challenges of handling the ambiguity of words, unstructured data, and increased computation complexity. Consequently, this research proposes the Tri-Head Attention-based Bidirectional Encoder Representations from Transformers enabled Distributed Bidirectional Long-Short Term Memory (TriHAtt-BERT-DBiLSTM) for predicting medical emergencies. Specifically, the proposed approach integrates the Tri-Head Attention mechanisms into BERT, which is further hybridized with the DBiLSTM model that offers the synergic strength of providing the dense feature representations to capture the complex dependencies, and enhancement of model ability with the structured parameters to facilitate the medical emergency prediction. Besides, the utilization of BERT in the proposed approach assists in capturing more complex language representations and further executes a better embedding representation of words. The TriHAtt-BERT-DBiLSTM model surpasses other state-of-the-art techniques and achieves 96.40% of accuracy, 96.12% of F1-score, 96.09% of precision, and 96.15% of recall for medical emergency prediction.}, archive = {J_ESWA}, author = {Amita Mishra and Sunita Soni}, doi = {10.1016/j.eswa.2025.129552}, journal = {Expert Systems with Applications}, month = {3}, pages = {129552}, shortjournal = {Expert Syst. Appl.}, title = {TriHAtt-BERT-DBiLSTM: Deep learning model for medical emergency prediction from the unstructured data}, volume = {298}, year = {2026}, }
• (2026). System-level integration of deep learning and computer vision for contact ring seal defect detection in semiconductor manufacturing. ESWA, 298, 129551. (www)

  @article{ , abstract = {The contact ring seals (CRSs) used in electroplating processes during semiconductor manufacturing are susceptible to degradation through chemical etching, electrochemical dissolution, and mechanical wear mechanisms. Despite the implementation of state-of-the-art surface treatment and coating technologies to mitigate CRS corrosion, manual intervention remains frequently required to address this problem. Conventional static defect detection systems for CRSs rely on predefined regions of interest (ROIs) and threshold-based defect area calculations, with surface anomalies identified by comparing the percentage of defective areas within these ROIs. However, this approach exhibits detection failures for millimeter-scale defects, low-contrast anomalies, and geometrically irregular patterns, especially under complex or dynamic environmental conditions. To address these systematic detection failures, we developed a dynamic defect detection system for CRSs by integrating artificial intelligence and traditional computer vision algorithms, achieving a 5.2x improvement in defect detection sensitivity. This system achieved detection accuracy and recall values of over 99 % as well as a response time of 1.43 s average latency, thereby demonstrating a substantial performance improvement compared to a static system, which achieved a recall rate of 18.9 % on the adopted dataset. The system satisfies real-time processing requirements while substantially reducing the need for manual intervention in defect detection and increases production efficiency. Finally, the experimental results of this study indicated that the postprocessing approaches used in the developed system enabled it to flexibly adapt to the different requirements of various production environments.}, archive = {J_ESWA}, author = {Ting-Han Chen and Hsin-Hung Chou and Shuang Zou and Yu-Han Chen and Sun-Yuan Hsieh}, doi = {10.1016/j.eswa.2025.129551}, journal = {Expert Systems with Applications}, month = {3}, pages = {129551}, shortjournal = {Expert Syst. Appl.}, title = {System-level integration of deep learning and computer vision for contact ring seal defect detection in semiconductor manufacturing}, volume = {298}, year = {2026}, }
• (2026). Complementary information-guided interactive fusion network for HSI and LiDAR data joint classification. ESWA, 298, 129549. (www)

  @article{ , abstract = {The classification of land remote sensing using single-modal data has reached a bottleneck, which has spurred significant interest in the joint utilization of multimodal remote sensing data to enhance classification performance. However, existing methods exhibit limitations in extracting intricate local and global features. Furthermore, achieving effective information interaction and deep fusion between multimodal datasets remains an unresolved challenge. To address these issues, we propose a Complementary Information-Guided Interactive Fusion Network (CIGIF-Net) for the classification of hyperspectral image (HSI) and light detection and ranging (LiDAR) data. The core idea of our approach leverages the capability of Convolutional Neural Networks (CNNs) to extract local spatial features while utilizing the strengths of Transformers in modeling long-range dependencies. Furthermore, our method facilitates deep fusion by designing mechanisms for the interactive integration of multimodal local spatial features, complemented by guidance from multimodal data during long-range dependency modeling, thereby improving overall classification performance. Specifically, CIGIF-Net incorporates multiscale feature learning, interactive feature fusion, and the complementary information-guided attention mechanism. Initially, CNNs are used to learn multiscale local spatial features. Subsequently, we perform an interactive fusion of multimodal spatial information based on channel attention techniques. Finally, the complementary information-guided attention mechanism dynamically utilizes complementary insights to inform deeper attention distributions, which guide global feature construction and enable efficient information aggregation. This methodology allows for the comprehensive extraction and synergistic utilization of complementary information across multimodal datasets. Extensive experiments conducted on three widely recognized HSI and LiDAR datasets demonstrate that the proposed CIGIF-Net achieves superior classification performance.}, archive = {J_ESWA}, author = {Shufang Xu and Qiyuan Xue and Zhonghao Chen and Shuyu Fei and Hongmin Gao}, doi = {10.1016/j.eswa.2025.129549}, journal = {Expert Systems with Applications}, month = {3}, pages = {129549}, shortjournal = {Expert Syst. Appl.}, title = {Complementary information-guided interactive fusion network for HSI and LiDAR data joint classification}, volume = {298}, year = {2026}, }
• (2026). GPT–empowered question–answer dataset for informative and empathetic support for korean childhood cancer survivors. ESWA, 298, 129548. (www)

  @article{ , abstract = {Despite improvements in survival rates, childhood cancer survivors in South Korea still face significant challenges in accessing the psychological and informational support they need. To address these challenges, we developed the Korean Childhood Cancer Survivor Question-Answer (KCCSQA) dataset in which contains 3876 question-answer pairs. The questions were sourced from websites, academic articles, and an online survey, where 119 childhood cancer survivors contributed 1283 questions. We used GPT-4 Turbo to generate the responses, followed by an expert evaluation by 11 specialists to ensure factual accuracy, complementarity, comprehensibility, and empathy. The overall quality of the GPT-generated responses was rated 4.98 out of 6, indicating a high level of quality. To enhance the dataset, we integrated a relational knowledge graph to mitigate hallucinations in the AI-generated answers, achieving a performance of 0.979 in hallucination detection. Additionally, a pseudo-scoring system was implemented for continuous quality assessment. The dataset’s effectiveness was evaluated through a pilot study involving 14 childhood cancer survivors, who interacted with a retrieval-based QA system using a single-turn chatbot format. The mean satisfaction rating was 4.36 on a 6-point Likert scale, and all participants expressed a willingness to use the system again.}, archive = {J_ESWA}, author = {Kyubum Hwang and Mirae Kim and Min Ah Kim and Chaerim Park and Yehwi Park and Chungyeon Lee and Jooyoung Lim and Hayoung Oh}, doi = {10.1016/j.eswa.2025.129548}, journal = {Expert Systems with Applications}, month = {3}, pages = {129548}, shortjournal = {Expert Syst. Appl.}, title = {GPT–empowered question–answer dataset for informative and empathetic support for korean childhood cancer survivors}, volume = {298}, year = {2026}, }
• (2026). A decision support system for open-pit mining optimisation with dynamic uncertainty and GPU-based parallel repair approach. ESWA, 298, 129544. (www)

  @article{ , abstract = {This paper presents an advanced Decision Support System (DSS) for long-term open-pit mine planning that integrates established optimization techniques—Large Neighborhood Search (LNS), Simulated Annealing (SA), and Dantzig-Wolfe decomposition—within a novel GPU-accelerated framework addressing geological uncertainty and computational complexity. The key methodological contributions include dynamic uncertainty modelling with time-dependent factors capturing geological confidence degradation and GPU-parallelized evaluation architecture enabling industrial-scale mine planning. Validation using 50,000 blocks across 10 geological scenarios demonstrates robust economic performance, achieving mean NPV of $1.514 billion with limited variability (standard deviation $16 million). The GPU-parallelized architecture achieves 29.6 % average computational speedup with peaks of 37 % compared to CPU implementations, enabling concurrent evaluation of 262,144 mining scenarios. Risk analysis reveals P90 Value-at-Risk of $1.488 billion, indicating strong downside protection. The system maintains profit margins exceeding 95 % across all scenarios with cumulative cash flow reaching $1.789.4 million by period 6. Narrow risk envelopes (P10-P90 spread <$60 M) demonstrate robust performance under uncertainty, providing mining companies with practical tools for risk-informed strategic decision-making.}, archive = {J_ESWA}, author = {Iman Rahimi}, doi = {10.1016/j.eswa.2025.129544}, journal = {Expert Systems with Applications}, month = {3}, pages = {129544}, shortjournal = {Expert Syst. Appl.}, title = {A decision support system for open-pit mining optimisation with dynamic uncertainty and GPU-based parallel repair approach}, volume = {298}, year = {2026}, }
• (2026). TriHID: Towards verifiable domain adaptation-based IoT intrusion detection in heterogeneous environment. ESWA, 298, 129543. (www)

  @article{ , abstract = {With the widespread deployment of IoT devices in daily applications, securing them against intrusions has become increasingly critical. Domain adaptation (DA)-based intrusion detection is a promising approach that transfers knowledge from a source domain to improve detection in a target IoT domain. However, effective DA methods must address various types of domain heterogeneity - such as differences in feature representation, intrusion distribution, and attack strategies. Existing intrusion detection datasets rarely consider these aspects, limiting their utility for evaluating heterogeneous DA approaches. To bridge this gap, we introduce TriHID , a new dataset specifically designed to capture heterogeneities from three perspectives. We evaluate four types of DA-based IoT intrusion detectors - multi-source, semi-supervised, unsupervised, and open-set on TriHID. Experimental results demonstrate that TriHID enables robust training and comprehensive evaluation of DA-based intrusion detection methods in heterogeneous IoT settings.}, archive = {J_ESWA}, author = {Jiashu Wu and Yang Wang}, doi = {10.1016/j.eswa.2025.129543}, journal = {Expert Systems with Applications}, month = {3}, pages = {129543}, shortjournal = {Expert Syst. Appl.}, title = {TriHID: Towards verifiable domain adaptation-based IoT intrusion detection in heterogeneous environment}, volume = {298}, year = {2026}, }
• (2026). Multi-objective dynamic flexible job shop scheduling using multi-head network-based deep reinforcement learning. ESWA, 298, 129542. (www)

  @article{ , abstract = {In modern manufacturing environments, job shop scheduling systems are characterized by heightened complexity and ever-changing dynamics, often involving multi-objective optimization and the need to accommodate unanticipated events like new job insertions and uncertain machine availability, underscores the necessity for effective real-time multi-objective scheduling approaches. Therefore, to tackle the multi-objective dynamic flexible job shop scheduling problem (MODFJSP) involving new job insertions, this paper introduces an online scheduling framework called multi-head deep Q network (MHDQN), designed to simultaneously minimize both total tardiness and total machine idle time. The core architecture of MHDQN framework is an innovative multi-head network agent based on Dueling deep Q network (Deuling DQN), consisting of a shared network layer and objective-specific network layers. The shared network layer extracts and transforms the input global state features layer by layer, generating a high-dimensional, semantically rich shared feature. This provides a unified input foundation for the objective-specific network layers, which are responsible for extracting the specialized information related to each objective from the shared features and calculating the corresponding Q -values, thereby enabling the parallel optimization of each objective. Six combined scheduling rules are developed to form the action set, each incorporating both job and machine selection. An improved multi-objective action selection strategy is proposed, incorporating inverse sigmoid ϵ decay and Q -value maximum absolute (max-abs) normalization to optimize decision-making. Additionally, a multi-head network training mechanism leveraging the Double deep Q network (Double DQN) architecture has been developed. Extensive computational experiments demonstrate that the MHDQN outperforms widely used traditional scheduling rules, multi-objective metaheuristic algorithms, and other reinforcement learning (RL) based scheduling methods, showing significant advantages and strong generalizability in multi-objective optimization tasks.}, archive = {J_ESWA}, author = {Kai Li and Bao Zheng and Liping Xu and Fulong Xie and Zhicheng Wang}, doi = {10.1016/j.eswa.2025.129542}, journal = {Expert Systems with Applications}, month = {3}, pages = {129542}, shortjournal = {Expert Syst. Appl.}, title = {Multi-objective dynamic flexible job shop scheduling using multi-head network-based deep reinforcement learning}, volume = {298}, year = {2026}, }
• (2026). A possibilistic programming approach in an integrated fuzzy periodic review model and clustering strategy for optimizing platelet supply chain. ESWA, 298, 129539. (www)

  @article{ , abstract = {Managing platelet supply chains poses significant challenges due to the product’s short shelf life, highly uncertain demand, and the critical nature of its medical use. Previous studies in the blood supply chain rely on fixed-order quantities and ignore collaborative inventory-sharing strategies, which can lead to either excessive waste or severe shortages. However, in many real-world situations, fixed order quantities are often insufficient to accommodate fluctuating demand, especially in healthcare systems. Moreover, existing distribution models in the literature often overlook the equitable allocation of services across hospitals, leading to disparities in access to critical healthcare resources. This study proposes a novel two-phase decision-making framework that integrates a fuzzy periodic review inventory model with a cluster-based reactive transshipment strategy to optimize platelet supply and distribution. In Phase I, a fuzzy periodic review model determines optimal order quantities under uncertain demand using a possibilistic chance-constrained programming approach. In Phase II, hospitals are clustered based on service levels, enabling equitable transshipment among facilities to reduce disparities and improve overall responsiveness. A real-world case study from Tehran province is used to evaluate the model’s effectiveness. Results show an approximate 6% reduction in total shortages and a 2% improvement in average service levels. The proposed framework offers actionable insights for healthcare managers aiming to enhance resilience, equity, and efficiency in critical medical supply chains.}, archive = {J_ESWA}, author = {Seyyed-Mahdi Hosseini-Motlagh and Mohammad Reza Ghatreh Samani and Hannaneh Kordhaghi}, doi = {10.1016/j.eswa.2025.129539}, journal = {Expert Systems with Applications}, month = {3}, pages = {129539}, shortjournal = {Expert Syst. Appl.}, title = {A possibilistic programming approach in an integrated fuzzy periodic review model and clustering strategy for optimizing platelet supply chain}, volume = {298}, year = {2026}, }
• (2026). Deep-insights guided evolutionary algorithm for optimization. ESWA, 298, 129538. (www)

  @article{ , abstract = {Evolutionary algorithms (EAs) are a class of optimization algorithms inspired by the theory of biological evolution. They solve optimization problems by emulating the processes of natural selection. EAs produce abundant data during evolution, which contains valuable information that reflects their evolutionary patterns. Effectively utilizing this information can enhance the algorithms’ effectiveness and efficiency. Deep learning excels at extracting knowledge from data. Inspired by this, we propose a novel insights-infused framework that utilizes deep neural networks to learn the evolutionary processes of EAs and extract useful synthesis insights from the evolutionary data. These synthesis insights not only guide the algorithm to evolve in a better direction on the original problems, but also improve its performance on new problems. The choice of neural networks is important. During pre-training, to reduce the inductive bias introduced by human prior knowledge, we design an MLP model to process the data. Additionally, we develop a variable-length encoding method to enable MLP networks to handle variable-length data. To verify the transfer evolution ability of synthesis insights, we devise a self-evolution strategy that fine-tunes the network using only the data generated by the algorithm itself, without introducing any external knowledge, when dealing with new problems. Experimental results demonstrate that the synthesis insights extracted from the CEC2014 dataset guide the algorithms to evolve in a better direction for the CEC2014 problems, and in addition enhance their performance on new problems like CEC2017, CEC2022 and the real-world optimization problems.}, archive = {J_ESWA}, author = {Kun Bian and Juntao Zhang and Hong Han and Jun Zhou and Yifei Sun and Shi Cheng}, doi = {10.1016/j.eswa.2025.129538}, journal = {Expert Systems with Applications}, month = {3}, pages = {129538}, shortjournal = {Expert Syst. Appl.}, title = {Deep-insights guided evolutionary algorithm for optimization}, volume = {298}, year = {2026}, }
• (2026). MambaGen: Efficient visual representation learning for automatic radiology report generation. ESWA, 298, 129537. (www)

  @article{ , abstract = {Radiology report generation focuses on producing comprehensive and clinically precise medical reports based on radiographic images, thereby improving medical efficiency and alleviating the burden on radiologists. Although existing deep learning methods have demonstrated superior performance, they are constrained by the local receptive field of convolutional neural networks and are inadequate for modeling long-range dependencies, making it challenging to detect critical lesion features in medical images. Recently, State Space Models (SSMs), particularly Mamba, have shown great potential in modeling long-range dependencies with linear computational complexity. Inspired by this, we propose MambaGen, the enhanced Mamba model specifically designed for radiology report generation tasks. Specifically, we design a Mamba-Visual Recalibration Module (MVRM), which utilizes a two-stage training strategy to effectively capture the efficient visual representation of medical images. This first stage combines convolutional layers with SSMs to model long-sequence dependencies and learn multi-level visual feature information. This second stage introduces local convolution and a channel attention mechanism to further recalibrate the local feature and mitigate channel redundancy. Comprehensive experiments on widely available datasets, such as IU X-Ray and MIMIC-CXR, demonstrate our model’s superior performance compared to existing methods, particularly with an improvement of 2.7 % on the BLEU-4 metric. The code is available at https://github.com/Eleanorhxd/MambaGen.git .}, archive = {J_ESWA}, author = {Xiaodi Hou and Xiaobo Li and Simiao Wang and Mingyu Lu and Hongfei Lin and Yijia Zhang}, doi = {10.1016/j.eswa.2025.129537}, journal = {Expert Systems with Applications}, month = {3}, pages = {129537}, shortjournal = {Expert Syst. Appl.}, title = {MambaGen: Efficient visual representation learning for automatic radiology report generation}, volume = {298}, year = {2026}, }
• (2026). Multistep diesel vehicle emissions forecasting with an efficient transformer enhanced by temporal-frequency fusion and covariate interaction. ESWA, 298, 129532. (www)

  @article{ , abstract = {Controlling nitrogen oxide (NO x ) emissions from diesel vehicles is a critical environmental challenge. Advanced SCR strategies depend on accurate multistep forecasting of NO x and ammonia (NH 3 ), but existing models often struggle with error accumulation and the non-stationary dynamics of emissions data. In this work, we first establish a new benchmark for this task, confirming that handling data non-stationarity is essential for robust prediction. Building on this insight, we propose FiTformer, a novel Transformer architecture that adopts an encoder-only framework to jointly forecast both NO x and NH 3 concentrations, where we introduce Intra-series Temporal-Frequency Fusion mechanism to capture intrinsic emissions dynamics and Inter-series Covariate Interaction mechanism to model external influences. Validated on real-world engine data, FiTformer consistently outperforms baseline models across all evaluated prediction horizons, with up to 44.1 % MAE and 36.9 % SMAPE reductions in 24-step NO x prediction and similarly strong gains for NH 3 prediction, compared to the state-of-the-art baseline TimesNet. Its high computational efficiency (0.30G MACs and 8.3 ms/iter) along with robust generalization and high resilience to data imperfections, underscores its suitability for real-time embedded SCR control, enabling more effective strategies for NO x reduction and NH 3 slip minimization.}, archive = {J_ESWA}, author = {Yuhan Luo and Yujun Zhang and Ying He and Kun You and Wei Huang and Wenqing Liu and Hao Xie}, doi = {10.1016/j.eswa.2025.129532}, journal = {Expert Systems with Applications}, month = {3}, pages = {129532}, shortjournal = {Expert Syst. Appl.}, title = {Multistep diesel vehicle emissions forecasting with an efficient transformer enhanced by temporal-frequency fusion and covariate interaction}, volume = {298}, year = {2026}, }
• (2026). An EEG-based dual-stream spatial-spectral-temporal large model for self-limited epilepsy with centrotemporal spikes. ESWA, 298, 129530. (www)

  @article{ , abstract = {Self-limited epilepsy with centrotemporal spikes (SeLECTS) is the most common form of focal epilepsy in childhood, accounting for 20–25 % of all childhood epilepsy cases and may be associated with cognitive dysfunction and behavioral issues. Accurate detection and assessment of epileptic discharges in EEG signals, particularly the spike-wave index (SWI), are crucial for timely intervention and treatment. Manual analysis of EEG data is labor-intensive and prone to errors, underscoring the need for automated methods. In the present study, we propose a novel D ual-Str e am Sp a tial- S pectral- T emporal L arge model (DeaSTL) that leverages a large-scale EEG architecture to effectively capture the multidimensional characteristics of EEG signals associated with SeLECTS syndrome. Our model integrates multi-view temporal representations and spatial-spectral representations through a dual-stream approach, enhancing the learning of complex patterns in EEG data. We introduce the S JTU Se L ECTS E EG D ataset (SLED), a comprehensive EEG dataset from 212 patients diagnosed with SeLECTS, including annotations for abnormal discharge detection, wake-sleep period classification, and SWI estimation. Addressing the previously unexplored problem of SWI prediction, we provide a novel method for quantifying the severity of epileptic discharges during sleep. Extensive experiments demonstrate that our DeaSTL model significantly outperforms several state-of-the-art methods across multiple tasks, showcasing its potential for clinical application in assisting diagnosis and treatment planning.}, archive = {J_ESWA}, author = {Lin Zhang and Yun Ren and Fang Yuan and Xuqin Chen and Shikui Tu and Lei Xu}, doi = {10.1016/j.eswa.2025.129530}, journal = {Expert Systems with Applications}, month = {3}, pages = {129530}, shortjournal = {Expert Syst. Appl.}, title = {An EEG-based dual-stream spatial-spectral-temporal large model for self-limited epilepsy with centrotemporal spikes}, volume = {298}, year = {2026}, }
• (2026). Dynamic learning of sample ambiguity-driven sample weighting for medical image classification. ESWA, 298, 129527. (www)

  @article{ , abstract = {Deep neural networks have delivered impressive results in medical image classification tasks. However, their performance is still challenging in medical scenarios with limited data, where training set biases such as label noise or class imbalance impede model learning. Dynamic learning based sample weighting achieves adaptive adjustment of sample importance through learnable weight functions and shows great potential in improving model robustness. Nevertheless, existing methods directly employ model states such as loss value or training accuracy to evaluate sample importance, ignoring the role of ambiguous samples in model optimization. This limitation hinders the performance of dynamic learning based sample weighting in medical image classification. In this paper, we propose a new sample weighting approach based on sample ambiguity and dynamic learning for improving medical image classification, named DLSA-SW. We introduce a dual-space sample ambiguity method by evaluating the category proximity in the feature space and the prediction confidence in the label space. Subsequently, to dynamically calculate sample weights according to sample ambiguity, a learnable sample weighting network is developed to adaptively adjust the weights during training to guide the task model. DLSA-SW performs alternate optimization to enable mutual adaptation of the sample weighting network and the task network. We evaluate the effectiveness of our approach on three medical image classification benchmarks: PatchCamelyon for lymph node histopathology classification, ISIC 2020 for skin lesion classification, and MTC for medullary thyroid cancer classification. DLSA-SW outperforms existing state-of-the-art sample weighting methods on all three datasets and yields substantial improvements over methods without sample weighting. These results demonstrate the robustness and practical applicability of our approach in clinical diagnostic tasks.}, archive = {J_ESWA}, author = {Guanxiu Yi and Xiabi Liu and Ling Ma and Mengqiao Han and Lijuan Niu}, doi = {10.1016/j.eswa.2025.129527}, journal = {Expert Systems with Applications}, month = {3}, pages = {129527}, shortjournal = {Expert Syst. Appl.}, title = {Dynamic learning of sample ambiguity-driven sample weighting for medical image classification}, volume = {298}, year = {2026}, }
• (2026). LST-rPPG: A long-range spatio-temporal model for high-accuracy heart rate variability measurement. ESWA, 298, 129526. (www)

  @article{ , abstract = {Remote photoplethysmography (rPPG) is a non-contact manner of measuring heart rate variability (HRV) by deriving blood volume pulse (BVP) signals from facial videos. The performance of rPPG-based HRV measurement is challenging due to short-range noises (e.g., head movements) suppression and sufficient-duration BVP signal generation. Recent Transformer-based rPPG methods have shown advantages of global spatio-temporal feature modeling in eliminating noise and recovering high-quality BVP signals. However, these methods often face significant computational and memory constraints, limiting duration scalability of the generated BVP signals that might decrease HRV measurement performance. To address the above issue, this paper proposes a duration-scalable Transformer-based rPPG method, capable of global Long-range Spatio-Temporal modelling (LST), termed LST-rPPG, to generate high-quality BVP signals with a much longer duration. On the one hand, by employing spatial and temporal encoders, the original image-based rPPG issue is converted to a time-series problem. Besides, a sparse computation mechanism is integrated into the temporal encoder. This combination allows LST-rPPG to recover flexible-duration BVP signals, supporting continuous modeling of segments beyond 30 s with low computation and memory overhead. On the other hand, a dynamic loss function with stringent temporal constraints is designed to guarantee the quality of the generated BVP signals. Comprehensive experiments are performed on two public datasets, PURE and UBFC-RPPG, and the results demonstrate the feasibility of LST-rPPG for generating high-quality BVP signals with a much longer duration while requiring substantially fewer computational resources. Besides, LST-rPPG achieves at least the second-best results during all experiments.}, archive = {J_ESWA}, author = {Jiajie Li and Juan Cheng and Rencheng Song and Yu Liu}, doi = {10.1016/j.eswa.2025.129526}, journal = {Expert Systems with Applications}, month = {3}, pages = {129526}, shortjournal = {Expert Syst. Appl.}, title = {LST-rPPG: A long-range spatio-temporal model for high-accuracy heart rate variability measurement}, volume = {298}, year = {2026}, }
• (2026). A novel scheme integrating graph-based analysis and opposition-based learning for S-box optimization by population-based metaheuristics. ESWA, 298, 129524. (www)

  @article{ , abstract = {The non-linearity of symmetric block cryptographic algorithms, which is crucial for resisting linear and differential cryptanalysis, depends on the design of substitution boxes. This work proposes a novel scheme, named GOM, combining opposition-based learning with graph-based representation to be integrated into three population-based metaheuristics. This scheme is applied to address the 8 × 8 S-box design problem. The GOM-enhanced metaheuristics improve population diversity and convergence, achieving a non-linearity of 112. Hardware simulations indicate that GOM-based designs require similar resources to AES, while side-channel evaluations confirm their resilience against power analysis attacks. Scalability is supported by successful results on 10 × 10 and 12 × 12 S-boxes. The design of GOM, leveraging generalizable components such as opposition-based learning and graph-based representations, suggests its potential applicability to other population-based metaheuristics and optimization problems.}, archive = {J_ESWA}, author = {Francisco González and Ricardo Soto and José M. Lanza-Gutiérrez and Broderick Crawford}, doi = {10.1016/j.eswa.2025.129524}, journal = {Expert Systems with Applications}, month = {3}, pages = {129524}, shortjournal = {Expert Syst. Appl.}, title = {A novel scheme integrating graph-based analysis and opposition-based learning for S-box optimization by population-based metaheuristics}, volume = {298}, year = {2026}, }
• (2026). Functional consistency of LLM code embeddings: A self-evolving data synthesis framework for benchmarking. ESWA, 298, 129523. (www)

  @article{ , abstract = {Embedding models have demonstrated strong performance in tasks like clustering, retrieval, and feature extraction while offering computational advantages over generative models and cross-encoders. Benchmarks such as MTEB have shown that text embeddings from large language models (LLMs) capture rich semantic information, but their ability to reflect code-level functional semantics remains unclear. Existing studies largely focus on code clone detection, which emphasizes syntactic similarity and overlooks functional understanding. In this paper, we focus on the functional consistency of LLM code embeddings, which determines if two code snippets perform the same function regardless of syntactic differences. We propose a novel data synthesis framework called Functionality-Oriented Code Self-Evolution to construct diverse and challenging benchmarks. Specifically, we define code examples across four semantic and syntactic categories and find that existing datasets predominantly capture syntactic properties. Our framework generates four unique variations from a single code instance, providing a broader spectrum of code examples that better reflect functional differences. Extensive experiments on three downstream tasks-code clone detection, code functional consistency identification, and code retrieval-demonstrate that embedding models significantly improve their performance when trained on our evolved datasets. These results highlight the effectiveness and generalization of our data synthesis framework, advancing the functional understanding of code.}, archive = {J_ESWA}, author = {Zhuohao Li and Wenqing Chen and Jianxing Yu and Zhichao Lu}, doi = {10.1016/j.eswa.2025.129523}, journal = {Expert Systems with Applications}, month = {3}, pages = {129523}, shortjournal = {Expert Syst. Appl.}, title = {Functional consistency of LLM code embeddings: A self-evolving data synthesis framework for benchmarking}, volume = {298}, year = {2026}, }
• (2026). Semisupervised graph U-net with G-ConvLSTM for hyperspectral image classification. ESWA, 298, 129522. (www)

  @article{ , abstract = {Graph convolutional networks (GCNs) have demonstrated the effectiveness for hyperspectral image (HSI) classification, but still face challenges, such as insufficient exploitation of data structure information, limited labeled samples, and high susceptibility to noise and outliers. To address these issues, a semisupervised graph U-Net with graph convolutional long short-term memory is proposed for HSI classification, abbreviated as SSGU-Net. Specifically, we design a novel graph convolutional long short-term memory feature extractor to learn discriminative spatial-spectral joint features by simultaneously modeling the correlations in the spatial and spectral domains. Then, we develop a semisupervised graph U-Net with mutually inverse operation of the graph pooling and the graph unpooling modules which uses both labeled samples and unlabeled samples to train a well-parameterized network for HSI classification. In particular, to suppress the effects of noise and outliers, the graph pooling module is designed to selectively retain discriminative samples and fully learn the optimal correlation between these retained samples. Meanwhile, the graph unpooling module employs the local spatial context to reconstruct the reduced samples, thus restoring the pooled data to its original scale for classification task. Extensive experiments show the effectiveness of the proposed method, achieving overall accuracy gains of 5.22 %, 1.58 %, and 1.57 % over the state-of-the-art competitors on the Indian Pines, University of Pavia, and Houston datasets, respectively.}, archive = {J_ESWA}, author = {Jin-Yu Yang and Heng-Chao Li and Xin-Ru Feng and Feng Gao and Qian Du and Antonio Plaza}, doi = {10.1016/j.eswa.2025.129522}, journal = {Expert Systems with Applications}, month = {3}, pages = {129522}, shortjournal = {Expert Syst. Appl.}, title = {Semisupervised graph U-net with G-ConvLSTM for hyperspectral image classification}, volume = {298}, year = {2026}, }
• (2026). Chat with one voice: Mitigating semantic disparity across languages for multilingual open-domain dialogue response generation systems. ESWA, 298, 129521. (www)

  @article{ , abstract = {With the development of the Internet, building a multilingual dialogue generation system to attract more users while reducing costs in the global market has become increasingly important. However, current end-to-end multilingual approaches often face semantic disparity issues across languages. When given parallel queries with the same semantics but in different languages, the generated responses may vary in meaning across languages, which may greatly affect the stability and reliability of multilingual systems in different language scenarios. We attribute this issue to open-domain/model uncertainty and language differences. To mitigate this issue, we first propose a novel Anchor-based Semantic Constraint (ASC) designed to reduce semantic disparity across languages for Encoder-Decoder Transformers. ASC employs language-independent anchor signal to guide the behaviors in both the encoder and decoder, thereby reducing uncertainty. Additionally, ASC incorporates a two-stage tuning process to further minimize the impact of language differences by ensuring the encoder remains language-independent. Extensive experiments and in-depth analyses conducted on XDailyDialog demonstrate that ASC can effectively mitigate semantic disparity across languages and will not compromise dialogue response quality like the previous related baselines.}, archive = {J_ESWA}, author = {Sixing Wu and Jiahao Chen and Jiong Yu and Wei Zhou}, doi = {10.1016/j.eswa.2025.129521}, journal = {Expert Systems with Applications}, month = {3}, pages = {129521}, shortjournal = {Expert Syst. Appl.}, title = {Chat with one voice: Mitigating semantic disparity across languages for multilingual open-domain dialogue response generation systems}, volume = {298}, year = {2026}, }
• (2026). Towards CPU performance prediction: New challenge benchmark dataset and novel approach. ESWA, 298, 129520. (www)

  @article{ , abstract = {CPU performance prediction based on hardware characteristics is crucial for system design and resource management. However, this field faces two major challenges. First, collecting real-world data is challenging due to the diversity of CPU products and the specialized nature of hardware characteristics. This field lacks a standard dataset with unified hardware characteristics, wide data coverage, and comprehensive benchmarks. Second, existing methods based on hardware simulation models or machine learning exhibit notable shortcomings, such as lengthy simulation test cycles and low prediction accuracy. To bridge these gaps, we first collect, preprocess, and standardize historical data from the 4th Generation Intel® Xeon® Scalable Processors across multiple benchmark suites to create a new dataset, named PerfCastDB. Subsequently, we design a deep learning based model called Nova CPU Performance Predictor (NCPP) as the baseline for this new dataset. The NCPP network is designed based on group attention mechanism. It effectively quantifies the implicit relationships between hardware characteristics within and across groups and comprehensively models the impact of various hardware characteristics on CPU performance prediction. We conduct comparative experiments using the proposed PerfCastDB dataset. Compared to existing approaches, NCPP achieves superior evaluation results, demonstrating its effectiveness. Furthermore, we have open-sourced part of the dataset and the NCPP network code to facilitate subsequent research. The resources can be accessed at https://github.com/xiaoman-liu/NCPP .}, archive = {J_ESWA}, author = {Xiaoman Liu}, doi = {10.1016/j.eswa.2025.129520}, journal = {Expert Systems with Applications}, month = {3}, pages = {129520}, shortjournal = {Expert Syst. Appl.}, title = {Towards CPU performance prediction: New challenge benchmark dataset and novel approach}, volume = {298}, year = {2026}, }
• (2026). Glyph graph isomorphism network for structure recognition of oracle bone inscription. ESWA, 298, 129519. (www)

  @article{ , abstract = {Structure recognition of oracle bone inscription glyphs plays an important role in studying the evolutionary process of oracle bone inscriptions and the history of the Shang Dynasty. Currently, most methods have decomposed oracle bone inscription glyphs into multilevel features, which are used to recognize hierarchical feature fusion. This strategy cannot recognize the primitive internal structures of keypoints, strokes, and components. Moreover, mainstream graph neural networks cannot fully utilize the rich structural information of oracle bone inscription glyphs, resulting in their inability to meet the needs of structure recognition. So we have developed a graph structure recognition method to implement structure recognition of oracle bone inscription glyphs. A graph extraction method is given to get the structure of oracle bone inscription glyphs; each graph structure’s representation vector can be learned by a glyph graph isomorphism network, which is developed to recognize the graph of oracle bone inscription glyphs to enhance the discriminability representation of the structure. Our model has achieved advanced results across structure recognition experiments in the HWOBC dataset and the Oracle-50K dataset.}, archive = {J_ESWA}, author = {Zhan Zhang and Hanbin Liu and Xingkun Zhang and Yiyuan Wang and Feng Gao and An Guo and Han Zhang and Qingju Jiao and Bang Li and Yongge Liu}, doi = {10.1016/j.eswa.2025.129519}, journal = {Expert Systems with Applications}, month = {3}, pages = {129519}, shortjournal = {Expert Syst. Appl.}, title = {Glyph graph isomorphism network for structure recognition of oracle bone inscription}, volume = {298}, year = {2026}, }
• (2026). An integrated decision-making framework to evaluate the route alternatives in overweight/oversize transportation. ESWA, 298, 129516. (www)

  @article{ , abstract = {Overweight and oversized transport (O&OT) has become one of the most critical elements of project logistics, driven by advancements in transportation and lifting technologies that now allow high-volume loads to be moved across long distances. This type of transportation operation, also called abnormal transportation, is greatly affected by technical factors such as the weight and geometry of the load, road surface, axle load limitations, slope, and ground strength, as well as external variables such as weather conditions, traffic density, and legal regulations. In planning and operational processes, Decision-Makers (DMs) and practitioners who plan and execute operations without adequately considering these factors and variables can lead to delays in operations, serious risks, and loss of productivity. This research proposes a flexible decision support model that integrates Step-wise Weight Assessment Ratio Analysis (SWARA) and Logarithmic Percentage Change-driven Objective Weighting (LOPCOW), and a ranking technique; i.e., Mixed Aggregation by Comprehensive Normalization Technique (MACONT) techniques to address the decision problems related to route selection, one of the most critical problems in transporting heavy and bulky loads, and to produce reasonable solutions. The proposed model significantly reduces information losses by processing subjective and objective information and integrating subjective (SWARA) and objective (LOPCOW) methods. Unlike traditional ranking approaches, the MACONT method combines three different normalization techniques to determine the ranking performance of alternatives. In this way, it provides more reliable and accurate results by reducing the deviations of the results provided by the single normalization technique. In addition, it shows each alternative’s good and bad performance compared to the others and is more convincing about the results obtained. According to the results obtained by applying the proposed model, fuel consumption (0.096) is determined as the most effective and critical factor in selecting the route on which heavy and bulky loads will be transported. In this context, choosing routes that allow lower fuel consumption can contribute to reducing carbon emissions and external costs arising from transportation. The extensive robustness and validation check to test the proposed model prove that the proposed model is a reliable, robust, and practical decision-making tool for making reasonable and rational decisions in O&OT.}, archive = {J_ESWA}, author = {Ömer Faruk Görçün and Pradip Kundu and Hande Küçükönder and Gürkan Doğan and Erfan Babaee Tirkolaee}, doi = {10.1016/j.eswa.2025.129516}, journal = {Expert Systems with Applications}, month = {3}, pages = {129516}, shortjournal = {Expert Syst. Appl.}, title = {An integrated decision-making framework to evaluate the route alternatives in overweight/oversize transportation}, volume = {298}, year = {2026}, }
• (2026). EvoMapX: An explainable framework for metaheuristic optimization algorithms. ESWA, 298, 129514. (www)

  @article{ , abstract = {Population-based optimization algorithms (POAs) are widely adopted solutions for NP-hard and complex high-dimensional optimization problems. However, their internal dynamics often remain opaque, limiting trust and insight into how solutions evolve. This paper introduces EvoMapX, a novel explainable framework designed to interpret the internal dynamics of population-based optimization algorithms. EvoMapX includes three interpretable structures to visualize evolutionary optimization dynamics: the Operator Attribution Matrix (OAM) quantifies the contribution of specific operators over iterations; the Population Evolution Graph (PEG) traces the ancestry and transformation of candidate solutions; and the Convergence Driver Score (CDS) identifies which operators drive convergence, helping interpret why the algorithm improved. EvoMapX was evaluated across four POAs on the CEC 2021 test suite in order to demonstrate how it reveals meaningful textual and graphical insights into algorithm behavior. EvoMapX paves the way for interpretable metaheuristic optimization. The source code of EvoMapX is available at https://www.github.com/Bilal20252025/EvoMapX}, archive = {J_ESWA}, author = {Bilal H. Abed-Alguni}, doi = {10.1016/j.eswa.2025.129514}, journal = {Expert Systems with Applications}, month = {3}, pages = {129514}, shortjournal = {Expert Syst. Appl.}, title = {EvoMapX: An explainable framework for metaheuristic optimization algorithms}, volume = {298}, year = {2026}, }
• (2026). BDOS: An orthogonal sum based on belief of permutation events and element distances in random permutation set. ESWA, 298, 129513. (www)

  @article{ , abstract = {The random permutation set (RPS) extends Dempster-Shafer evidence theory by incorporating event order information, providing a powerful framework for modeling uncertainty. However, existing orthogonal sum methods within the RPS framework may encounter loss of order information and counterintuitive belief distribution during permutation event fusion. To address these two issues, this paper proposes a new method termed belief-distance-based orthogonal sum (BDOS). BDOS operates through three core mechanisms: order-information preservation via mathematical constructs like order-space and inverse mapping; belief-value weighting that prioritizes events with high belief mass for rational outcomes; and element-distance weighting that incorporates dissimilarity among permutations to improve ordinal accuracy. Numerical examples validate the effectiveness of BDOS in permutation event fusion, with comparative results demonstrating its advantages in order retention and belief distribution. Furthermore, BDOS is applied to threat assessment, illustrating its rationality and effectiveness in handling uncertainty and threat ranking.}, archive = {J_ESWA}, author = {Xiaoyan Su and Xu Chen and Hong Qian and Cheng Jiang}, doi = {10.1016/j.eswa.2025.129513}, journal = {Expert Systems with Applications}, month = {3}, pages = {129513}, shortjournal = {Expert Syst. Appl.}, title = {BDOS: An orthogonal sum based on belief of permutation events and element distances in random permutation set}, volume = {298}, year = {2026}, }
• (2026). Fine-grained similarity retrieval of lesion areas in lung CT images based on visual similarity matching of image blocks. ESWA, 298, 129510. (www)

  @article{ , abstract = {Background and Objective With the rapid growth in the number of medical images, the need for content- based medical image retrieval (CBMIR) in clinical aid diagnosis is becoming increasingly important. Most current content-based CT image similarity retrieval methods use the entire CT image, ignoring the fact that the localized lesion region is the main target of similarity retrieval; Methods To address this issue, the paper proposes a fine-grained similarity retrieval method for lung CT images based on image block( IB ) similarity matching, taking lung CT images as an example. In this method, two enabling techniques are introduced: 1) a hybrid Convolution and Vision Transformer Model(CVTM) that effectively captures both local texture and global context features of lesion regions; 2) the iDS high-dimensional index designed to accelerate retrieval among IB ; Results With the aid of these techniques, fine-grained similarity retrieval optimization of lung CT images can be achieved, which facilitates more accurate lesion-level comparison and supports clinical decision-making; Conclusions Extensive experiments are conducted to indicate that the proposed fine-grained similarity retrieval method achieves excellent performance, with a mAP of 91.33%. Meanwhile, the retrieval efficiency of the iDS high-dimensional index is about 150% higher than that of sequential retrieval, especially when the retrieval radius is large and the database size is substantial.}, archive = {J_ESWA}, author = {Yi Zhuang and Jiayu Zhang and Yujia Ge and Nan Jiang}, doi = {10.1016/j.eswa.2025.129510}, journal = {Expert Systems with Applications}, month = {3}, pages = {129510}, shortjournal = {Expert Syst. Appl.}, title = {Fine-grained similarity retrieval of lesion areas in lung CT images based on visual similarity matching of image blocks}, volume = {298}, year = {2026}, }
• (2026). Traffic prediction using an active causality recurrent graph convolutional network. ESWA, 298, 129506. (www)

  @article{ , abstract = {The quality of our daily lives is significantly influenced by traffic conditions, highlighting the importance of incorporating complex spatiotemporal dependencies in interconnected traffic data for effective prediction. Although recent advancements have demonstrated prediction accuracy using graph convolutional networks, their depends heavily on the accuracy of the graph structures that represent the spatial relationships within the traffic network. To address this challenge, we introduce a novel approach to traffic prediction, the Active Causal Recurrent Graph Convolution Network (ACRGCN), as shown in Fig. 2. ACRGCN offers a new framework that effectively integrates a causal-embedded approach for traffic prediction, leveraging both structural and feature information from correlated traffic time series. Additionally, it incorporates a time-varying dynamic Bayesian network to capture the intricate spatiotemporal topology of traffic data. The model extracts spatiotemporal dependencies from traffic signals using the Active Causality Graph Recurrent Module (ACGRM), while efficiently modeling nonlinear traffic propagation patterns. Furthermore, ACRGCN employs a deep learning-based module that functions as a hyper-network, progressively generating dynamic causal graphs. Finally, extensive experiments on multiple real-world traffic graph datasets validate ACRGCN, and the results demonstrate its superiority over state-of-the-art method}, archive = {J_ESWA}, author = {Jinde Zhu and Junhao Yuan and Fulan Ye and Trong-The Nguyen and Ruoxi Wang and Wu Zeng and Chien-Chun Liu}, doi = {10.1016/j.eswa.2025.129506}, journal = {Expert Systems with Applications}, month = {3}, pages = {129506}, shortjournal = {Expert Syst. Appl.}, title = {Traffic prediction using an active causality recurrent graph convolutional network}, volume = {298}, year = {2026}, }
• (2026). Shielding federated learning: Mitigating label transferability against poisoning attacks in cloud-edge-client system. ESWA, 298, 129502. (www)

  @article{ , abstract = {Hierarchical computing architecture of cloud-edge-client (CEC) formed with the combination of cloud computing and edge computing can provide processing, storage and low-latency services close to end devices. To protect data privacy, federated learning (FL), as a novel intelligent edge computing framework with localized training mechanisms, has been integrated into edge computing to form a system called CEC-FL and is widely studied. However, they are susceptible to potential poisoning attacks. Existing poisoning attack methods are mostly explored by performing malicious operations on training samples or labels directly and implementing corresponding defense strategies: they are designed to ignore the label transferability and diverse attack environments and are not work against stealthy security threats, mainly because they do not take into account the inherent vulnerabilities of the attack environment. Yet few general defense schemes have been developed. In response to the above vulnerabilities, in this work, we explore a B arycenter Po isoning method with L abel T ransferability (BPoLT) initiated by malicious attackers, resulting in a dynamic attack capability on the CEC-FL system. To address poisoning attacks, we provide a two-phase defense algorithm Res isting L abel T ransferability Pois oning called ResLT-Pois to distinguish malicious attackers from benign participants. Extensive experimental results demonstrate that our scheme is feasible and effective in dealing with the vulnerability of the CEC-FL system.}, archive = {J_ESWA}, author = {Yaru Zhao and Yihao Cao and Jianbiao Zhang and Zhaoqian Zhang and Weiru Wang}, doi = {10.1016/j.eswa.2025.129502}, journal = {Expert Systems with Applications}, month = {3}, pages = {129502}, shortjournal = {Expert Syst. Appl.}, title = {Shielding federated learning: Mitigating label transferability against poisoning attacks in cloud-edge-client system}, volume = {298}, year = {2026}, }
• (2026). SAMForecast: A hybrid model of self-attention and mamba with adaptive wavelet transform for time series forecasting. ESWA, 298, 129498. (www)

  @article{ , abstract = {Time series forecasting faces significant challenges due to the variability and complexity of real-world data. Traditional methods often require manual adjustments of wavelet transform parameters, which are labor-intensive and prone to over-fitting or inadequate feature extraction. To address these limitations, this study proposes SAMForecast, a novel hybrid model that integrates Adaptive Wavelet Transform, self-attention mechanisms, and the selective state space model. We introduce an Adaptive Wavelet Block that dynamically adjusts decomposition levels and basis functions using a Mixture of Experts network and lifting scheme, eliminating the need for manual parameter tuning. Furthermore, the model deeply integrates the attention mechanism of the Transformer architecture, leveraging its advantages in capturing complex dependencies to identify correlations between time series data. By combining self-attention with Mamba, SAMForecast effectively captures both global dependencies and local key features in time series, enhancing robustness against noise and redundant information. SAMForecast demonstrates promising performance in multivariate time series forecasting tasks, showcasing an average 2 % performance improvement compared to existing models across datasets in energy, transportation, and other fields. The code is available at https://github.com/Kiki-V/SAMForecast-main .}, archive = {J_ESWA}, author = {Dunlu Peng and Qiqi Lin}, doi = {10.1016/j.eswa.2025.129498}, journal = {Expert Systems with Applications}, month = {3}, pages = {129498}, shortjournal = {Expert Syst. Appl.}, title = {SAMForecast: A hybrid model of self-attention and mamba with adaptive wavelet transform for time series forecasting}, volume = {298}, year = {2026}, }
• (2026). An adaptive hypergraph-based convolution network with dual spatiotemporal attention for PM2.5 forecasting. ESWA, 298, 129497. (www)

  @article{ , abstract = {Accurate PM2.5 prediction is crucial for effective environmental management and public health protection, yet current models show limited dynamic adaptability to complicated air pollution scenarios. Robust models are essential to support timely interventions in response to sudden pollution events or rapidly changing air quality patterns. However, existing models predominantly rely on predefined graph structures and pairwise spatial relationships, limiting their ability to capture the complex and dynamic interactions inherent in PM2.5 pollution. Furthermore, such models often assume equal contributions from neighboring nodes, neglecting heterogeneity and compromising predictive accuracy. To address these limitations, we propose an Adaptive Hypergraph-based Convolution Network with a Dual Spatiotemporal Attention mechanism (AHCN-DA) for PM2.5 forecasting. This framework leverages representation learning and hypergraph structures to capture and integrate pairwise as well as higher-order spatial interactions, producing richer spatial-feature representations. The dual spatiotemporal attention mechanism dynamically assigns time-varying weights to neighboring nodes based on their relevance to target nodes, effectively mitigating the impact of irrelevant inputs. Additionally, AHCN-DA integrates a dilated convolution network with multi-scale kernels to capture temporal patterns effectively across varying scales. Extensive experiments on the 2023 China National Air Quality Dataset show significant improvements in predictive accuracy, particularly in enhancing the proportion of high-precision monitoring stations, with an R 2 of 0.9224, outperforming baseline models. Our findings underscore the effectiveness of AHCN-DA in enhancing prediction accuracy under complex pollution response patterns, contributing to more informed decision-making in environmental management.}, archive = {J_ESWA}, author = {Haipeng Gao and Chonghui Qian and Yang Su and Wei Zhang and Hengjun Huang}, doi = {10.1016/j.eswa.2025.129497}, journal = {Expert Systems with Applications}, month = {3}, pages = {129497}, shortjournal = {Expert Syst. Appl.}, title = {An adaptive hypergraph-based convolution network with dual spatiotemporal attention for PM2.5 forecasting}, volume = {298}, year = {2026}, }
• (2026). Solving equilibrium for adversarial team games utilizing fictitious team play with refined team plans. ESWA, 298, 129496. (www)

  @article{ , abstract = {Adversarial team games represent scenarios where cooperation and competition coexist and hold numerous applications in the real world. These scenarios are particularly challenging due to asymmetric information among team members and limited communication capabilities. Fictitious team-play extend self-play algorithms to these scenarios, offering a novel approach to obtain equilibrium. However, it depends on normal-form team plans, which expand exponentially with game size, significantly constraining their applicability in large games. To overcome the challenge of computing equilibrium in large scale imperfect information team games, we propose a team self-play algorithm that utilizes refined team plans. Specifically, we pre-solve the equilibrium in a perfect recall environment to extract essential team plans from the original strategy space. To adapt these plans to an imperfect recall environment, we construct an auxiliary game with transformed ex ante coordinated information based on the original game and then solve equilibrium in auxiliary game to derive equilibrium for the original game. The experiments demonstrate the effectiveness of our team self-play algorithm in eight different Kuhn poker scenarios. Compared to existing team self-play algorithms, our method efficiently handles large games and exhibits superior convergence compared to reinforcement learning based algorithms. Additionally, our experiments offer valuable insights and guidance on adapting equilibrium strategies from perfect recall environments to those with imperfect recall.}, archive = {J_ESWA}, author = {Jinheng Xiao and Chen Qiu and Yingying Xu and Jiajia Zhang and Shuhan Qi and Xuan Wang}, doi = {10.1016/j.eswa.2025.129496}, journal = {Expert Systems with Applications}, month = {3}, pages = {129496}, shortjournal = {Expert Syst. Appl.}, title = {Solving equilibrium for adversarial team games utilizing fictitious team play with refined team plans}, volume = {298}, year = {2026}, }
• (2026). Proactive-BiLSTM: Glaucoma detection using FUNDUS and OCT retinal images. ESWA, 298, 129490. (www)

  @article{ , abstract = {Glaucoma detection identifies the early signs of eye conditions that can lead to vision loss by analyzing the retinal images to detect abnormalities, such as increased intraocular pressure, changes in the optic nerve head, or structural alterations in the retina. The challenges faced by the existing models include the difficulty in detecting subtle features, variability in image quality, and complex patterns that may resemble normal variations. Moreover, the traditional models struggle to adapt to the evolving patient data, capture long-term dependencies, and often suffer from lower accuracy. Hence, this research proposes the Proactive Hybridized Bidirectional Long Short-Term Memory (BiLSTM) model for Glaucoma detection. The proactive hybridized BiLSTM model is designed to enhance the detection of glaucoma by processing the retinal images. The proactive hybridized BiLSTM model enables the model to capture complex temporal dependencies and relationships within the data, which are crucial for identifying subtle patterns indicative of glaucoma, for which multifaceted feature extraction is employed. Moreover, the Proactive Hybridized BiLSTM model adapts to dynamic changes in the data to learn and predict glaucoma-related features, ultimately improving detection performance over time. The proposed Proactive hybridized BiLSTM model attains higher accuracy, sensitivity, and specificity of 96.65%, 96.51%, and 96.79% using the OCT and FUNDUS image dataset.}, archive = {J_ESWA}, author = {M.Kiran Mayee and M.Humera Khanam and Shaik Lathifa Tabasum}, doi = {10.1016/j.eswa.2025.129490}, journal = {Expert Systems with Applications}, month = {3}, pages = {129490}, shortjournal = {Expert Syst. Appl.}, title = {Proactive-BiLSTM: Glaucoma detection using FUNDUS and OCT retinal images}, volume = {298}, year = {2026}, }
• (2026). DBCD: Deep balanced community detection via consensus-guided joint optimization in attributed networks. ESWA, 298, 129487. (www)

  @article{ , abstract = {Current deep learning methods for community detection in attributed networks face a critical limitation: they often fail to identify communities that are both structurally cohesive and semantically similar, thereby falling short of the balance typically observed in human-labeled partitions. This shortcoming stems from the absence of explicit mechanisms to jointly optimize these two objectives. In this paper, this challenge is addressed by proposing Deep Balanced Community Detection (DBCD), a novel unsupervised framework for community detection that balances topology and semantics. DBCD first constructs a powerful topology-semantic clustering consensus by integrating insights from both structural and attribute spaces. This consensus then steers a Graph Neural Network to simultaneously maximize global neural modularity and local cross-view consistency, while adaptively determining the number of communities. Extensive experiments reveal a striking result: DBCD consistently discovers communities that surpass the topology-semantic balance of the ground truth across multiple real-world networks. An empirical Pareto frontier analysis further validates that DBCD achieves a non-dominated solution, establishing it as a strong competitor among state-of-the-art methods. The source code of DBCD is available at https://github.com/wy980125/DBCD .}, archive = {J_ESWA}, author = {Yan Wang and Yupeng Liu and Xiaojie Sun and Jun Fu}, doi = {10.1016/j.eswa.2025.129487}, journal = {Expert Systems with Applications}, month = {3}, pages = {129487}, shortjournal = {Expert Syst. Appl.}, title = {DBCD: Deep balanced community detection via consensus-guided joint optimization in attributed networks}, volume = {298}, year = {2026}, }
• (2026). Network traffic forecasting with transfer learning-based algorithm for long continuous missing data. ESWA, 298, 129484. (www)

  @article{ , abstract = {Accurate network traffic forecasting is critical for power dispatch networks. Network traffic forecasting aims to use historical data to predict future network traffic trends. Different from other networks, the traffic data of the power dispatch network is mainly composed of the port traffic from routers and switches. However, network accidents in power enterprises can cause long periods of missing network traffic data, reducing the number of learning samples for network traffic prediction models and making the forecasting results unreliable. Due to the long periods of missing data, this paper uses transfer learning (TL) to impute missing data with the knowledge from a relevant task, which has ample samples. However, the imputation result contains complex source and target data characteristics. Therefore, this paper introduces the idea of frequency decomposition to decompose the imputation results into different sub-sequences through variational mode decomposition (VMD). Additionally, this paper uses long short-term memory (LSTM) networks to extract the potential features of decomposition results. Finally, this paper combines TL, VMD, and LSTM to design the TL-VMD-LSTM algorithm. The effectiveness of the proposed algorithm is validated using inflow and outflow traffic data from two State Grid Corp. of China networks. The results demonstrate that TL-VMD-LSTM has excellent generalization performance, with mean absolute percentage errors (MAPEs) of 0.380 % and 0.734 % for the Provincial access network and Information region network, respectively.}, archive = {J_ESWA}, author = {Yang Yang and Zhihao Chen and Yuchao Gao and Zijin Wang and Zhe Ding and Jinran Wu}, doi = {10.1016/j.eswa.2025.129484}, journal = {Expert Systems with Applications}, month = {3}, pages = {129484}, shortjournal = {Expert Syst. Appl.}, title = {Network traffic forecasting with transfer learning-based algorithm for long continuous missing data}, volume = {298}, year = {2026}, }
• (2026). High-dimensional multi-objective feature selection with niche-based binary differential evolution. ESWA, 298, 129478. (www)

  @article{ , abstract = {Feature selection is a critical step in machine learning and data mining, aiming to identify the most relevant features from a dataset to improve model performance while reducing computational costs. In high-dimensional data, as the dimensionality of data increases rapidly, feature selection faces an enormous search space, limiting the efficiency and effectiveness of traditional methods. To address these challenges, multi-objective optimization algorithms have emerged as a promising strategy for feature selection due to their ability to optimize multiple conflicting objectives simultaneously. We propose a niche-based binary differential evolution algorithm (MONBDE) for high-dimensional multi-objective feature selection. MONBDE enhances feature selection performance through several mechanisms: a niche-based binary differential evolution operator, redundant solution repair mechanism and an environmental selection strategy. In experiments, the proposed algorithm was compared with five advanced multi-objective optimization algorithms and tested on 15 benchmark datasets using three common metrics. Experimental results show that the MONBDE algorithm outperforms comparative algorithms in terms of classification accuracy and feature subset size across most datasets. The proposed strategy effectively eliminates redundant and irrelevant solutions in feature selection, leading to a significant improvement in model classification performance.}, archive = {J_ESWA}, author = {Xuezhi Yue and Xiang Zuo and Pengfei Ling and Chao Xiong and Hu Peng and Yuan Zeng}, doi = {10.1016/j.eswa.2025.129478}, journal = {Expert Systems with Applications}, month = {3}, pages = {129478}, shortjournal = {Expert Syst. Appl.}, title = {High-dimensional multi-objective feature selection with niche-based binary differential evolution}, volume = {298}, year = {2026}, }
• (2026). DFCNet: Dual-path fusion with intra-slice features and cross-slice constraints for cervical cancer CTV segmentation. ESWA, 298, 129477. (www)

  @article{ , abstract = {Accurate and rapid segmentation of the clinical target volume (CTV) is essential for cervical cancer radiotherapy. However, due to the soft boundaries of CTV, complex connections with surrounding tissues, and high interpatient variability, existing deep learning methods still face significant challenges, particularly for image slices that lack clear boundary information or where applicators are distant from CTV edges. Hence, we introduce DFCNet, a dual-path fusion network with cross-slice consistency constraints for CTV segmentation. The first path employs a dual-stream intra-slice feature encoding module to capture local and inter-regional details, thereby refining boundary delineation amidst the complex interplay with adjacent tissues. The second path integrates a cross-slice consistency constraint module to address soft boundaries and high interpatient variability, while ensuring the coherence and smoothness of the segmentation results. A feature fusion and decoding module combines semantic features from both paths, improving CTV region accuracy. Tests on 432 cervical cancer brachytherapy cases show DFCNet outperforms eighteen state-of-the-art segmentation methods, with Dice score improvements over two percentage points. The second path and feature fusion module can enhance other U-Net-based models, boosting their CTV segmentation performance. DFCNet excels in high-precision CTV segmentation, particularly for challenging slices, demonstrating its potential to improve cervical cancer radiotherapy accuracy, efficiency, and patient outcomes.}, archive = {J_ESWA}, author = {Mingxu Huang and Deyu Sun and Chaolu Feng and Ming Cui and Dazhe Zhao and Yuhua Gao}, doi = {10.1016/j.eswa.2025.129477}, journal = {Expert Systems with Applications}, month = {3}, pages = {129477}, shortjournal = {Expert Syst. Appl.}, title = {DFCNet: Dual-path fusion with intra-slice features and cross-slice constraints for cervical cancer CTV segmentation}, volume = {298}, year = {2026}, }
• (2026). Competitive e-commerce platforms’ data provision and pricing strategies with different attribution behaviors of users. ESWA, 298, 129466. (www)

  @article{ , abstract = {In the era of data, numerous e-commerce platforms are actively collecting consumer data to obtain business insights. However, consumers and merchants on platforms exhibit diverse attribution behaviors, including single-homing and multi-homing (access to only one platform/multiple platforms), not only affecting the platform’s market scale but also complicating their data provision strategies and data pricing strategies. Inspired by this practice, this paper considers varying attribution behaviors and studies the data operation strategies of competitive platforms. By constructing a two-period game model, we capture the entire process of platform’s data collection and provision, and solve the equilibrium decisions by reverse solution method. This research aims to identify the impact of attribution behaviors on platforms’ data strategies, thereby filling the gap in analyzing this issue from the perspective of two-sided platforms. Results show that when both groups of users (consumers and merchants) are multi-homing, platform facing higher operational costs may benefit more from implementing low data provision but high data pricing strategy, while more cost-efficient platform may choose the opposite strategy. This strategy is still applicable when only one group of users (consumers) becomes single-homing. However, once both groups of users are single-homing, both platforms’ strategies will change. Specifically, when merchant’s cross-side network effect (CNE) intensity is relatively low (high), compared with less cost-efficient platform, platform enjoying cost efficiencies should provide more (less) data at a relatively high (low) price. Moreover, platforms should cautiously provide data when both groups of users are single-homing, as it may hurt profits.}, archive = {J_ESWA}, author = {Wei Chen and Yijia Hu and Ronghua Sui and Zili Guan and Yi Liu}, doi = {10.1016/j.eswa.2025.129466}, journal = {Expert Systems with Applications}, month = {3}, pages = {129466}, shortjournal = {Expert Syst. Appl.}, title = {Competitive e-commerce platforms’ data provision and pricing strategies with different attribution behaviors of users}, volume = {298}, year = {2026}, }
• (2026). Emergency logistics planning through optimizing the multi-trip vehicle routing with time windows and limited trip duration. ESWA, 298, 129465. (www)

  @article{ , abstract = {Although the multi-trip vehicle routing problem with time windows (MTVRPTW) and its variants have been extensively studied, their application in natural disaster contexts remains underexplored. This study addresses this gap by developing a model and solution algorithm for the MTVRPTW with limited trip duration (MTVRPTW-LD), tailored to emergency supplies distribution in the early post-disaster phase. First, we replace the service-dependent loading time in traditional models with service-dependent unloading time and formulate an MTVRPTW-LD model to minimize total operational time, encompassing travel, service, and unloading times, based on the characteristics of emergency supplies distribution. Furthermore, a more practical method for calculating travel time is proposed to enhance the model’s applicability. Subsequently, a branch-and-price algorithm is designed to solve the MTVRPTW-LD model, in which the cumulative relative deprivation cost (CRDC) is introduced to improve equity in emergency supplies distribution. Finally, we conduct numerical experiments on Solomon instances and test instances generated based on emergency scenarios. The results show that, in the test instances, incorporating CRDC can improve the equity by up to 34.3 %.}, archive = {J_ESWA}, author = {Longfei Fan and Zhongming Wu and Zaiwu Gong and David Z.W. Wang}, doi = {10.1016/j.eswa.2025.129465}, journal = {Expert Systems with Applications}, month = {3}, pages = {129465}, shortjournal = {Expert Syst. Appl.}, title = {Emergency logistics planning through optimizing the multi-trip vehicle routing with time windows and limited trip duration}, volume = {298}, year = {2026}, }
• (2026). Regularity model-driven large-scale multi-objective evolutionary algorithm based on dual-information offspring reproduction strategy. ESWA, 298, 129460. (www)

  @article{ , abstract = {The Pareto set (PS) of a continuous multi-objective optimization problem exhibit a distribution along a low-dimensional manifold structure. This regularity property significantly contributes to generating high-quality offspring in large-scale multi-objective evolutionary algorithms (LSMOEAs). However, conventional regularity model-based algorithms face several challenges when dealing with large-scale multi-objective optimization problems (LSMOPs), including high computational costs for modeling, difficulty in capturing the true PS structure, and neglecting individual directional information. To address these challenges, we propose a dual-information offspring reproduction strategy that considers both the distribution information of the population and the directional information of the outstanding individuals. Specifically, this strategy comprises a sampling approach based on an augmented regularity model specifically designed for LSMOPs. Leveraging this model, we explore and exploit the decision space to sample a promising set of solutions. Additionally, the strategy also involves a search method based on competitive learning among individuals. By assigning a positive evolutionary direction to losing solutions, we update the losing solutions to generate high-quality offspring. We continuously refine the proposed regularity model to approximate the true PS more closely. In extensive experiments on large-scale multi-objective benchmark functions, we compare our algorithm with eight state-of-the-art algorithms. The results demonstrate that our approach excels in handling LSMOPs.}, archive = {J_ESWA}, author = {Ying Wu and Ziliang Du and Gonglin Yuan and Zhenzhou Tang and Ferrante Neri and Yaqing Hou}, doi = {10.1016/j.eswa.2025.129460}, journal = {Expert Systems with Applications}, month = {3}, pages = {129460}, shortjournal = {Expert Syst. Appl.}, title = {Regularity model-driven large-scale multi-objective evolutionary algorithm based on dual-information offspring reproduction strategy}, volume = {298}, year = {2026}, }
• (2026). GlobalCLIP: Zero-shot manufacturing anomaly detection with adaptive self-cyclic emsemble learning. ESWA, 298, 129448. (www)

  @article{ , abstract = {Accurately identifying product defects and process anomalies in manufacturing processes is a critical task for product quality and system stability. Although the existing unsupervised anomaly detection methods do not require the annotation of anomalies, they are difficult to deal with the zero-shot scenario faced by multi-variety and small-batch production where there is no available data. In addition, many zero-shot detection algorithms need to represent the image features in tensor form with multiple local feature vectors, and then measure each local feature to infer the overall anomaly of the object. In this paper, we propose GlobalCLIP, a novel approach for zero-shot anomaly detection using only global feature vectors to enhance performance. Specifically, we use CLIP model to aggregate the global features, and design two kinds of adaptive modules from the error level and uncertainty level to realize the series integration of different discriminant models. The adaptive modules encourage the model to learn both normal and abnormal patterns with different granularity, and the self-cyclic training progressively improves model performance. Experiments show that compared to many unsupervised/weakly supervised methods, the performance of GlobalCLIP maintains its advantage even without known samples, and achieves significant improvement over available zero-shot methods.}, archive = {J_ESWA}, author = {Haoyuan Shen and Enrico Zio and Jiawei Xiong and Yizhong Ma}, doi = {10.1016/j.eswa.2025.129448}, journal = {Expert Systems with Applications}, month = {3}, pages = {129448}, shortjournal = {Expert Syst. Appl.}, title = {GlobalCLIP: Zero-shot manufacturing anomaly detection with adaptive self-cyclic emsemble learning}, volume = {298}, year = {2026}, }
• (2026). Key performance indicator-related process monitoring for irregular scenarios with incomplete data. ESWA, 298, 129440. (www)

  @article{ , abstract = {Modern industries exhibit irregular characteristics due to factors such as mode transitions, incomplete data and outliers. Accurate monitoring of key performance indicators (KPIs) in irregular processes is essential for improving product quality and reducing scrap rates. This paper proposes a novel KPI-related process monitoring method that leverages the multiple kernel learning (MKL) technique, designed specifically for irregular scenarios with incomplete data. First, a novel MKL-based nonlinear matrix completion is proposed that utilizes a hierarchical strategy-based algorithm to estimate the missing values in incomplete data and the linear coefficients of multiple kernels. In addition, the corresponding convergence analysis is given. Based on the estimated completed data matrix, a novel MKL-based feature correlation analysis is proposed for indirect prediction of KPIs. Two statistics are established for detecting KPI-related and KPI-unrelated faults, respectively. A numerical case and an industrial example demonstrate that the proposed method not only accurately identifies the missing data, but also effectively detects the KPI-related faults.}, archive = {J_ESWA}, author = {Yanyu Chen and Hao Ma and Yan Wang and Xiang Liu}, doi = {10.1016/j.eswa.2025.129440}, journal = {Expert Systems with Applications}, month = {3}, pages = {129440}, shortjournal = {Expert Syst. Appl.}, title = {Key performance indicator-related process monitoring for irregular scenarios with incomplete data}, volume = {298}, year = {2026}, }
• (2026). A novel approach to anomaly detection in critical CPSs: The ERXAI-MS algorithm. ESWA, 298, 129437. (www)

  @article{ , abstract = {At present, practical machine learning methodologies are extensively employed for the automation of detecting the intrusion available in the network. In key infrastructure scenarios involving communication strategies, the interplay between different industrial control systems and the inherent connection to the Internet environment through the Internet of Things renders them vulnerable to cyber threats. Considering the substantial volume of network traffic within critical Cyber-Physical Systems, conventional machine-learning approaches utilized for detecting anomalies prove to be ineffective. Hence, newly designed machine learning methods, with a focus on deep learning, are demonstrating effective applications in identifying and categorizing anomalies on both network and individual device levels. This article introduces an innovative Ensemble Random Explainable Artificial Intelligence Meerkat Search algorithm designed for the identification of cyber threats. To augment the effectiveness of the suggested method, it employs a dual-step process for the detection of network irregularities. During the initial phase, the approach involves data pre-processing and dimensionality reduction through the application of Kernel Principal Component Analysis to select the most suitable features. In the subsequent stage, the novel Ensemble Random Explainable Artificial Intelligence Meerkat Search algorithm is employed for classification. The effectiveness of the approach presented in this study is evaluated on diverse datasets, encompassing information collected within the Internet of Things context, specifically IoT-23 and LITNET-2020 datasets. The findings of the assessment of the suggested method are deliberated upon, including the examination of statistical significance and a comparative analysis with contemporary approaches in the field of network anomaly detection. Evaluations confirmed this robust model attained 98.56% accuracy, 97.78% precision, 98.2% F1-score, and produced less FPR of 1.55%.}, archive = {J_ESWA}, author = {Prabakeran Saravanan and Annamalai Balaji and Hemalatha Murugan and Manickam Muruganantham and Indumathi Varadharajan}, doi = {10.1016/j.eswa.2025.129437}, journal = {Expert Systems with Applications}, month = {3}, pages = {129437}, shortjournal = {Expert Syst. Appl.}, title = {A novel approach to anomaly detection in critical CPSs: The ERXAI-MS algorithm}, volume = {298}, year = {2026}, }
• (2026). Improved DQN-based recommender system on three-way decision. ESWA, 298, 129431. (www)

  @article{ , abstract = {Recommendation systems, which utilize algorithms and data analysis to provide personalized suggestions to users, have become an indispensable part of modern life. However, traditional recommendation algorithms face challenges such as the cold start problem, lack of diversity, and limited scalability. Reinforcement learning (RL), particularly deep reinforcement learning (DRL), emerges as a promising solution to these problems by allowing agents to learn optimal strategies through interaction with their environment. Nevertheless, as the scale of data increases, RL-based recommendation systems often struggle to achieve a good balance between exploration and exploitation, impacting the overall performance of the algorithms. In this paper, we propose a reinforcement learning-based recommendation algorithm enhanced by a three-way decision (3WD) framework to address the exploration-exploitation balance challenge. The 3WD algorithm, rooted in rough set theory, categorizes decision outcomes into acceptance, rejection, and uncertainty regions. By applying 3WD in the action selection process of RL, we optimize the trade-off between exploration and exploitation, thereby improving the quality and computational efficiency of recommendations. Additionally, we introduce a dynamic threshold adjustment mechanism to adaptively refine the decision boundary during the action selection process in reinforcement learning, further enhancing the algorithm’s performance. Using the MovieLens dataset as a foundation, we conduct extensive experiments with several randomly generated data sets to evaluate the proposed method. Our results demonstrate that the 3WD-based RL algorithm outperforms traditional methods, such as epsilon-greedy and Softmax, in terms of runtime, recommendation accuracy, and error rate. Notably, the dynamic threshold adjustment model exhibits greater stability and surpasses static methods in recommendation success rates. These findings highlight the effectiveness of combining 3WD with RL in recommendation systems, providing a powerful and efficient solution to the challenges faced by traditional methods. Finally, we analyze the limitations of the model based on the experimental results and propose avenues for future research.}, archive = {J_ESWA}, author = {Zian Chen and Bao Qing Hu}, doi = {10.1016/j.eswa.2025.129431}, journal = {Expert Systems with Applications}, month = {3}, pages = {129431}, shortjournal = {Expert Syst. Appl.}, title = {Improved DQN-based recommender system on three-way decision}, volume = {298}, year = {2026}, }
• (2026). IntegralGP: Volumetric estimation of subterranean geochemical properties in mineral deposits by fusing assay data with different spatial supports. ESWA, 298, 129429. (www)

  @article{ , abstract = {This article presents an Integral Gaussian Process (IntegralGP) framework for volumetric estimation of subterranean properties in mineral deposits. It provides a unified representation for data with different spatial supports, which enables blasthole geochemical assays to be properly modelled as interval observations rather than points. This approach is shown to improve regression performance and boundary delineation. A core contribution is a description of the mathematical changes to the covariance expressions which allow these benefits to be realised. The gradient and anti-derivatives are obtained to facilitate learning of the kernel hyperparameters. Numerical stability issues are also discussed. To illustrate its application, an IntegralGP data fusion algorithm is described. The objective is to assimilate line-based blasthole assays and update a block model that provides long-range prediction of Fe concentration beneath the drilled bench. Heteroscedastic GP is used to fuse chemically compatible but spatially incongruous data with different resolutions and sample spacings. Domain knowledge embodied in the structure and empirical distribution of the block model must be generally preserved while local inaccuracies are corrected. Using validation measurements within the predicted bench, our experiments demonstrate an improvement in bench-below grade prediction performance. For material classification, IntegralGP fusion reduces the absolute error and model bias in categorical prediction, especially instances where waste blocks are mistakenly classified as high-grade.}, archive = {J_ESWA}, author = {Anna Chlingaryan and Arman Melkumyan and Raymond Leung}, doi = {10.1016/j.eswa.2025.129429}, journal = {Expert Systems with Applications}, month = {3}, pages = {129429}, shortjournal = {Expert Syst. Appl.}, title = {IntegralGP: Volumetric estimation of subterranean geochemical properties in mineral deposits by fusing assay data with different spatial supports}, volume = {298}, year = {2026}, }
• (2026). Deep multi-view least squares support vector machine with consistency and complementarity principle based on cross-output knowledge transfer. ESWA, 298, 129406. (www)

  @article{ , abstract = {This article presents a Deep Multi-view Least Squares Support Vector Machine with Consistency and Complementarity Principles based on Cross-Output Knowledge Transfer (MDCTM), which has four distinctive features: 1) It integrates the idea of deep stacking architecture, which is the first attempt to use transfer learning to form deep architectures in multi-view learning. It can enhance the ability to handle complex problems. Starting from the second layer, it incorporates extra input attributes that consider the predictions made by all preceding layers, effectively revealing the manifold structure of the original data. 2) Each layer follows the consistency and complementarity principles, which can fully excavate the information in multi-view data. In each layer, the model is solved by an alternating optimization strategy. 3) Cross-output knowledge transfer leverages predictions from earlier layers to improve the learning of subsequent ones, which can improve the classification performance of the model. Additionally, the extent of cross-output knowledge transfer between sequential layers can be assessed autonomously and effectively by utilizing a fast leave-one-out cross-validation method. 4) The model allows random assignment of model parameters in each layer, such as weights and kernel widths, boosting learning speed. Numerical experiments demonstrate the model’s effectiveness and efficiency.}, archive = {J_ESWA}, author = {Shuangrui Jia and Sijie Liang and Ziyi Mo and Chunxiao Liu and Huiru Wang and Chen Chen}, doi = {10.1016/j.eswa.2025.129406}, journal = {Expert Systems with Applications}, month = {3}, pages = {129406}, shortjournal = {Expert Syst. Appl.}, title = {Deep multi-view least squares support vector machine with consistency and complementarity principle based on cross-output knowledge transfer}, volume = {298}, year = {2026}, }
• (2026). A study on the modeling of long-term trend and short-term fluctuation: Fourier-enhanced adaptive koopman operator for carbon emission forecasting. ESWA, 298, 129388. (www)

  @article{ , abstract = {The Koopman operator provides a new way to model complex data patterns, revealing the intrinsic dynamics of time series from a dynamical system perspective. Despite its potential, the Koopman operator has received limited attention in time series forecasting, particularly in addressing these complex, real-world challenges such as carbon emission dynamics characterized by nonlinearity, non-stationarity, and multi-scale coupling effects. To this end, this study proposes a novel forecasting paradigm, Fourier-Enhanced adaptive Koopman operator for carbon emission forecasting (F-KOCE). This approach conceptually extends traditional Koopman frameworks by embedding a spectral-decoupled time series representation into a dual Koopman learning structure, which enables the model to linearize nonlinear dynamics across multiple time scales in a theoretically grounded and practically adaptive manner. By integrating Fourier filter decomposition into Koopman operator theory, F-KOCE separates raw emissions into long-term trends and short-term fluctuations while achieving global linearization of system dynamics. A learnable Koopman operator captures intrinsic temporal structures, while a multi-granularity adaptive weight learning strategy enhances resilience against data variability. To further improve robustness, we introduce an adaptive residual fusion structure for block-level feature compression, noise suppression, and cross-scale information fusion. Additionally, the effective Trend Corrector mechanism dynamically modulates the influence of trend and fluctuation components, refining predictive accuracy. Beyond point forecasting, the framework is also extended to interval forecasting, providing uncertainty-aware predictions. Extensive experiments conducted on 36 Carbon Monitor datasets across six regions and six sectors demonstrate the superiority of F-KOCE over advanced existing models across multiple evaluation metrics. These results confirm the framework’s efficacy in capturing high-dimensional emission dynamics and underscore the potential of Koopman operator theory in carbon forecasting. By offering a robust, interpretable, and data-driven approach, F-KOCE provides valuable insights for climate policy formulation.}, archive = {J_ESWA}, author = {Jinxing Che and Wei Dong and Qian Sun and Yuhua Zhang}, doi = {10.1016/j.eswa.2025.129388}, journal = {Expert Systems with Applications}, month = {3}, pages = {129388}, shortjournal = {Expert Syst. Appl.}, title = {A study on the modeling of long-term trend and short-term fluctuation: Fourier-enhanced adaptive koopman operator for carbon emission forecasting}, volume = {298}, year = {2026}, }
• (2026). A cooperative co-evolutionary algorithm with core-based grouping strategy for large-scale 0–1 knapsack problems. ESWA, 298, 129364. (www)

  @article{ , abstract = {The 0–1 knapsack problem (KP) is a well-known combinatorial optimization problem with wide real-world applications. While evolutionary algorithms have demonstrated promise in solving 0–1 KPs, their performance deteriorates as the problem dimension increases. Cooperative co-evolution (CC) is an algorithmic framework based on a divide-and-conquer strategy, which has been used in solving large-scale optimization problems. Inspired by the similarity between item grouping in the 0–1 KP and decomposition strategies in CC, this paper proposes a novel grouping strategy that uses the position information of break items and profit-to-weight ratio to solve large-scale 0–1 KP. The strategy aims to divide the large-scale 0–1 KP into multiple subproblems, thus having a reduced search space for each subproblem. To enhance population diversity and search efficiency, the profit-to-weight ratio is used to generate an initial elite population. Additionally, to obtain the complete solution for the original large-scale KP, a subgroup merging method is designed to accelerate convergence and further improve population diversity. A three-phase repair operator is developed to fix infeasible solutions directly to create more feasible solutions. The resulting cooperative co-evolutionary algorithm is compared with ten state-of-the-art algorithms for solving 0–1 KPs with variables ranging from 100 to 5,000, including EAs, CC-based approaches, and a deep reinforcement learning method. Experimental results show that the proposed algorithm exhibits higher solution accuracy and faster convergence than other competing algorithms. The CC framework takes considerably less running time than high-performing algorithms, providing an overall novel approach for solving large-scale 0–1 KPs.}, archive = {J_ESWA}, author = {Xiaotong Li and Shuwei Zhu and Wei Fang and Kalyanmoy Deb}, doi = {10.1016/j.eswa.2025.129364}, journal = {Expert Systems with Applications}, month = {3}, pages = {129364}, shortjournal = {Expert Syst. Appl.}, title = {A cooperative co-evolutionary algorithm with core-based grouping strategy for large-scale 0–1 knapsack problems}, volume = {298}, year = {2026}, }
• (2026). Life cycle cost reliability assessment for strategic real estate decision-making. ESWA, 298, 129329. (www)

  @article{ , abstract = {Many real estate projects prioritize minimizing initial development costs while often overlooking the long-term financial implications of their decisions. This short-term focus frequently leads to increased operational, maintenance, and renewal expenses, ultimately reducing overall profitability. Life Cycle Costing (LCC) provides a comprehensive approach to evaluating total project costs over time; however, its adoption remains limited due to challenges such as data constraints, uncertainty about future cost savings, and the lack of standardized performance measurement tools. To tackle these issues, this paper proposes a structured LCC reliability assessment model designed for real estate decision-makers. The model systematically identifies and analyzes key cost factors across all project phases, including construction, operation, renewal, maintenance, and end-of-life, while integrating technical, economic, environmental, and social dimensions. A structured survey was employed to quantify and prioritize these cost factors, facilitating the development of category-specific LCC models and a standardized evaluation framework. Additionally, a benchmarking scale was created to measure the reliability of input factors. Although this study emphasizes the reliability dimension, it establishes a foundation for the future integration of an optimization module to enhance decision-making and maximize life cycle cost efficiency. The proposed model has been automated to improve usability and accessibility, allowing stakeholders to make informed investment decisions that promote long-term financial sustainability in real estate development.}, archive = {J_ESWA}, author = {Elin A. Eldars and Amin A. Sorour}, doi = {10.1016/j.eswa.2025.129329}, journal = {Expert Systems with Applications}, month = {3}, pages = {129329}, shortjournal = {Expert Syst. Appl.}, title = {Life cycle cost reliability assessment for strategic real estate decision-making}, volume = {298}, year = {2026}, }
• (2026). Balancing forecast accuracy and switching costs in online optimization of energy management systems. ESWA, 298, 129305. (www)

  @article{ , abstract = {This study investigates the integration of forecasting and optimization in energy management systems, focusing on how switching costs, penalties incurred from frequent operational adjustments, affect the balance between forecast accuracy and stability in online decision-making. We develop a theoretical framework analyzing Fixed Horizon Control (FHC) algorithms under switching costs, deriving performance bounds that reveal trade-offs between commitment periods and forecast properties. We introduce a novel Scenario Distribution Change (SDC) metric for measuring temporal consistency in probabilistic forecasts. The framework is validated through empirical evaluation using a real-world battery scheduling case study based on the CityLearn 2022 challenge, comparing deterministic and stochastic optimization approaches across different commitment periods. Theoretical analysis reveals that switching costs create a U-shaped relationship between commitment period and performance, with optimal commitment depending on forecast stability. Empirical results demonstrate that switching costs significantly alter the accuracy-stability trade-off: while traditional approaches favor frequent updates (1-hour commitment), incorporating switching costs makes longer commitment periods (3+ hours) optimal when combined with stable forecasts. Stochastic optimization with scenario averaging reduces forecast error sensitivity by up to 2.9 % in grid costs compared to deterministic approaches. This work contributes the first theoretical bounds linking forecast stability to switching costs in energy systems, the SDC metric for evaluating probabilistic forecast stability, empirical evidence that longer commitment periods can outperform frequent updates under switching costs, and practical guidelines showing that forecast stability should be factored into decision-making frameworks for energy management systems in the presence of switching costs.}, archive = {J_ESWA}, author = {Evgenii Genov and Julian Ruddick and Christoph Bergmeir and Majid Vafaeipour and Thierry Coosemans and Salvador García and Maarten Messagie}, doi = {10.1016/j.eswa.2025.129305}, journal = {Expert Systems with Applications}, month = {3}, pages = {129305}, shortjournal = {Expert Syst. Appl.}, title = {Balancing forecast accuracy and switching costs in online optimization of energy management systems}, volume = {298}, year = {2026}, }
• (2026). A hybrid bee colony algorithm for crack repair trajectory planning based on focal attention guided lightweight segmentation. ESWA, 298, 129267. (www)

  @article{ , abstract = {Robotic arm trajectory planning of crack repair is critical for automated road maintenance. However, existing crack repair face two main challenges: loss of trajectory edge information and redundant planned distances. This study introduces an automated pavement crack repair system that integrates a lightweight crack segmentation model (Lightweight Focal Modulation, LFM-Net) and a repair trajectory planning algorithm (Fixed Neighborhood Search-Artificial Bee Colony, FNS-ABC). Specifically, LFM-Net incorporates conformer-based focal modulation attention (CFMA), enhancing the detailed information during the decoding phase. Additionally, the FNS-ABC enhances the ABC algorithm by incorporating a fixed neighborhood search strategy, effectively reducing redundant planning paths. The system is executed using a self-developed robotic arm with an edge computing unit. Extensive testing in three typical road scenarios-independent cracks, intersection cracks, and complex cracks-demonstrated that the system achieved a mean Intersection over Union (mIoU) of 83.93 %. Finally, the system exhibited an idle trajectory of 79.51 mm when addressing complex cracks, highlighting its superior performance in repair trajectory planning.}, archive = {J_ESWA}, author = {Jianqi Zhang and Xu Yang and Wei Wang and Yuhang Zhao and Hainian Wang and Yixue Chen}, doi = {10.1016/j.eswa.2025.129267}, journal = {Expert Systems with Applications}, month = {3}, pages = {129267}, shortjournal = {Expert Syst. Appl.}, title = {A hybrid bee colony algorithm for crack repair trajectory planning based on focal attention guided lightweight segmentation}, volume = {298}, year = {2026}, }
• (2026). Deep-learning based big data analysis for developing a smart supply chain for increased efficiency. ESWA, 298, 129246. (www)

  @article{ , abstract = {Big data analysis (BDA) in supply chain management (SCM) is receiving growing attention in the present business environment. This is due to the fact that BDA has a wide range of applications in SCM, including customer behaviour analysis, trend analysis, and demand prediction. The increase in information volume has caused the efficiency and effectiveness of traditional procedures to decline, considering this, researchers have developed techniques that have a high capacity to investigate and comprehend vast amounts of data due to the limitations of these tactics in dissecting and interpreting a lot of information. This study represents a hybrid paper that combines a systematic literature review, a methodological proposal using BP neural networks. The main objective of this paper is to recognize the uses of deep learning in SCM. By fostering a calculated system, this paper recognizes the commitments of deep learning strategies in choosing and sectioning providers, foreseeing store network gambles, and assessing requests and deals, creation, stock administration, transportation and circulation, manageable turn of events, and roundabout economy. The novelty in this paper is the Backpropagation (BP) neural networks with big data-driven demand forecasting in supply chains. This method can improve the accuracy of demand forecasting in supply chain management. The study includes a thorough survey of the applications of predictive BDA in SC request gauging. The review highlighted the BDA methodologies used for production network request estimation and comparatively classified them. We collected and analysed these studies as tactics and methodologies for the popular forecast. Seven standard tactics were selected and studied, along with their benefits and drawbacks. Finally, the box-cox transformation representation over years in which for the year 2011–01, it starts with a box-cox value of 9.7 and it inclined till 2011–06 and then declined very exponentially in 2012–07 at 9 and then it keeps on incrementing and reached at 11 at the year 2013–07. Then from 2014 to 2015, the pattern didn’t lower below the box-cox value 10.}, archive = {J_ESWA}, author = {Sreekumar Narayanan and Sudhir Ramadass and K. Thilagavathi and Rajiv Kumar}, doi = {10.1016/j.eswa.2025.129246}, journal = {Expert Systems with Applications}, month = {3}, pages = {129246}, shortjournal = {Expert Syst. Appl.}, title = {Deep-learning based big data analysis for developing a smart supply chain for increased efficiency}, volume = {298}, year = {2026}, }

IANDC - 14

• (2025). Unbounded quantum-classical separation in sample complexity for sphere center finding. IANDC, 307, 105361. (www)

  @article{ , abstract = {Fast quantum algorithms can solve important computational problems more efficiently than classical algorithms. However, little is known about whether quantum computing can speed up solving geometric problems. This article explores quantum advantages for the problem of finding the center of a sphere in vector spaces over finite fields, given samples of random points on the sphere. We prove that any classical algorithm for this task requires approximately as many samples as the dimension of the vector space, by a reduction to an old and basic algebraic result—Warning's second theorem. On the other hand, we propose a quantum algorithm based on quantum walks that needs only a constant number of samples to find the center. Thus, an unbounded quantum advantage is revealed for a natural and intuitive geometric problem, which highlights the power of quantum computing in solving geometric problems.}, archive = {J_IANDC}, author = {Guanzhong Li and Lvzhou Li}, doi = {10.1016/j.ic.2025.105361}, journal = {Information and Computation}, month = {11}, pages = {105361}, shortjournal = {Inf. Comput.}, title = {Unbounded quantum-classical separation in sample complexity for sphere center finding}, volume = {307}, year = {2025}, }
• (2025). Assumptions of randomness in cosmology models. IANDC, 307, 105359. (www)

  @article{ , abstract = {Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the “Copernican” random choice of the place of the observer in infinite cosmology models. This problem may be circumvented with what topologists call pointed spaces . Then randomness will be used only in building (infinite) models around the pre-designated “observance point”, that thus would not need to be randomly chosen. Additional complications come from the original randomness possibly being hidden. P. Gacs and A. Kucera proved that every sequence can be algorithmically generated from a random one. But Vladimir V'yugin discovered that randomized algorithms can with positive probability generate uncomputable sequences not algorithmically equivalent to any random ones.}, archive = {J_IANDC}, author = {Leonid A. Levin}, doi = {10.1016/j.ic.2025.105359}, journal = {Information and Computation}, month = {11}, pages = {105359}, shortjournal = {Inf. Comput.}, title = {Assumptions of randomness in cosmology models}, volume = {307}, year = {2025}, }
• (2025). Intersection and union hierarchies of deterministic context-free languages and pumping lemmas. IANDC, 307, 105358. (www)

  @article{ , abstract = {We study the computational complexity of finite intersections and finite unions of deterministic context-free (dcf) languages. Earlier, Wotschke [J. Comput. System Sci. 16 (1978) 456–461] demonstrated that intersections of ( d + 1 ) dcf languages are in general more powerful than intersections of d dcf languages for any positive integer d based on the separation result of the intersection hierarchy of Liu and Weiner [Math. Systems Theory 7 (1973) 185–192]. The argument of Liu and Weiner, however, works only on bounded languages of particular forms, and therefore Wotschke's result is not directly extendable to other non-bounded languages. To deal with a wide range of languages for the non-membership to the intersection hierarchy, we circumvent the specialization of their proof technics and devise a new and practical technical tool: two pumping lemmas for finite unions of dcf languages. Since the family of dcf languages is closed under complementation and also under intersection with regular languages, these pumping lemmas help us establish the non-membership relation of languages formed by finite intersections of target languages. We also concern ourselves with a relationship to deterministic limited automata of Hibbard [Inf. Control 11 (1967) 196–238] in this regard.}, archive = {J_IANDC}, author = {Tomoyuki Yamakami}, doi = {10.1016/j.ic.2025.105358}, journal = {Information and Computation}, month = {11}, pages = {105358}, shortjournal = {Inf. Comput.}, title = {Intersection and union hierarchies of deterministic context-free languages and pumping lemmas}, volume = {307}, year = {2025}, }
• (2025). K-universality of regular languages. IANDC, 307, 105357. (www)

  @article{ , abstract = {A subsequence of a word w is a word u such that u = w [ i 1 ] w [ i 2 ] … w [ i k ] , for some set of indices 1 ≤ i 1 < i 2 < … < i k ≤ | w | . A word w is k -subsequence universal over an alphabet Σ if every word in Σ k appears in w as a subsequence. In this paper, we study the intersection between the set of k -subsequence universal words over some alphabet Σ and regular languages over Σ. We call a regular language L k- ∃ -subsequence universal if there exists a k -subsequence universal word in L , and k- ∀ -subsequence universal if every word of L is k -subsequence universal. We give algorithms solving the problems of deciding if a given regular language, represented by a finite automaton recognising it, is k- ∃ -subsequence universal and, respectively, if it is k- ∀ -subsequence universal , for a given k . The algorithms are FPT w.r.t. the size of the input alphabet, and their run-time does not depend on k ; they run in polynomial time in the number n of states of the input automaton when the size of the input alphabet is O ( log ⁡ n ) . Moreover, we show that the problem of deciding if a given regular language is k- ∃ -subsequence universal is NP-complete, when the language is over a large alphabet. Further, we provide algorithms for counting the number of k -subsequence universal words (paths) accepted by a given deterministic (respectively, non-deterministic) finite automaton, and ranking an input word (path) within the set of k -subsequence universal words accepted by a given finite automaton.}, archive = {J_IANDC}, author = {Duncan Adamson and Pamela Fleischmann and Annika Huch and Tore Koß and Florin Manea and Dirk Nowotka}, doi = {10.1016/j.ic.2025.105357}, journal = {Information and Computation}, month = {11}, pages = {105357}, shortjournal = {Inf. Comput.}, title = {K-universality of regular languages}, volume = {307}, year = {2025}, }
• (2025). Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution. IANDC, 307, 105356. (www)

  @article{ , abstract = {This paper advances the state of the art in the dynamic controllability (DC) and dispatchability of Simple Temporal Networks with Uncertainty (STNUs) through four key contributions. First, findSRNC is an algorithm that identifies semi-reducible negative cycles in non-dynamically controllable STNUs. Running in O ( m n + k 2 n + k n log ⁡ n ) time (matching the fastest DC-checking algorithms), it handles repeated edges and uses polynomial space, even when cycles might contain exponentially many edges. Second, minDisp ESTNU + is an algorithm that improves dispatchability computation for STNUs from O ( k n 3 ) to O ( n 3 + k 2 n log ⁡ n ) time. It outputs dispatchable Extended STNUs (ESTNUs) having minimal numbers of edges, which is crucial for subsequent real-time execution. Third, the Canonical Form of Nested Diamond Structures in Dispatchable ESTNUs is a rigorous theory that facilitates correctness proofs for dispatchability algorithms. It also helped reveal and correct a flaw in a previously published algorithm. Fourth, our empirical evaluation using improved open-source implementations demonstrates the practical effectiveness of our algorithms. These contributions address fundamental computational bottlenecks in temporal planning systems, enabling more efficient reasoning about uncertain timing constraints while providing real-time guarantees required for robotics, scheduling, and automated planning applications.}, archive = {J_IANDC}, author = {Luke Hunsberger and Roberto Posenato}, doi = {10.1016/j.ic.2025.105356}, journal = {Information and Computation}, month = {11}, pages = {105356}, shortjournal = {Inf. Comput.}, title = {Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution}, volume = {307}, year = {2025}, }
• (2025). Polynomial turing compressions for some graph problems parameterized by modular-width. IANDC, 307, 105355. (www)

  @article{ , abstract = {A polynomial Turing compression (PTC) for a parameterized problem L is a polynomial time Turing machine that has access to an oracle for a problem L ′ such that a polynomial in the input parameter bounds each query. Meanwhile, a polynomial compression (PC) can be regarded as a restricted variant of PTC where the machine can query the oracle exactly once and must output the same answer as the oracle. Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) initiated an impressive hardness theory for PC under the assumption coNP ⊈ NP/poly. Let C be the set of all problems with PTCs but without PCs assuming coNP ⊈ NP/poly. Fernau et al. (STACS 2009) identified Leaf Out-tree( k ) as the first problem in C . However, little is known about C , with only a dozen problems confirmed in it over the last fifteen years. Open questions remain, such as whether CNF-SAT( n ) and k -path are in C , requiring novel ideas to clarify the differences between PTCs and PCs. In this paper, we enrich our knowledge about C by demonstrating that 17 problems parameterized by modular-width ( mw ), such as Chromatic Number( mw ) and Hamiltonian Cycle( mw ) , belong to C . Additionally, we develop a general recipe to prove the existence of PTCs for a class of problems, including these 17.}, archive = {J_IANDC}, author = {Weidong Luo}, doi = {10.1016/j.ic.2025.105355}, journal = {Information and Computation}, month = {11}, pages = {105355}, shortjournal = {Inf. Comput.}, title = {Polynomial turing compressions for some graph problems parameterized by modular-width}, volume = {307}, year = {2025}, }
• (2025). On cardinalities of rogers semilattices for families in the ershov hierarchy. IANDC, 307, 105354. (www)

  @article{ , abstract = {The theory of numberings provides classification results for families of sets in various computability-theoretic hierarchies. The algorithmic content of numberings is typically calibrated via the reducibility between numberings. For a given family of sets S , this reducibility gives rise to an upper semilattice of degrees that is often called the Rogers semilattice of S . This paper studies the cardinalities of Rogers semilattices for families of sets at finite levels of the Ershov hierarchy. The classical result of Khutoretskii (1971) shows that the Rogers semilattice of a family of c.e. sets is either one-element or countably infinite. Badaev and Lempp (2009) constructed a family of d.c.e. sets that demonstrates that the methods of Khutoretskii cannot be applied to obtain a similar result for Rogers semilattices already at the second level of the Ershov hierarchy. We prove that for any finite family of sets S at any finite level of the Ershov hierarchy, the corresponding Rogers semilattice is either one-element or countably infinite. We also obtain another sufficient condition for a Rogers semilattice to be infinite. This condition implies that the Rogers semilattice of Badaev and Lempp is also infinite.}, archive = {J_IANDC}, author = {Keng Meng Ng and Nikolay Bazhenov and Birzhan Kalmurzayev and Dias Nurlanbek}, doi = {10.1016/j.ic.2025.105354}, journal = {Information and Computation}, month = {11}, pages = {105354}, shortjournal = {Inf. Comput.}, title = {On cardinalities of rogers semilattices for families in the ershov hierarchy}, volume = {307}, year = {2025}, }
• (2025). Exact counting of subtrees with diameter no more than d in trees: A generating function approach. IANDC, 307, 105353. (www)

  @article{ , abstract = {Network motifs, regarded as fundamental building blocks, offer crucial insights into the structure and function of complex networks, with broad applications across disciplines including sociology, computer science, bioinformatics, chemoinformatics, and pharmaceutics. However, the identification of network motifs remains a significant and computationally challenging problem. Among various motifs, subtree enumeration has garnered substantial attention in recent years, particularly due to its relevance in network science and bioinformatics. For an n -vertex tree T , by introducing novel generating functions with ( d + 2 ) variables, we propose an innovative algorithm for the exact enumeration of T 's subtrees rooted at fixed vertex v , where the distance between v and the farthest leaf is k = 0 , 1 , … , d , and the distance between any two leaves is no more than d . Building on this algorithm, we develop novel recursive algorithms for exact enumerating various diameter no more than d subtrees (abbreviated as DNMT- d subtrees) of T . As applications, we apply these algorithms to derive the number of DNMT- d subtrees in a full binary tree B h with h ≥ 2 levels, and briefly discuss the density of DNMT- d subtrees in general trees. Our research generalizes the work of Frank Ruskey on Listing and Counting Subtrees of a Tree in 1981 and makes it a special case of our study where d equals the diameter of the tree T . Moreover, the proposed O ( d n 2 ) algorithms introduce new approaches for enumerating subtrees under diameter constraints and lay the groundwork for counting diameter-constrained subgraphs (motifs) in complex networks.}, archive = {J_IANDC}, author = {Yu Yang and Bang-Bang Jin and Xiaoming Sun and Xiao-Dong Zhang and Bo Li and Kai Zhao and Hua Wang}, doi = {10.1016/j.ic.2025.105353}, journal = {Information and Computation}, month = {11}, pages = {105353}, shortjournal = {Inf. Comput.}, title = {Exact counting of subtrees with diameter no more than d in trees: A generating function approach}, volume = {307}, year = {2025}, }
• (2025). Decision problems for systems of language equations and inequations. IANDC, 307, 105344. (www)

  @article{ , abstract = {Systems of language equations φ ( X 1 , … , X n ) = ψ ( X 1 , … , X n ) and inequations φ ( X 1 , … , X n ) ≠ ψ ( X 1 , … , X n ) are studied, where φ and ψ may contain Boolean operations and concatenation. It is proved that the problem whether such a system has a solution is Σ 2 0 -complete in the arithmetical hierarchy (cf. the earlier studied case of equations only, where it is co-r.e.-complete), the problem whether it has a unique solution is in Σ 3 0 ∩ Π 3 0 , and is both Σ 2 0 -hard and Π 2 0 -hard, existence of a finite or regular solution is an r.e.-complete problem, while testing whether a system has finitely many solutions is Σ 3 0 -complete. Furthermore, it is shown that the class of languages representable by unique solutions of such systems is exactly the class of recursive sets, but decision procedures for the set cannot be algorithmically constructed out of a system. All results hold already for equations over a unary alphabet.}, archive = {J_IANDC}, author = {Alexander Okhotin}, doi = {10.1016/j.ic.2025.105344}, journal = {Information and Computation}, month = {11}, pages = {105344}, shortjournal = {Inf. Comput.}, title = {Decision problems for systems of language equations and inequations}, volume = {307}, year = {2025}, }
• (2025). Towards a theoretical understanding of why local search works for clustering with fair-center representation. IANDC, 307, 105343. (www)

  @article{ , abstract = {The representative k -median problem generalizes the classical clustering formulations in that it partitions the data points into ℓ disjoint demographic groups and imposes a lower-bound constraint on the number of opened facilities from each group, such that all the groups are fairly represented by the opened facilities. Due to its simplicity, the local-search heuristic, which iteratively swaps a bounded number of closed facilities for the same number of opened ones to improve the solution, has been frequently used in the representative k -median problem. It is known that the local-search heuristic, when restricted to constant-size swaps, yields a constant-factor approximation if ℓ = 2 , and has an unbounded approximation ratio if ℓ is super-constant. However, for any constant ℓ > 2 , the existence of a constant-factor approximation under constant-size swaps remained an open question for a long time. In response to this question, we demonstrate that the local-search heuristic guarantees a ( 4 ℓ + 5 ) -approximation when up to ℓ ( ℓ + 1 ) facilities are allowed to be swapped in each iteration, thus providing an affirmative answer to the question. Our main technical contribution is a novel approach for theoretically analyzing the local-search heuristic, which bounds its approximation ratio by linearly combining the clustering cost increases induced by a set of hierarchically organized swaps. Our techniques also generalize to the k -means clustering formulation and reveal similar approximation guarantees for the local-search heuristic.}, archive = {J_IANDC}, author = {Zhen Zhang and Junfeng Yang and Limei Liu and Xuesong Xu and Guozhen Rong and Qilong Feng}, doi = {10.1016/j.ic.2025.105343}, journal = {Information and Computation}, month = {11}, pages = {105343}, shortjournal = {Inf. Comput.}, title = {Towards a theoretical understanding of why local search works for clustering with fair-center representation}, volume = {307}, year = {2025}, }
• (2025). The billaud conjecture for alphabet size 4. IANDC, 307, 105342. (www)

  @article{ , abstract = {The Billaud Conjecture, first stated in 1993, is a fundamental problem on finite words and their heirs, i.e., the words obtained by a projection deleting a single letter. The conjecture states that every morphically primitive word, i.e., a word that is not a fixed point of any non-identity morphism, has at least one morphically primitive heir. The correctness of the conjecture has so far been established in a few special cases, which mainly restrict the alphabet size. In this paper we give a proof for the next such case, i.e., for alphabet size 4.}, archive = {J_IANDC}, author = {Szymon Łopaciuk and Daniel Reidenbach}, doi = {10.1016/j.ic.2025.105342}, journal = {Information and Computation}, month = {11}, pages = {105342}, shortjournal = {Inf. Comput.}, title = {The billaud conjecture for alphabet size 4}, volume = {307}, year = {2025}, }
• (2025). The g-good-neighbor diagnosability of product networks under the PMC model. IANDC, 307, 105341. (www)

  @article{ , abstract = {The concept of neighbor connectivity originated from the assessment of the subversion of espionage networks caused by underground resistance movements, and it has now been applied to measure the disruption of networks caused by cascading failures through neighbors. In this paper, we give two necessary and sufficient conditions of the existence of g -good-neighbor diagnosability. We introduce a new concept called g -good neighbor cut-component number (gc number for short), which has close relation with g -good-neighbor diagnosability. Sharp lower and upper bounds of the gc number of general graphs in terms of the g -good neighbor connectivity have been proposed, which provide a formula to compute the g -good-neighbor diagnosability for general graphs (therefore for Cartesian product graphs). As their applications, we get the exact values or bounds for the gc numbers and g -good-neighbor diagnosability of grid, torus networks and generalized cubes.}, archive = {J_IANDC}, author = {Zhao Wang and Yaping Mao and Sun-Yuan Hsieh and Ralf Klasing}, doi = {10.1016/j.ic.2025.105341}, journal = {Information and Computation}, month = {11}, pages = {105341}, shortjournal = {Inf. Comput.}, title = {The g-good-neighbor diagnosability of product networks under the PMC model}, volume = {307}, year = {2025}, }
• (2025). Two-state spin systems with negative interactions. IANDC, 307, 105340. (www)

  @article{ , abstract = {We study the approximability of computing the partition functions of two-state spin systems. The problem is parameterized by a 2 × 2 symmetric matrix. Previous results on this problem were restricted either to the case where the matrix has non-negative entries, or to the case where the diagonal entries are equal, i.e. Ising models. In this paper, we study the generalization to arbitrary 2 × 2 interaction matrices with real entries. We show that in some regions of the parameter space, it's #P-hard to even determine the sign of the partition function, while in other regions there are fully polynomial approximation schemes for the partition function. Our results reveal several new computational phase transitions.}, archive = {J_IANDC}, author = {Yumou Fei and Leslie Ann Goldberg and Pinyan Lu}, doi = {10.1016/j.ic.2025.105340}, journal = {Information and Computation}, month = {11}, pages = {105340}, shortjournal = {Inf. Comput.}, title = {Two-state spin systems with negative interactions}, volume = {307}, year = {2025}, }
• (2025). Competition among parallel contests. IANDC, 307, 105339. (www)

  @article{ , abstract = {We investigate the model of multiple rank-order contests held in parallel, where each contestant only selects one contest to join and each contest designer decides the prize structure to compete for the participation of contestants. We first analyze the strategic behaviors of contestants and completely characterize the symmetric Bayesian Nash equilibrium. As for the strategies of contest designers, when other designers' strategies are known, we show that computing the best response is NP-hard and propose a fully polynomial time approximation scheme to output the ϵ -approximate best response. When other designers' strategies are unknown, we provide a worst-case analysis on one designer's strategy. We give an upper bound on the worst-case utility of any strategy and propose a method to construct a strategy whose utility can guarantee a constant ratio of this upper bound in the worst case.}, archive = {J_IANDC}, author = {Xiaotie Deng and Ningyuan Li and Weian Li and Qi Qi}, doi = {10.1016/j.ic.2025.105339}, journal = {Information and Computation}, month = {11}, pages = {105339}, shortjournal = {Inf. Comput.}, title = {Competition among parallel contests}, volume = {307}, year = {2025}, }

ICV - 28

• (2025). EDFusion: Edge-guided attention and dynamic receptive field with dense residual for multi-focus image fusion. ICV, 163, 105763. (www)

  @article{ , abstract = {Multi-focus image fusion (MFIF) synthesizes a fully focused image by integrating multiple partially focused images captured at distinct focal planes of the same scene. However, existing methods often fall short in preserving edge and texture details. To address this issue, this paper proposes a network for multi-focus image fusion that incorporates edge-guided attention and dynamic receptive field dense residuals. The network employs a specially designed dynamic receptive field dense residual block (DRF-DRB) to achieve adaptive multi-scale feature extraction, providing rich contextual information for subsequent fine fusion. Building on this, an edge-guided fusion module (EGFM) explicitly leverages the differences in source images as edge priors to generate dedicated weight maps for each feature channel, enabling precise boundary preservation. To efficiently model global dependencies, we introduce a multi-scale token mixing transformer (MSTM-Transformer), designed to reduce computational complexity while enhancing cross-scale semantic interactions. Finally, a refined multi-scale context upsampling module (MSCU) reconstructs high-frequency details. Experiments were conducted on five public datasets, comparing against twelve state-of-the-art methods and evaluated using nine metrics. Both quantitative and qualitative results demonstrate that the proposed method significantly outperforms existing approaches in fusion performance. Notably, on the Lytro dataset, the proposed method ranked first across eight core metrics, achieving high scores of 1.1946 in the information preservation metric ( Q N M I ) and 0.7629 in the edge information fidelity metric ( Q A B / F ).}, archive = {J_ICV}, author = {Hao Zhai and Zhendong Xu and Zhi Zeng and Lei Yu and Bo Lin}, doi = {10.1016/j.imavis.2025.105763}, journal = {Image and Vision Computing}, month = {11}, pages = {105763}, shortjournal = {Image Vis. Comput.}, title = {EDFusion: Edge-guided attention and dynamic receptive field with dense residual for multi-focus image fusion}, volume = {163}, year = {2025}, }
• (2025). GNN-based primitive recombination for compositional zero-shot learning. ICV, 163, 105762. (www)

  @article{ , abstract = {Compositional Zero-Shot Learning (CZSL) aims to recognize unseen attribute–object combinations, with the core challenge being the complex visual manifestations across compositions. We posit that the key to address this challenge lies in enabling models to simulate human recognition processes by decomposing and dynamically recombining primitives (attributes and objects). Existing methods merely concatenate primitives after extraction to form new combinations, without achieving deep integration between attributes and objects to create truly novel compositions. To address this issue, we propose Graph Neural Network-based Primitive Recombination (GPR) framework. This framework innovatively designs a Primitive Recombination Module (PRM) based on the Compositional Matching Module (CMM). Specifically, we first extract primitives, and build independent attribute and object space based on the CLIP model, enabling more precise learning of primitive-level visual features and reducing information residuals. Additionally, we introduce a Virtual Composition Unit (VCU), which inputs optimized primitive features as nodes into GNN and models complex interaction relationships between attributes and objects through message propagation. The module performs mean pooling on the updated node features to obtain a recombined representation and fuses the global visual information from the original image through residual connections, generating semantically rich virtual compositional features while preserving key visual cues. We conduct extensive experiments on three CZSL benchmark datasets to show that GPR achieves state-of-the-art or competitive performance in both closed-world and open-world settings.}, archive = {J_ICV}, author = {Fuqin Deng and Caiyun Tang and Lanhui Fu and Wei Jin and Jiaming Zhong and Hongming Wang and Nannan Li}, doi = {10.1016/j.imavis.2025.105762}, journal = {Image and Vision Computing}, month = {11}, pages = {105762}, shortjournal = {Image Vis. Comput.}, title = {GNN-based primitive recombination for compositional zero-shot learning}, volume = {163}, year = {2025}, }
• (2025). Leveraging spatial-channel attention in U-net for enhanced segmentation of martian dust storms. ICV, 163, 105754. (www)

  @article{ , abstract = {Automated detection of Martian dust storms is critical for analyzing planetary climate dynamics, yet segmentation remains challenging due to diffuse storm boundaries and data artifacts. This study presents a Convolutional Block Attention Module-enhanced (CBAM-enhanced) U-Net architecture for dust storm segmentation using Mars Reconnaissance Orbiter (MRO) MARCI Mars Daily Global Maps (MDGMs) from the Mars Dust Activity Database (MDAD v1.1). The approach combines attention-driven feature refinement with class-imbalance mitigation and a patching strategy to handle missing data in global maps. The model achieves 0.6502 Intersection over Union (IoU) and 0.6883 Dice scores on MDAD data, outperforming baseline U-Net by 3%, while using 8x fewer parameters (1.95M vs 23M) in comparison to state-of-the-art methods, significantly reducing computational costs. Ablation experiments confirm CBAM reduces false positives and preserves fine boundaries; case studies show the model, in some cases, detects sub-visual dust features missed in ground truth annotations, suggesting potential utility for discovering marginal atmospheric phenomena. This work establishes an efficient framework for processing planetary image data while balancing accuracy and computational practicality.}, archive = {J_ICV}, author = {Daniele Venturini and Marco Raoul Marini and Luigi Cinque and Gian Luca Foresti}, doi = {10.1016/j.imavis.2025.105754}, journal = {Image and Vision Computing}, month = {11}, pages = {105754}, shortjournal = {Image Vis. Comput.}, title = {Leveraging spatial-channel attention in U-net for enhanced segmentation of martian dust storms}, volume = {163}, year = {2025}, }
• (2025). Modified ResNet model for medical image-based lung cancer detection. ICV, 163, 105752. (www)

  @article{ , abstract = {Lung cancer is still the most common cause of tumor death in the world. Therefore, there is a great demand to develop diagnostic tools for lung cancer. This research proposes a diagnostically tuned modified ResNet 50 model for detecting and diagnosing lung cancer from chest X-ray images. The architecture of ResNet 50 is adapted to be more suitable for the unique challenges presented by medical imaging data. The modifications include adding extra batch normalization layers for stabilizing training, replacing fully connected layers with global average pooling to reduce overfitting, and adding a squeeze-and-excitation (SE) block that enhances the model's focus on key features such as nodules and lesions. Furthermore, transfer learning was performed on the pre-trained ResNet 50 weights, and the model was fine-tuned to the dataset of images of lungs for better sensitivity regarding cancerous patterns. This modified ResNet 50 was evaluated on a publicly available dataset of lung images from the JSRT dataset, which outperforms the original ResNet 50 and state-of-the-art research. The proposed model achieves high sensitivity, specificity, precision, F1-score and accuracy, which are considered the most important factors in clinical settings. Accuracy reached as high as 98.77% in the detection of lung cancer, as shown by the results. The results also show that the modified ResNet model can be a highly reliable and efficient tool for the early detection of lung cancer. As a result, the improved architecture leads to better diagnostic accuracy and reduced computational complexity so it can be used in medical imaging with real-time applications.}, archive = {J_ICV}, author = {Zeyad Q. Habeeb and Branislav Vuksanovic and Imad Q. Alzaydi}, doi = {10.1016/j.imavis.2025.105752}, journal = {Image and Vision Computing}, month = {11}, pages = {105752}, shortjournal = {Image Vis. Comput.}, title = {Modified ResNet model for medical image-based lung cancer detection}, volume = {163}, year = {2025}, }
• (2025). MFET: Multi-frequency enhancement transformer for single-image super-resolution. ICV, 163, 105751. (www)

  @article{ , abstract = {Single-Image Super-Resolution (SISR) aims to reconstruct a high-resolution image from a low-resolution input while effectively preserving structural integrity and fine details. However, (i) low-frequency structural cues progressively fade during deep-layer propagation, and (ii) existing upsampling modules either ignore multi-scale context or incur excessive computation, leading to unsatisfactory high-frequency texture recovery. To address these limitations, we propose the Multi-Frequency Enhancement Transformer (MFET), a novel Transformer-based network tailored for efficient SISR. MFET seamlessly integrates low-frequency structural preservation with high-frequency detail recovery through its Multi-Frequency Block (MFB). The MFB employs a Residual Attention Mechanism (RAM) to propagate fine-grained features across layers, ensuring robust retention of low-level details, and an Efficient Upscale Module (EUM) with a pyramidal structure and depthwise separable convolutions to enhance high-frequency components with minimal computational cost. Extensive experiments on benchmark datasets demonstrate that MFET achieves superior performance in PSNR and SSIM, particularly at ×3 and ×4 scales, excelling in texture and edge reconstruction. MFET strikes an optimal balance between quality and efficiency, offering a promising solution for high-quality super-resolution. Our code is available at https://github.com/snh4/MFET .}, archive = {J_ICV}, author = {Yunlei Sun and Pengxiao Shi and Tiancheng Chen and Danning Qi and Ke Xu}, doi = {10.1016/j.imavis.2025.105751}, journal = {Image and Vision Computing}, month = {11}, pages = {105751}, shortjournal = {Image Vis. Comput.}, title = {MFET: Multi-frequency enhancement transformer for single-image super-resolution}, volume = {163}, year = {2025}, }
• (2025). Enhanced crowd counting with weighted attention network and multi-scale feature integration. ICV, 163, 105750. (www)

  @article{ , abstract = {Crowd counting plays a crucial role in the field of computer vision, particularly in practical applications such as traffic monitoring. However, current methods that establish mappings between original images and density maps are not only prone to overfitting but also struggle with occlusion and scale variation in crowded scenes. In this paper, we propose a novel Weighted Attention Focusing Network (WAFNet) to enhance crowd counting performance by decoupling the image-density mapping. Our approach first employs a two-stage model to separate the image density map. It then introduces a weight map, generated by the front-end network, to address the issue of scale variation. Additionally, we incorporate a Multi-Layer Feature Compilation Module (MLFCM) to better preserve and fuse features from multiple layers and adopt a Low-Resolution Feature Enhancement Module (LRFEM) to enhance the low-resolution features of the crowd. Experiments conducted on six benchmark crowd counting datasets demonstrate that our method achieves improved performance, particularly in dense and occluded scenes.}, archive = {J_ICV}, author = {Lifang Zhou and Zhen Hu}, doi = {10.1016/j.imavis.2025.105750}, journal = {Image and Vision Computing}, month = {11}, pages = {105750}, shortjournal = {Image Vis. Comput.}, title = {Enhanced crowd counting with weighted attention network and multi-scale feature integration}, volume = {163}, year = {2025}, }
• (2025). Fall detection using deep learning with features computed from recursive quadratic splits of video frames. ICV, 163, 105749. (www)

  @article{ , abstract = {Accidental falls are a leading cause of injury and death worldwide, particularly among the elderly. Despite extensive research on fall detection, many existing systems remain limited by reliance on wearable sensors that are inconvenient for continuous use, or vision-based approaches that require full video decoding, human pose estimation, or simplified datasets that fail to capture the complexity of real-life environments. As a result, their accuracy often deteriorates in realistic scenarios such as nursing homes or crowded public spaces. In this paper, we introduce a novel fall detection framework that leverages information embedded in the High Efficiency Video Coding (HEVC) standard. Unlike traditional vision-based methods, our approach extracts spatio-temporal features directly from recursive block splits and other HEVC coding information. This includes creating a sequence of four RGB input images which capture block sizes and splits of the video frames in a visual manner. The block sizes in video coding are determined based on the spatio-temporal activities in the frames, hence the suitability of using them as features. Other features are also derived from the coded videos, including compression modes, motion vectors, and prediction residuals. To enhance robustness, we integrate these features into deep learning models and employ fusion strategies that combine complementary representations. Extensive evaluations on two challenging datasets: the Real-World Fall Dataset (RFDS) and the High-Quality Fall Simulation Dataset (HQFSD), demonstrate that our method achieves superior accuracy and robustness compared to prior work. In addition, our method requires only around 23 GFLOPs per video because the deep learning network is executed on just four fixed-frame representations, whereas traditional pipelines process every frame individually, often amounting to hundreds of frames per video and orders of magnitude higher FLOPs.}, archive = {J_ICV}, author = {Zahra Solatidehkordi and Tamer Shanableh}, doi = {10.1016/j.imavis.2025.105749}, journal = {Image and Vision Computing}, month = {11}, pages = {105749}, shortjournal = {Image Vis. Comput.}, title = {Fall detection using deep learning with features computed from recursive quadratic splits of video frames}, volume = {163}, year = {2025}, }
• (2025). MBT-polyp: A new multi-branch memory-augmented transformer for polyp segmentation. ICV, 163, 105747. (www)

  @article{ , abstract = {Polyp segmentation plays a critical role in the early diagnosis and precise clinical intervention of colorectal cancer (CRC). Despite significant advancements in deep learning for medical image segmentation, accurate localization of small polyps and precise delineation of polyp boundaries remain challenges in colorectal polyp segmentation. In this study, we introduce MBT-Polyp, a Multi-branch Memory-augmented Transformer architecture designed to improve segmentation sensitivity for small polyps and enhance the delineation accuracy of ambiguous polyp boundaries. At the core of our framework is MemoryFormer, a Transformer-based U-shaped architecture that incorporates three key components: a Dynamic Focal Attention block (DFA) for efficient small target enhancement and edge refinement, a High-Level Memory Attention Module (HMAM) for preserving boundary details via cross-resolution fusion, and a Multi-View Channel Memory Attention Module (MCMAM) for suppressing background noise and modeling local spatial context. To guide specialized learning, we derive small polyp and edge labels alongside ground truth, enabling MemoryFormer to process them through dedicated branches. The outputs are fused using a Small Polyp Fusion Strategy (SPFS) and an Edge Correction Strategy (ECS) to alleviate over- and under-segmentation. The quantitative results on Kvasir-SEG, CVC-ColonDB, CVC-ClinicDB, CVC-300, and ETIS-Larib yield mean Dice scores of 0.930, 0.818, 0.943, 0.912, and 0.763, respectively, demonstrating strong generalization across diverse polyp segmentation scenarios. Code and datasets are available at: https://github.com/taojlu/PolypSeg .}, archive = {J_ICV}, author = {Tao Wang and Weijie Wang and Fausto Giunchiglia and Fengzhi Zhao and Ye Zhang and Duo Yu and Guixia Liu}, doi = {10.1016/j.imavis.2025.105747}, journal = {Image and Vision Computing}, month = {11}, pages = {105747}, shortjournal = {Image Vis. Comput.}, title = {MBT-polyp: A new multi-branch memory-augmented transformer for polyp segmentation}, volume = {163}, year = {2025}, }
• (2025). PixTention: Dynamic pixel-level adapter using attention maps. ICV, 163, 105746. (www)

  @article{ , abstract = {Recent advances in image generation have popularized adapter-based fine-tuning, where Low-Rank Adaptation (LoRA) modules enable efficient personalization with minimal storage costs. However, current approaches often suffer from two key limitations: (1) manually selecting suitable LoRA adapters is time-consuming and requires expert knowledge, and (2) applying multiple adapters globally can introduce style interference and reduce image fidelity, especially for prompts with multiple distinct concepts. We propose PixTention , a framework that addresses these challenges via a novel three-stage process: Curator , Selector , and Integrator . The Curator uses a vision-language model to generate enriched semantic descriptions of LoRA adapters and clusters their embeddings based on shared visual themes, enabling efficient hierarchical retrieval. The Selector embeds user prompts and first selects the most relevant adapter clusters, then identifies top-K adapters within them via cosine similarity. The Integrator leverages cross-attention maps from diffusion models to assign each retrieved adapter to specific semantic regions in the output image, ensuring localized, prompt-aligned transformations without global style overwriting. Through experiments on COCO-Multi and a custom StyleCompose dataset, PixTention achieves higher CLIP scores, IoU and lower FID than baseline retrieval and reranking methods, demonstrating superior text-image alignment and image realism. Our results highlight the importance of semantic clustering, region-specific adapter composition, and cross-modal alignment in advancing controllable, high-fidelity image generation.}, archive = {J_ICV}, author = {Dooho Choi and Yunsick Sung}, doi = {10.1016/j.imavis.2025.105746}, journal = {Image and Vision Computing}, month = {11}, pages = {105746}, shortjournal = {Image Vis. Comput.}, title = {PixTention: Dynamic pixel-level adapter using attention maps}, volume = {163}, year = {2025}, }
• (2025). PR-DETR: Extracting and utilizing prior knowledge for improved end-to-end object detection. ICV, 163, 105745. (www)

  @article{ , abstract = {The query initialization in the Transformer-based target detection algorithm has static characteristics, resulting in a limitation to flexibly adjust the degree of attention to different image features during the learning process. In addition, without the guidance of global spatial semantic information, it will cause the model to disregard the relationship between the target and the surrounding environment due to relying on local features for target detection, causing the problem of false detection or missed detection of the target. In order to solve the above problems, this paper proposes a query-optimized target detection model PR-DETR based on feature map guidance. PR-DETR designs the Aggregating Global Spatial Semantic Information module (AGSSI module) to extract and enhance global spatial semantic information. Afterwards, we design queries that participate in the interaction of local and global spatial semantic information in the encoding part in advance, so as to obtain sufficient prior knowledge and provide more accurate and efficient queries for subsequent decoding feature maps. Experiment results show that PR-DETR has significantly improved detection accuracy on the MS COCO data set compared with existing related research work. The mAP is 3.5, 2.3 and 2.0 higher than Conditional-DETR, Anchor-DETR and DAB-DETR respectively.}, archive = {J_ICV}, author = {Yukang Huo and Mingyuan Yao and Tonghao Wang and Qingbin Tian and Jiayin Zhao and Xiao Liu and Haihua Wang}, doi = {10.1016/j.imavis.2025.105745}, journal = {Image and Vision Computing}, month = {11}, pages = {105745}, shortjournal = {Image Vis. Comput.}, title = {PR-DETR: Extracting and utilizing prior knowledge for improved end-to-end object detection}, volume = {163}, year = {2025}, }
• (2025). DECF-FGVC: A discriminative enhancement and complementary fusion approach for fine-grained bird visual classification. ICV, 163, 105744. (www)

  @article{ , abstract = {Fine-grained bird image recognition plays a critical role in species conservation. However, existing approaches are constrained by complex background interference, insufficient extraction of discriminative features, and limited integration of hierarchical information. While Vision Transformers (ViTs) demonstrate superior performance over CNNs in fine-grained classification tasks, they remain vulnerable to background noise, with class tokens often failing to capture key regions - overlooking the complementarity between low-level details and high-level semantics. This study proposes DECF-FGVC, a novel model incorporating three modules: Patch Contrast Enhancement (PCE), Contrast Token Refiner (CTR), and Hierarchical Token Synthesizer (HTS). These modules synergistically suppress background noise, emphasize key regions, and integrate multi-layer features through attention-weighted image reconstruction, counterfactual learning-based token refinement, and hierarchical token fusion. Extensive experiments on CUB-200-2011, NABirds, and iNaturalist2017 datasets achieve classification accuracies of 91.9%, 91.4%, and 77.92% respectively, consistently outperforming state-of-the-art methods.}, archive = {J_ICV}, author = {ShuaiShuai Deng and Tianhua Chen and Qinghua Qiao}, doi = {10.1016/j.imavis.2025.105744}, journal = {Image and Vision Computing}, month = {11}, pages = {105744}, shortjournal = {Image Vis. Comput.}, title = {DECF-FGVC: A discriminative enhancement and complementary fusion approach for fine-grained bird visual classification}, volume = {163}, year = {2025}, }
• (2025). Understanding adversarial robustness of deep neural networks via decision reliance. ICV, 163, 105743. (www)

  @article{ , abstract = {Adversarial robustness has become a major concern as machine learning models are increasingly deployed in high-risk and high-impact applications. Accordingly, various adversarial training strategies are proposed, making the model more robust under adversarial attack. However, similar to deep neural networks (DNNs) themselves, the mechanisms through which adversarial training strategies improve model robustness remain opaque. In this paper, we reveal how adversarial training alters the internal workings of deep neural networks by conducting neuron-wise decision reliance analysis. We find that adversarially vulnerable models predominantly rely on a small subset of predictive neurons while adversarially robust models tend to distribute their reliance across a broader range of neurons. We validate the relationship between decision reliance and adversarial robustness through comprehensive experiments across various models, training objectives, and attack scenarios. We observe that this relationship also holds for standard trained models, including those trained with Mixup or CutMix, which demonstrate improved performance against one-step adversarial attacks. Furthermore, we show that minimizing decision reliance leads to improved adversarial robustness. Our findings enrich the understanding of adversarially trained models and offer an interpretable and efficient approach to analyzing their internal mechanisms.}, archive = {J_ICV}, author = {Soyoun Won and Hyeon Bae Kim and Yong Hyun Ahn and Hong Joo Lee and Seong Tae Kim}, doi = {10.1016/j.imavis.2025.105743}, journal = {Image and Vision Computing}, month = {11}, pages = {105743}, shortjournal = {Image Vis. Comput.}, title = {Understanding adversarial robustness of deep neural networks via decision reliance}, volume = {163}, year = {2025}, }
• (2025). DeepDCT-VO: 3D directional coordinate transformation for low-complexity monocular visual odometry using deep learning. ICV, 163, 105742. (www)

  @article{ , abstract = {Deep learning-based monocular visual odometry has gained importance in robotics and autonomous navigation due to its robustness in visually challenging environments and minimal sensor requirements. However, many existing deep learning-based MVO methods suffer from high computational costs and large model sizes, making them less suitable for real-time applications in resource-limited systems. In this study, we propose DeepDCT-VO, a lightweight visual odometry method that combines three-dimensional directional coordinate transformation with a compact deep learning architecture. Unlike traditional approaches that estimate translation in a global coordinate system and are prone to drift accumulation, DeepDCT-VO uses local directional motion derived from composite rotations. This approach avoids global trajectory reconstruction, thereby improving the method’s stability and reliability. The proposed model operates on input images at multiple resolutions (120 × 120, 240 × 240, 360 × 360, and 480 × 480), leveraging attention-guided residual learning to extract robust features. Additionally, it incorporates multi-modal information—specifically depth and semantic maps—to further improve the accuracy of pose estimation. Evaluations on the KITTI odometry benchmark demonstrate that DeepDCT-VO achieves competitive trajectory estimation accuracy while maintaining real-time performance—8 ms per frame on GPU and 12 ms on CPU. Compared to the existing method with the lowest translational drift ( t rel ), DeepDCT-VO reduces model size by approximately 96.3% (from 37.5 million to 1.4 million parameters). Conversely, when compared to the lightest model in terms of parameter count, DeepDCT-VO reduces t rel from 8.57% to 1.69%, achieving an 80.3% reduction in translational drift. These results underscore the effectiveness of DeepDCT-VO in delivering accurate and efficient monocular visual odometry, particularly suited for embedded and resource-limited applications, while the proposed transformation method offers an auxiliary function in reducing translational complexity.}, archive = {J_ICV}, author = {E. Simsek and B. Ozyer}, doi = {10.1016/j.imavis.2025.105742}, journal = {Image and Vision Computing}, month = {11}, pages = {105742}, shortjournal = {Image Vis. Comput.}, title = {DeepDCT-VO: 3D directional coordinate transformation for low-complexity monocular visual odometry using deep learning}, volume = {163}, year = {2025}, }
• (2025). OneN: Guided attention for natively-explainable anomaly detection. ICV, 163, 105741. (www)

  @article{ , abstract = {In industrial computer vision applications, anomaly detection (AD) is a critical task for ensuring product quality and system reliability. However, many existing AD systems follow a modular design that decouples classification from detection and localization tasks. Although this separation simplifies model development, it often limits generalizability and reduces practical effectiveness in real-world scenarios. Deep neural networks offer strong potential for unified solutions. Nonetheless, most current approaches still treat detection, localization and classification as separate components, hindering the development of more integrated and efficient AD pipelines. To bridge this gap, we propose OneN (One Network), a unified architecture that performs detection, localization, and classification within a single framework. Our approach distills knowledge from a high-capacity convolutional neural network (CNN) into an attention-based architecture trained under varying levels of supervision. The resulting attention maps act as interpretable pseudo-segmentation masks, enabling accurate localization of anomalous regions. To further enhance localization quality, we introduce a progressive focal loss that guides attention maps at each layer to focus on critical features. We validate our method through extensive experiments on both standardized and custom-defined industrial benchmarks. Even under weak supervision, it improves performance, reduces annotation effort, and facilitates scalable deployment in industrial environments.}, archive = {J_ICV}, author = {Pasquale Coscia and Angelo Genovese and Vincenzo Piuri and Fabio Scotti}, doi = {10.1016/j.imavis.2025.105741}, journal = {Image and Vision Computing}, month = {11}, pages = {105741}, shortjournal = {Image Vis. Comput.}, title = {OneN: Guided attention for natively-explainable anomaly detection}, volume = {163}, year = {2025}, }
• (2025). Test-time adaptation for object detection via dynamic dual teaching. ICV, 163, 105740. (www)

  @article{ , abstract = {Test-Time Adaptation (TTA) is a practical setting in real-world applications, which aims to adapt a source-trained model to target domains with online unlabeled test data streams. Current approaches often rely on self-training, utilizing supervision signals from the source-trained model, suffering from poor adaptation due to diverse domain shifts. In this paper, we propose a novel test-time adaptation method for object detection guided by dual teachers, termed D ynamic D ual T eaching ( DDT ). Inspired by the generalization potentials of Vision-Language Models (VLMs), we integrate the VLM as an additional language-driven instructor. This integration exploits the domain-robustness of language prompts to mitigate domain shifts, collaborating with the teacher of source information within the teacher–student framework. Firstly, we utilize an ensemble prompt to guide the prediction process of the language-driven instructor. Secondly, a dynamic fusion strategy of the dual teachers is designed to generate high-quality pseudo-labels for student learning. Moreover, we incorporate a dual prediction consistency regularization to further mitigate the sensitivity of the adapted detector to domain shifts. Experiments on diverse domain adaptation benchmarks demonstrate that the proposed DDT method achieves state-of-the-art performance on both online and offline domain adaptation settings.}, archive = {J_ICV}, author = {Siqi Zhang and Lu Zhang and Zhiyong Liu}, doi = {10.1016/j.imavis.2025.105740}, journal = {Image and Vision Computing}, month = {11}, pages = {105740}, shortjournal = {Image Vis. Comput.}, title = {Test-time adaptation for object detection via dynamic dual teaching}, volume = {163}, year = {2025}, }
• (2025). Mining fine-grained attributes for vision–semantics integration in few-shot learning. ICV, 163, 105739. (www)

  @article{ , abstract = {Recent advancements in Few-Shot Learning (FSL) have been significantly driven by leveraging semantic descriptions to enhance feature discrimination and recognition performance. However, existing methods, such as SemFew, often rely on verbose or manually curated attributes and apply semantic guidance only to the support set, limiting their effectiveness in distinguishing fine-grained categories. Inspired by human visual perception, which emphasizes crucial features for accurate recognition, this study introduces concise, fine-grained semantic attributes to address these limitations. We propose a Visual Attribute Enhancement (VAE) mechanism that integrates enriched semantic information into visual features, enabling the model to highlight the most relevant visual attributes and better distinguish visually similar samples. This module enhances visual features by aligning them with semantic attribute embeddings through a cross-attention mechanism and optimizes this alignment using an attribute-based cross-entropy loss. Furthermore, to mitigate the performance degradation caused by methods that supply semantic information exclusively to the support set, we propose a semantic attribute reconstruction (SAR) module. This module predicts and integrates semantic features for query samples, ensuring balanced information distribution between the support and query sets. Specifically, SAR enhances query representations by aligning and reconstructing semantic and visual attributes through regression and optimal transport losses to ensure semantic–visual consistency. Experiments on five benchmark datasets, including both general datasets and more challenging fine-grained Few-Shot datasets consistently demonstrate that our proposed method outperforms state-of-the-art methods in both 5-way 1-shot and 5-way 5-shot settings.}, archive = {J_ICV}, author = {Juan Zhao and Lili Kong and Deshang Sun and Deng Xiong and Jiancheng Lv}, doi = {10.1016/j.imavis.2025.105739}, journal = {Image and Vision Computing}, month = {11}, pages = {105739}, shortjournal = {Image Vis. Comput.}, title = {Mining fine-grained attributes for vision–semantics integration in few-shot learning}, volume = {163}, year = {2025}, }
• (2025). Explainable deepfake detection across different modalities: An overview of methods and challenges. ICV, 163, 105738. (www)

  @article{ , abstract = {The increasing use of deepfake technology enables the creation of realistic and deceptive content, raising concerns about several serious issues, including biometric authentication, misinformation, politics, privacy, and trust. Many Deepfake Detection (DD) models are entering the market to combat the misuse of deepfakes. With these developments, one primary issue occurs in ensuring the explainability of the proposed detection models to understand the rationale of the decision. This paper aims to investigate the state-of-the-art explainable DD models across multiple modalities, including image, video, audio, and text. Unlike existing surveys that focus on detection methodologies with minimal attention to explainability and limited modality coverage, this paper directly focuses on these gaps. It offers a comprehensive analysis of advanced explainability techniques, including Grad-CAM, LIME, SHAP, LRP, Saliency Maps, and Anchors, for detecting deceptive content across the modalities. It identifies the strengths and limitations of existing models and outlines research directions to enhance explainability and interpretability in future works. By exploring these models, we aim to enhance transparency, provide deeper insights into model decisions, and bridge the gap between detection accuracy with explainability in DD models.}, archive = {J_ICV}, author = {MD Sarfaraz Momin and Abu Sufian and Debaditya Barman and Marco Leo and Cosimo Distante and Naser Damer}, doi = {10.1016/j.imavis.2025.105738}, journal = {Image and Vision Computing}, month = {11}, pages = {105738}, shortjournal = {Image Vis. Comput.}, title = {Explainable deepfake detection across different modalities: An overview of methods and challenges}, volume = {163}, year = {2025}, }
• (2025). Dynamic sparse and weight allocation-based text-driven person retrieval. ICV, 163, 105737. (www)

  @article{ , abstract = {Text-to-image person retrieval aims to find the most matching personimages in a large-scale persondataset through textual descriptions. However, most of the existing methods have the following problems: (1) There are still some inaccurate matching pairs in the retrieval system, and the errors of these matching pairs negatively affect the performance of the whole retrieval system. (2) In the whole training process of the model, the whole text is used directly, but there are still non-important parts of the text that are not important for recognizing the images, and how to process the text effectively is still a hot topic in current research. These critical issues significantly degrade the retrieval performance. To this end, we propose a new alignment optimization framework for text-based person retrieval. Precisely, our framework consists of three key components: (1) progressive enhancement for a multimodal integration, which not only simulates coarse-grained alignment through mathematical modeling, but also appropriately combines coarse-grained and fine-grained alignment through progressive learning; (2) global bidirectional match filtering, which utilizes subjective logic to effectively mitigate the interference of incorrectly matched pairs of image text, and at the same time utilizes a bidirectional KL match filtering algorithm so as to select the matching pairs with high degree of image text matching for training; (3) fine-grained dynamic sparse mask modeling, which uses mask language modeling and constructs a dynamic spatial sparsification module, which not only applies more expressive modules to important positions but also mines the relationship between image text pairs at a fine-grained level, thus improving retrieval performance. Extensive experiments show that the method achieves state-of-the-art results on three benchmark datasets and performs well on domain generalization tasks.}, archive = {J_ICV}, author = {Shuren Zhou and Qihang Zhou and Jiao Liu}, doi = {10.1016/j.imavis.2025.105737}, journal = {Image and Vision Computing}, month = {11}, pages = {105737}, shortjournal = {Image Vis. Comput.}, title = {Dynamic sparse and weight allocation-based text-driven person retrieval}, volume = {163}, year = {2025}, }
• (2025). MITS: A large-scale multimodal benchmark dataset for intelligent traffic surveillance. ICV, 163, 105736. (www)

  @article{ , abstract = {General-domain large multimodal models (LMMs) have achieved significant advances in various image-text tasks. However, their performance in the Intelligent Traffic Surveillance (ITS) domain remains limited due to the absence of dedicated multimodal datasets. To address this gap, we introduce MITS (Multimodal Intelligent Traffic Surveillance), the first large-scale multimodal benchmark dataset specifically designed for ITS. MITS includes 170,400 independently collected real-world ITS images sourced from traffic surveillance cameras, annotated with eight main categories and 24 subcategories of ITS-specific objects and events under diverse environmental conditions. Additionally, through a systematic data generation pipeline, we generate high-quality image captions and 5 million instruction-following visual question-answer pairs , addressing five critical ITS tasks : object and event recognition, object counting, object localization, background analysis, and event reasoning. To demonstrate MITS’s effectiveness, we fine-tune mainstream LMMs on this dataset, enabling the development of ITS-specific applications. Experimental results show that MITS significantly improves LMM performance in ITS applications, increasing LLaVA-1.5’s performance from 0.494 to 0.905 (+83.2%), LLaVA-1.6’s from 0.678 to 0.921 (+35.8%), Qwen2-VL’s from 0.584 to 0.926 (+58.6%), and Qwen2.5-VL’s from 0.732 to 0.930 (+27.0%). We release the dataset, code, and models as open-source , providing high-value resources to advance both ITS and LMM research.}, archive = {J_ICV}, author = {Kaikai Zhao and Zhaoxiang Liu and Peng Wang and Xin Wang and Zhicheng Ma and Yajun Xu and Wenjing Zhang and Yibing Nan and Kai Wang and Shiguo Lian}, doi = {10.1016/j.imavis.2025.105736}, journal = {Image and Vision Computing}, month = {11}, pages = {105736}, shortjournal = {Image Vis. Comput.}, title = {MITS: A large-scale multimodal benchmark dataset for intelligent traffic surveillance}, volume = {163}, year = {2025}, }
• (2025). CDAF: Cross-modal and dual-channel upsample adaptive fusion network for point cloud completion. ICV, 163, 105735. (www)

  @article{ , abstract = {In real-world scenarios, point cloud data often suffers from incompleteness due to limitations in sensor viewpoints, resolution constraints, and self-occlusions, which hinders its applications in domains such as autonomous driving and robotics. To address these challenges, this paper proposes a novel Cross-Modal and Dual-channel Upsample Adaptive Fusion network (CDAF), Our framework innovatively integrates depth maps with point clouds through dual-channel attention and gating units, significantly improving completion accuracy and detail recovery. The framework comprises two core modules: Cross-Modal Feature Enhancement (CMFE) and Dual-channel Upsampling Adaptive Fusion (DUAF). CMFE enhances point cloud feature representation by leveraging Spatial-activated Channel Attention to model channel-wise dependencies and Max-Sigmoid Attention to align cross-modal features between depth maps and point clouds, DUAF progressively refines coarse point clouds through a parallel structural analysis and similarity alignment branches, enabling adaptive fusion of local geometric priors and global shape consistency. Experimental results on multiple benchmark datasets demonstrate that CDAF surpasses existing state-of-the-art methods in point cloud completion tasks, showcasing superior global shape understanding and detail recovery.}, archive = {J_ICV}, author = {Ming Lu and Jian Li and Duo Han Zhao and Qin Wang}, doi = {10.1016/j.imavis.2025.105735}, journal = {Image and Vision Computing}, month = {11}, pages = {105735}, shortjournal = {Image Vis. Comput.}, title = {CDAF: Cross-modal and dual-channel upsample adaptive fusion network for point cloud completion}, volume = {163}, year = {2025}, }
• (2025). UNIR-net: A novel approach for restoring underwater images with non-uniform illumination using synthetic data. ICV, 163, 105734. (www)

  @article{ , abstract = {Restoring underwater images affected by non-uniform illumination (NUI) is essential to improve visual quality and usability in marine applications. Conventional methods often fall short in handling complex illumination patterns, while learning-based approaches face challenges due to the lack of targeted datasets. To address these limitations, the Underwater Non-uniform Illumination Restoration Network (UNIR-Net) is proposed. UNIR-Net integrates multiple components, including illumination enhancement, attention mechanisms, visual refinement, and contrast correction, to effectively restore underwater images affected by NUI. In addition, the Paired Underwater Non-uniform Illumination (PUNI) dataset is introduced, specifically designed for training and evaluating models under NUI conditions. Experimental results on PUNI and the large-scale real-world Non-Uniform Illumination Dataset (NUID) show that UNIR-Net achieves superior performance in both quantitative metrics and visual outcomes. UNIR-Net also improves downstream tasks such as underwater semantic segmentation, highlighting its practical relevance. The code is available at https://github.com/xingyumex/UNIR-Net .}, archive = {J_ICV}, author = {Ezequiel Pérez-Zarate and Chunxiao Liu and Oscar Ramos-Soto and Diego Oliva and Marco Pérez-Cisneros}, doi = {10.1016/j.imavis.2025.105734}, journal = {Image and Vision Computing}, month = {11}, pages = {105734}, shortjournal = {Image Vis. Comput.}, title = {UNIR-net: A novel approach for restoring underwater images with non-uniform illumination using synthetic data}, volume = {163}, year = {2025}, }
• (2025). FFENet: A frequency fusion and enhancement network for camouflaged object detection. ICV, 163, 105733. (www)

  @article{ , abstract = {The goal of camouflaged object detection (COD) is to accurately find camouflaged objects hidden in their surroundings. Although most of the existing frequency-domain based COD models can boost the performance of COD to a certain extent by utilizing the frequency domain information, the frequency feature fusion strategies they adopt tend to ignore the complementary effects between high-frequency features and low-frequency features. In addition, most of the existing frequency-domain based COD models also do not consider enhancing camouflaged objects using low-level frequency-domain features. In order to solve these problems, we present a frequency fusion and enhancement network (FFENet) for camouflaged object detection, which mainly includes three stages. In the frequency feature extraction stage, we design a frequency feature learning module (FLM) to extract corresponding high-frequency features and low-frequency features. In the frequency feature fusion stage, we design a frequency feature fusion module (FFM) that can increase the representation ability of the fused features by adaptively assigning weights to the high-frequency features and the low-frequency features using a cross-attention mechanism. In the frequency feature guidance information enhancement stage, we design a frequency feature guidance information enhancement module (FGIEM) to enhance the contextual information and detail information of camouflaged objects in the fused features under the guidance of the low-level frequency features. Extensive experimental results on the COD10K, CHAMELEON, NC4K and CAMO datasets show that our model is superior to most existing COD models.}, archive = {J_ICV}, author = {Haishun Du and Wenzhe Zhang and Sen Wang and Zhengyang Zhang and Linbing Cao}, doi = {10.1016/j.imavis.2025.105733}, journal = {Image and Vision Computing}, month = {11}, pages = {105733}, shortjournal = {Image Vis. Comput.}, title = {FFENet: A frequency fusion and enhancement network for camouflaged object detection}, volume = {163}, year = {2025}, }
• (2025). UpAttTrans: Upscaled attention based transformer for facial image super-resolution. ICV, 163, 105731. (www)

  @article{ , abstract = {Image super-resolution (SR) aims to reconstruct high-quality images from low-resolution inputs, a task particularly challenging in face-related applications due to extreme degradations and modality differences (e.g., visible, low-resolution, near-infrared). Conventional convolutional neural networks (CNNs) and GAN-based approaches have achieved notable success; however, they often struggle with preserving identity and fine structural details at high upscaling factors. In this work, we introduce UpAttTrans, a novel attention mechanism that connects original and upsampled features for better detail recovery based on vision transformer for SR. The core generator leverages a custom UpAttTrans module that translates input image patches into embeddings, processes them through transformer layers enhanced with connector-up attention, and reconstructs high-resolution outputs with improved detail retention. We evaluate our model on the CelebA dataset across multiple upscaling factors ( 4 × , 8 × , 16 × , 32 × , and 64 × ). UpAttTrans achieves a 24.63% increase in PSNR, 21.56% in SSIM, and 19.61% reduction in FID for 4 × and 8 × SR, outperforming state-of-the-art baselines. Additionally, for higher magnification levels, our model maintains strong performance, with average gains of 6.20% in PSNR and 21.49% in SSIM, indicating its robustness in extreme SR settings. These findings suggest that UpAttTrans holds significant promise for real-world applications such as face recognition in surveillance, forensic image enhancement, and cross-spectral matching, where high-quality reconstruction from severely degraded inputs is critical.}, archive = {J_ICV}, author = {Neeraj Baghel and Shiv Ram Dubey and Satish Kumar Singh}, doi = {10.1016/j.imavis.2025.105731}, journal = {Image and Vision Computing}, month = {11}, pages = {105731}, shortjournal = {Image Vis. Comput.}, title = {UpAttTrans: Upscaled attention based transformer for facial image super-resolution}, volume = {163}, year = {2025}, }
• (2025). Novel extraction of discriminative fine-grained feature to improve retinal vessel segmentation. ICV, 163, 105729. (www)

  @article{ , abstract = {Retinal vessel segmentation is a vital early detection method for several severe ocular diseases. Despite significant progress in retinal vessel segmentation with the advancement of Neural Networks, there are still challenges to overcome. Specifically, retinal vessel segmentation aims to predict the class label for every pixel within a fundus image, with a primary focus on intra-image discrimination, making it vital for models to extract more discriminative features. Nevertheless, existing methods primarily focus on minimizing the difference between the output from the decoder and the label, but ignore fully using feature-level fine-grained representations from the encoder. To address these issues, we propose a novel Attention U-shaped Kolmogorov–Arnold Network named AttUKAN along with a novel Label-guided Pixel-wise Contrastive Loss for retinal vessel segmentation. Specifically, we implement Attention Gates into Kolmogorov–Arnold Networks to enhance model sensitivity by suppressing irrelevant feature activations and model interpretability by non-linear modeling of KAN blocks. Additionally, we also design a novel Label-guided Pixel-wise Contrastive Loss to supervise our proposed AttUKAN to extract more discriminative features by distinguishing between foreground vessel-pixel pairs and background pairs. Experiments are conducted across four public datasets including DRIVE, STARE, CHASE_DB1, HRF and our private dataset. AttUKAN achieves F1 scores of 82.50%, 81.14%, 81.34%, 80.21% and 80.09%, along with MIoU scores of 70.24%, 68.64%, 68.59%, 67.21% and 66.94% in the above datasets, which are the highest compared to 11 networks for retinal vessel segmentation. Quantitative and qualitative results show that our AttUKAN achieves state-of-the-art performance and outperforms existing retinal vessel segmentation methods. Our code will be available at https://github.com/stevezs315/AttUKAN .}, archive = {J_ICV}, author = {Shuang Zeng and Chee Hong Lee and Micky C. Nnamdi and Wenqi Shi and J. Ben Tamo and Hangzhou He and Xinliang Zhang and Qian Chen and May D. Wang and Lei Zhu and Yanye Lu and Qiushi Ren}, doi = {10.1016/j.imavis.2025.105729}, journal = {Image and Vision Computing}, month = {11}, pages = {105729}, shortjournal = {Image Vis. Comput.}, title = {Novel extraction of discriminative fine-grained feature to improve retinal vessel segmentation}, volume = {163}, year = {2025}, }
• (2025). Artificial intelligence content detection techniques using watermarking: A survey. ICV, 163, 105728. (www)

  @article{ , abstract = {The rapid advancement in AI-generated content has catalyzed artistic creation, advertising, and media dissemination. Despite their widespread applications across several domains, AI-generated content inherently poses risks of identity fraud, copyright violation and unauthorized use. Watermarking has emerged as a critical tool for copyright protection, allowing embedding of identification information in AI-generated content, and enhances traceability and verification without hurting user experience. In this study, we provide a systematic literature review of the technique for detecting AI content, especially text and images, using watermarking, spanning studies from 2010 to 2025. Studies included in this review were peer-reviewed articles that applied watermarking to effectively distinguish AI-generated content from real or human-written content. We report strong past and current approaches to detecting watermarking-based AI content, especially text and images. This includes an analysis of how watermarking methods are used on AI-generated content, their role in enhancing performance, and a detail comparative analysis of notable techniques. Furthermore, we discuss how these methods have been evaluated, identify the research gaps and potential solutions. Our findings provide valuable insights for future watermarking-based AI content detection researchers, applications and organizations seeking to implement watermarking solutions in potential applications. To the best of our knowledge, we are the first to explore the detection of AI content, especially text and image, detection using watermarking.}, archive = {J_ICV}, author = {Nishant Kumar and Amit Kumar Singh}, doi = {10.1016/j.imavis.2025.105728}, journal = {Image and Vision Computing}, month = {11}, pages = {105728}, shortjournal = {Image Vis. Comput.}, title = {Artificial intelligence content detection techniques using watermarking: A survey}, volume = {163}, year = {2025}, }
• (2025). Your image generator is your new private dataset. ICV, 163, 105727. (www)

  @article{ , abstract = {Generative diffusion models have emerged as powerful tools to synthetically produce training data, offering potential solutions to data scarcity and reducing labelling costs for downstream supervised deep learning applications. However, existing approaches for synthetic dataset generation face significant limitations: previous methods like Knowledge Recycling rely on label-conditioned generation with models trained from scratch, limiting flexibility and requiring extensive computational resources, while simple class-based conditioning fails to capture the semantic diversity and intra-class variations found in real datasets. Additionally, effectively leveraging text-conditioned image generation for building classifier training sets requires addressing key issues: constructing informative textual prompts, adapting generative models to specific domains, and ensuring robust performance. This paper proposes the Text-Conditioned Knowledge Recycling (TCKR) pipeline to tackle these challenges. TCKR combines dynamic image captioning, parameter-efficient diffusion model fine-tuning, and Generative Knowledge Distillation techniques to create synthetic datasets tailored for image classification. The pipeline is rigorously evaluated on ten diverse image classification benchmarks. The results demonstrate that models trained solely on TCKR-generated data achieve classification accuracies on par with (and in several cases exceeding) models trained on real images. Furthermore, the evaluation reveals that these synthetic-data-trained models exhibit substantially enhanced privacy characteristics: their vulnerability to Membership Inference Attacks is significantly reduced, with the membership inference AUC lowered by 5.49 points on average compared to using real training data, demonstrating a substantial improvement in the performance-privacy trade-off. These findings indicate that high-fidelity synthetic data can effectively replace real data for training classifiers, yielding strong performance whilst simultaneously providing improved privacy protection as a valuable emergent property. The code and trained models are available in the accompanying open-source repository .}, archive = {J_ICV}, author = {Nicolò Francesco Resmini and Eugenio Lomurno and Cristian Sbrolli and Matteo Matteucci}, doi = {10.1016/j.imavis.2025.105727}, journal = {Image and Vision Computing}, month = {11}, pages = {105727}, shortjournal = {Image Vis. Comput.}, title = {Your image generator is your new private dataset}, volume = {163}, year = {2025}, }
• (2025). Assessing the noise robustness of class activation maps: A framework for reliable model interpretability. ICV, 163, 105717. (www)

  @article{ , abstract = {Class Activation Maps (CAMs) are one of the important methods for visualizing regions used by deep learning models. Yet their robustness to different noise remains underexplored. In this work, we evaluate and report the resilience of various CAM methods for different noise perturbations across multiple architectures and datasets. By analyzing the influence of different noise types on CAM explanations, we assess the susceptibility to noise and the extent to which dataset characteristics may impact explanation stability. The findings highlight considerable variability in noise sensitivity for various CAMs. We propose a robustness metric for CAMs that captures two key properties: consistency and responsiveness. Consistency reflects the ability of CAMs to remain stable under input perturbations that do not alter the predicted class, while responsiveness measures the sensitivity of CAMs to changes in the prediction caused by such perturbations. The metric is evaluated empirically across models, different perturbations, and datasets along with complementary statistical tests to exemplify the applicability of our proposed approach.}, archive = {J_ICV}, author = {Syamantak Sarkar and Revoti P. Bora and Bhupender Kaushal and Sudhish N. George and Kiran Raja}, doi = {10.1016/j.imavis.2025.105717}, journal = {Image and Vision Computing}, month = {11}, pages = {105717}, shortjournal = {Image Vis. Comput.}, title = {Assessing the noise robustness of class activation maps: A framework for reliable model interpretability}, volume = {163}, year = {2025}, }
• (2025). InceptionWTMNet: A hybrid network for alzheimer’s disease detection using wavelet transform convolution and mixed local channel attention on finely fused multimodal images. ICV, 163, 105693. (www)

  @article{ , abstract = {Multimodal fusion has emerged as a critical technique for the diagnosis of Alzheimer’s Disease (AD), with the aim of effectively extracting and utilising complementary information from diverse modalities. Current fusion methods frequently cause the precise alignment of source images and do not adequately address parallax issues. This oversight can result in artifacts during the fusion process when images are misaligned. In response to this challenge, we propose a refined registration fusion technique, termed MURF, which integrates multimodal image registration and fusion within a cohesive framework. The Vision Transformer (ViT) has inspired the application of large-kernel convolutions in the diagnosis of Alzheimer’s disease (AD) because of its ability to model long-range dependencies. This approach aims to expand the receptive field and enhance the performance of diagnostic models. Despite requiring a minimal number of floating-point operations (FLOPs), these deep operators encounter challenges associated with over-parameterisation because of high memory access costs, which ultimately compromises computational efficiency. By utilising wavelet transform convolutions (WTConv), we decompose large-kernel depth-wise convolutions into four parallel branches. One branch employs a wavelet-transform convolution with square kernels, while the other two branches incorporate orthogonal wavelet-transform kernels with an identity mapping. This innovative method, with a Mixed Local Channel Attention mechanism, has facilitated the development of the InceptionWTConvolutions network. This network maintains a receptive field comparable to that of large-kernel convolutions, while concurrently minimising over-parameterisation and enhancing computational efficiency. InceptionWTMNet classified AD, MCI, and NC using MRI and PET data from ADNI dataset with 98.69% accuracy, 98.65% recall, 98.70% F1-score, and 98.98% AUC. and provide Graphical abstract in correct format.}, archive = {J_ICV}, author = {Zenan Xu and Zhengyao Bai and Han Ma and Mingqiang Xu and Qiqin Huang and Tao Lin}, doi = {10.1016/j.imavis.2025.105693}, journal = {Image and Vision Computing}, month = {11}, pages = {105693}, shortjournal = {Image Vis. Comput.}, title = {InceptionWTMNet: A hybrid network for alzheimer’s disease detection using wavelet transform convolution and mixed local channel attention on finely fused multimodal images}, volume = {163}, year = {2025}, }

IJAR - 2

• (2026). Zero patterns in multi-way binary contingency tables with uniform margins. IJAR, 188, 109582. (www)

  @article{ , abstract = {We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. This is an old question which relates to recent advances in copula modeling for discrete random vectors. In this work, we focus on multi-way binary tables and develop novel theory to show how the zero patterns affect the existence of the transformation as well as its statistical interpretability in terms of dependence structure. The implementation of the theory relies on combinatorial and linear programming techniques, which can also be applied to arbitrary multi-way tables. In addition, we investigate which odds ratios characterize the unique solution in relation to specific zero patterns. Several examples are described to illustrate the approach and point to interesting future research directions.}, archive = {J_IJAR}, author = {Roberto Fontana and Elisa Perrone and Fabio Rapallo}, doi = {10.1016/j.ijar.2025.109582}, journal = {International Journal of Approximate Reasoning}, month = {1}, pages = {109582}, shortjournal = {Int. J. Approx. Reasoning}, title = {Zero patterns in multi-way binary contingency tables with uniform margins}, volume = {188}, year = {2026}, }
• (2026). Choosing the center of star-shaped set-valued data compatible with measure-preserving arithmetic. IJAR, 188, 109575. (www)

  @article{ , abstract = {Set-valued data has traditionally been represented by considering non-empty compact and convex subsets of R d with the usual Minkowski addition. An alternative and flexible setting that admits a functional representation are the star-shaped sets. A framework based on a center-radial characterization has been introduced to treat these sets from a statistical point of view. The arithmetic is defined directionally, which is more natural for representing imprecision propagation in higher dimensions. Nevertheless, the problem of determining a center for star-shaped sets coherent with the arithmetic and sound for statistical purposes has not been fully addressed yet. The aim is to advance on the directional characterization for star-shaped sets by considering a measure-preserving arithmetic together with a center selection fully compatible with this arithmetic. The practicability of the new framework will be illustrated using a classical dataset in set-valued statistics.}, archive = {J_IJAR}, author = {Gil González-Rodríguez}, doi = {10.1016/j.ijar.2025.109575}, journal = {International Journal of Approximate Reasoning}, month = {1}, pages = {109575}, shortjournal = {Int. J. Approx. Reasoning}, title = {Choosing the center of star-shaped set-valued data compatible with measure-preserving arithmetic}, volume = {188}, year = {2026}, }

IPL - 2

• (2026). The harmonious coloring game. IPL, 192, 106609. (www)

  @article{ , abstract = {A harmonious k -coloring of a graph G is a 2-distance proper k -coloring of its vertices such that each edge is uniquely identified by the colors of its endpoints. Here, we introduce its game version: the harmonious coloring game. In this two-player game, Alice and Bob alternately select an uncolored vertex and assigns to it a color in { 1 , … , k } with the constraint that, at every turn, the set of colored vertices induces a valid partial harmonious coloring. Alice wins if all vertices are colored; otherwise, Bob wins. The harmonious game chromatic number χ h g ( G ) is the minimum integer k such that Alice has a winning strategy with k colors. In this paper, we prove the PSPACE-hardness of three variants of this game. As a by-product, we prove that a variant introduced by Chen et al. in 1997 of the classical graph coloring game is PSPACE-hard even in graphs with diameter two. We also obtain lower and upper bounds for χ h g ( G ) in graph classes, such as paths, cycles, grids and forests of stars.}, archive = {J_IPL}, author = {Cláudia Linhares Sales and Thiago Marcilon and Nicolas Martins and Nicolas Nisse and Rudini Sampaio}, doi = {10.1016/j.ipl.2025.106609}, journal = {Information Processing Letters}, month = {2}, pages = {106609}, shortjournal = {Inf. Process. Lett.}, title = {The harmonious coloring game}, volume = {192}, year = {2026}, }
• (2026). The steiner path aggregation problem. IPL, 192, 106608. (www)

  @article{ , abstract = {In the Steiner Path Aggregation Problem , our goal is to aggregate paths in a directed network into a single arborescence without significantly disrupting the paths. In particular, we are given a directed multigraph with colored arcs, a root, and k terminals, each of which has a monochromatic path to the root. Our goal is to find an arborescence in which every terminal has a path to the root, and its path does not switch colors too many times. We give an efficient algorithm that finds such a solution with at most 2 log 4 3 ⁡ k color switches. Up to constant factors this is the best possible universal bound, as there are graphs requiring at least log 2 ⁡ k color switches.}, archive = {J_IPL}, author = {Da Qi Chen and Daniel Hathcock and D. Ellis Hershkowitz and R. Ravi}, doi = {10.1016/j.ipl.2025.106608}, journal = {Information Processing Letters}, month = {2}, pages = {106608}, shortjournal = {Inf. Process. Lett.}, title = {The steiner path aggregation problem}, volume = {192}, year = {2026}, }

ISAT - 39

• (2025). Design of optimal LMI-LQR based PI controller for modular three-phase quadratic boost converters in wind energy conversion systems to mitigate current harmonics. ISAT, 166, 496-515. (www)

  @article{ , abstract = {The article proposes an innovative single-stage modular three-phase Power Factor Correction (PFC) converter featuring fewer current controllers. This technique leverages a practical DC-DC Quadratic Boost Converter (QBC) for PFC in Wind Energy Conversion Systems (WECS). An equivalent circuit with the non-ideal QBC is established and its small-signal model is derived, followed by a cascade control of inner current loops and outer voltage loops. The suggested linear quadratic regulator for linear matrix inequality-based PI control strategy ensures sinusoidal supply currents with a high power factor (PF) and low percentage Total Harmonic Distortion (THD) for line, servo, and regulatory operations, while addressing imbalances in the magnitude of the supply voltage. Additionally, the PFC method regulates the load voltage, and the minimal number of current controllers reduces computational tasks, losses, and overall cost. MATLAB/Simulink is used to simulate the suggested system, which uses the extended symmetrical components approach for reference current generation. The QBC's effectiveness is validated under diverse working conditions using a DSPIC30F2010 controller for a 300 W prototype. The results affirm the efficacy of the proposed technique, showcasing improved efficiency with fewer current controllers.}, archive = {J_ISAT}, author = {K Thirupura Sundari and M.G Umamaheswari}, doi = {10.1016/j.isatra.2025.07.012}, journal = {ISA Transactions}, month = {11}, pages = {496-515}, shortjournal = {ISA Trans.}, title = {Design of optimal LMI-LQR based PI controller for modular three-phase quadratic boost converters in wind energy conversion systems to mitigate current harmonics}, volume = {166}, year = {2025}, }
• (2025). Semi-tensor product-based fuzzy relation matrix technique for gear system state forecasting. ISAT, 166, 488-495. (www)

  @article{ , abstract = {Multiple-variable fuzzy prediction systems are usually difficult for modeling due to their complicated fuzzy reasoning structures and propositions. To tackle this challenge, a hierarchical fuzzy state modeling technique is proposed in this work to construct fuzzy relation matrices (FRM) with reduced dimensions (orders), for system state forecasting. In processing, firstly, the FRM with high dimensions is decomposed into several lower-dimensional FRM models. Secondly, using the semi-tensor product, a fuzzy logic framework is developed to reduce the number of fuzzy rules. The proposed hierarchical fuzzy model is also implemented for gear system health state forecasting, where system parameters are trained to improve the fuzzy reasoning accuracy. The effectiveness of the proposed hierarchical FRM modeling and system identification techniques is verified by experimental tests.}, archive = {J_ISAT}, author = {Hong L. Lyu and Wilson Wang and Xiao P. Liu}, doi = {10.1016/j.isatra.2025.07.035}, journal = {ISA Transactions}, month = {11}, pages = {488-495}, shortjournal = {ISA Trans.}, title = {Semi-tensor product-based fuzzy relation matrix technique for gear system state forecasting}, volume = {166}, year = {2025}, }
• (2025). Additive-state-decomposition-based cascaded linear ADRC for nonlinear uncertain systems with application to PMSM speed regulation. ISAT, 166, 474-487. (www)

  @article{ , abstract = {This paper investigates the tracking control problem for a class of nonlinear systems subject to time-varying total disturbance and proposes a cascaded linear active disturbance rejection control (CLADRC) approach based on additive state decomposition (ASD). By employing the ASD technique, the original system is equivalently decomposed into a nominal primary system and an uncertain secondary system. The primary system eliminates the estimated total disturbance to achieve precise reference tracking, while the secondary system suppresses the residual disturbance. Both subsystems are governed by state feedback controllers incorporating disturbance estimation and compensation. Compared to the standard linear active disturbance rejection control strategy, the proposed method fully decouples the tracking and robust components of the state feedback controller, enabling independent parameter tuning. Furthermore, by introducing a linear extended state observer for the secondary system, a secondary estimation of the residual disturbance is performed, thereby enhancing the robustness of the overall system. A criterion based on Lyapunov stability theory is provided to ensure that the closed-loop systems remain uniformly ultimately bounded. Finally, simulation and experimental results on permanent magnet synchronous motor (PMSM) speed regulation validate the effectiveness and superiority of the proposed approach.}, archive = {J_ISAT}, author = {Fuxi Jiang and Jie Ye and Siqi Wang and Yuhao Guo and Shanmei Cheng}, doi = {10.1016/j.isatra.2025.07.031}, journal = {ISA Transactions}, month = {11}, pages = {474-487}, shortjournal = {ISA Trans.}, title = {Additive-state-decomposition-based cascaded linear ADRC for nonlinear uncertain systems with application to PMSM speed regulation}, volume = {166}, year = {2025}, }
• (2025). Controller design for an approximated nonlinear system using wavelet transform. ISAT, 166, 459-473. (www)

  @article{ , abstract = {This work presents the method of representing any nonlinear function with Wavelet Transform (WT) coefficients to facilitate the controller design of any nonlinear system. A priori selection of optimal Mother Wavelet (MW) used for the representation purpose involves the statistical method called the Minimum Description Length (MDL) criterion. The dynamics of a benchmark nonlinear system have been taken to validate the above technique, and it has been proven to be superior to the standard linearization technique. Finally, an Adaptive Sliding Mode Controller (ASMC) for the WT-based approximated model (WTAM) of the plant has been designed. The design of the controller uses the Harmony Search Algorithm (HSA) for tuning purposes. The gain of the switching control law is decided by the gain adaptation technique. The Lyapunov Stability criterion is exploited to judge the stability. To validate the controller's performance in real-time, the WTAM of a Cart Inverted Pendulum is taken. The results validate the efficiency of the controller in terms of its ability to handle unbounded disturbances, parametric uncertainties, and chattering.}, archive = {J_ISAT}, author = {Rajeev Ranjan Pathak and Anindita Sengupta and Rimi Paul and Ujjwal Mondal}, doi = {10.1016/j.isatra.2025.07.030}, journal = {ISA Transactions}, month = {11}, pages = {459-473}, shortjournal = {ISA Trans.}, title = {Controller design for an approximated nonlinear system using wavelet transform}, volume = {166}, year = {2025}, }
• (2025). Dual-loop optimization of digital accelerometers based on advanced dual-degree-of-freedom smith predictor. ISAT, 166, 445-458. (www)

  @article{ , abstract = {In digital accelerometers, the setpoint loop is designed to balance the controlled object, and the disturbance loop is used to measure external inputs. Traditional closed-loop control structure of digital accelerometers is optimized only for the disturbance loop, failing to optimize the performance of the dual loops simultaneously. An advanced dual-degree-of-freedom (ADOF) Smith predictive control is proposed herein, structurally isolating the setpoint loop from the disturbance loop. Firstly, the principle of the closed-loop digital accelerometer is elaborated, and the contradiction between the performance optimization of dual loops is analyzed. Secondly, an ADOF Smith predictive control is proposed and compared with other control structures. Furthermore, the setpoint and disturbance controllers in the structure are designed using the Dahlin algorithm and H ∞ optimal control methods for parameter tuning, with the controllers being determined by a single parameter. To quantitatively describe the relationship between the control parameters and robust performance, the relationship between the control parameters and the margin indicators is derived, and the control performance is evaluated. Finally, an experimental platform of a digital closed-loop accelerometer is constructed to validate the proposed ADOF control structure and parameter tuning methods. The experimental results show that the performance of the proposed ADOF control structure significantly outperforms traditional digital closed-loop control and filtered Smith predictive control, and compared with the dual-degree-of-freedom control structure, it exhibits better nominal performance under low robustness parameters due to delay compensation.}, archive = {J_ISAT}, author = {Yi Wang and Tiantian Huang and Dekun Yang and Zhijuan Zhu and Liang Cai and Kaichen Song}, doi = {10.1016/j.isatra.2025.07.009}, journal = {ISA Transactions}, month = {11}, pages = {445-458}, shortjournal = {ISA Trans.}, title = {Dual-loop optimization of digital accelerometers based on advanced dual-degree-of-freedom smith predictor}, volume = {166}, year = {2025}, }
• (2025). Multi-source positioning information fusion method based on improved robust kalman filter. ISAT, 166, 429-444. (www)

  @article{ , abstract = {Enhancing positioning accuracy in rolling machinery is vital for quality and construction efficiency. To mitigate random noise interference in deep and narrow valleys, a multi-source positioning information fusion method utilizing an improved robust Kalman filter is proposed. This method adaptively selects optimal observations from GNSS, Robotic Total Station (RTS) and Ultra Wide Band (UWB) data, compensates for location deviation and data loss from noise interference, thus improving data robustness. The Kalman filter is improved by incorporating a thick tail Laplace distribution to dynamically adjust noise covariance, overcoming challenges with large random errors in data fusion and improving the robustness. Engineering tests show this method can adapt to complex and harsh environments in deep and narrow river valleys, with a compensation rate of over 97.33 % for data offset and loss issues, reducing localization offset rates by 7.72 % and loss rates by 1.64 % compared to single-method approaches, effectively improving the robustness, accuracy, and completeness of real-time monitoring results.}, archive = {J_ISAT}, author = {Weiwei Lin and Jiajun Wang and Xiaoling Wang and Jun Zhang and Haojun Gao}, doi = {10.1016/j.isatra.2025.07.006}, journal = {ISA Transactions}, month = {11}, pages = {429-444}, shortjournal = {ISA Trans.}, title = {Multi-source positioning information fusion method based on improved robust kalman filter}, volume = {166}, year = {2025}, }
• (2025). Kernel-based system identification using generalized orthogonal basis functions and meta-heuristic techniques. ISAT, 166, 418-428. (www)

  @article{ , abstract = {The kernel-based regularization method (KRM), emerging as a paradigm for system identification, has found widespread application in both causal and non-causal system identification. Its main challenges are the design of the kernel and the estimation of the hyperparameters. In this paper, we give some approaches to address these challenges. Specifically, we introduce a framework for causal kernel design based on generalized orthogonal basis functions (GOBFs) and successfully extend it to the non-causal scenario. In addition, using the grey wolf optimization (GWO) algorithm as an example, we explore the potential of using meta-heuristic techniques for hyperparameter estimation in KRM. To further enhance the search accuracy of the algorithm, we improve the GWO algorithm by adopting a nonlinear weight update strategy and incorporating crossover and mutation strategies inspired by the genetic algorithm (GA). Numerical simulations demonstrate that the kernel regularized identification method proposed in this paper exhibits good model estimation performance.}, archive = {J_ISAT}, author = {Wenfeng Li and Yang Liu}, doi = {10.1016/j.isatra.2025.07.027}, journal = {ISA Transactions}, month = {11}, pages = {418-428}, shortjournal = {ISA Trans.}, title = {Kernel-based system identification using generalized orthogonal basis functions and meta-heuristic techniques}, volume = {166}, year = {2025}, }
• (2025). Research on active disturbance rejection control algorithm for pressure pulse fatigue test bench of automotive radiators. ISAT, 166, 405-417. (www)

  @article{ , abstract = {When evaluating the fatigue resistance performance of automotive radiators using a pressure pulse fatigue test bench, it is necessary to periodically apply pressure signals to the radiators. The failure of any radiator during testing will induce variations in system parameters such as pressure and temperature, thereby compromising the assessment accuracy of the test platform. To address this challenge, this study proposes an active disturbance rejection control (ADRC) algorithm specifically designed for this testing system. Firstly, a mathematical model of the hydraulic system is established. Secondly, a reduced-order model-based ADRC algorithm is developed through theoretical derivation. In addition, experimental validation is conducted on the actual pressure pulse test bench. Experimental results demonstrate that, under variations in the command signal, the ADRC algorithm consistently exhibits superior pressure tracking performance and robustness compared to both conventional PID and fuzzy PID control algorithms.}, archive = {J_ISAT}, author = {Hongjun Meng and Chengyu Li and Zijing Liu and Wei Zhang and Peiqi Zhao}, doi = {10.1016/j.isatra.2025.07.038}, journal = {ISA Transactions}, month = {11}, pages = {405-417}, shortjournal = {ISA Trans.}, title = {Research on active disturbance rejection control algorithm for pressure pulse fatigue test bench of automotive radiators}, volume = {166}, year = {2025}, }
• (2025). Hierarchical RL-ESN control for autonomous underwater vehicle: 6-DOF large angle rotation maneuvering. ISAT, 166, 393-404. (www)

  @article{ , abstract = {The attitude representation of the autonomous underwater vehicle (AUV) typically relies on Euler angles and unit quaternions. However, existing works have demonstrated that both approaches exhibit inherent limitations when solving large-angle rotation maneuvers, primarily characterized by singularities and unwinding phenomena. In light of these limitations, this article investigates a model-free tracking control scheme for AUV to perform arbitrary large-angle rotation maneuvers in six degrees of freedom (6-DOF). Specifically, a rotation matrix-based error dynamics is constructed to achieve a globally unique attitude representation. A key technical obstacle is that defining attitude error directly via the rotation matrix complicates controller design. To circumvent this problem, an alternative error metric is presented to transform the rotation matrix-based attitude error from the special orthogonal group in three-dimensional space (SO(3)) to Euclidean space. Distinguished from a single estimation network, a hierarchical echo state network (ESN) is established to estimate hydrodynamic coefficients and actuator faults, which comprises multiple independent subnetworks to conduct various estimation tasks. Moreover, a collaborative critic network (CCN) is utilized to generate reinforcement signals, endowing the hierarchical ESN with favorable learning capability. In this way, the system robustness is significantly enhanced while ensuring high tracking performance. Finally, rigorous theoretical analysis and numerical simulations are presented to show the effectiveness and superiority of the proposed control scheme.}, archive = {J_ISAT}, author = {Zihan Xia and Bing Huang and Cheng Zhu}, doi = {10.1016/j.isatra.2025.07.036}, journal = {ISA Transactions}, month = {11}, pages = {393-404}, shortjournal = {ISA Trans.}, title = {Hierarchical RL-ESN control for autonomous underwater vehicle: 6-DOF large angle rotation maneuvering}, volume = {166}, year = {2025}, }
• (2025). A novel block backstepping-based trajectory tracking control with zero dynamics stability for underactuated overhead cranes. ISAT, 166, 379-392. (www)

  @article{ , abstract = {For underactuated overhead cranes, the load swing angle is not actuated, which makes the control difficulty greatly increased. In order to achieve the goal of anti-swing, many researches have been developed. However, an extremely superior control technology, called backstepping, has not been applied to overhead cranes. In this paper, a block backstepping-based trajectory tracking control scheme for 2-DOF overhead cranes is proposed for the first time. Firstly, a new variable transformation with state coupling function is designed to achieve swing suppression and thereby improve transient performance. Then, in order to enhance steady-state performance, an integral state is introduced into the designed Lyapunov candidate function. Finally, a trajectory tracking controller is proposed by backstepping. Meanwhile, a novel parameter tuning method is developed using pole placement, which saves time and effort in control parameter tuning. Note that the proposed scheme only utilizes backstepping technology and does not use other techniques for additional processing. Via zero dynamics analysis and Lyapunov stability theorems, the stability is rigorously proved. The advantages and robustness of the proposed scheme are explained by the following experimental results: settling time of the trolley is about 5 s, and the steady-state error remains within 0.5 % . The load swing angle enters the range of [ − 0.5 deg, 0.5 deg] in about 4 s.}, archive = {J_ISAT}, author = {Ning Li and Xiaoping Liu and Cungen Liu and Huanqing Wang and Jiaying Ju and Chengdong Li}, doi = {10.1016/j.isatra.2025.07.024}, journal = {ISA Transactions}, month = {11}, pages = {379-392}, shortjournal = {ISA Trans.}, title = {A novel block backstepping-based trajectory tracking control with zero dynamics stability for underactuated overhead cranes}, volume = {166}, year = {2025}, }
• (2025). Feedback chaotic growth optimizer for parameter extraction of a novel direct current arc model. ISAT, 166, 364-378. (www)

  @article{ , abstract = {Direct current (DC) arc faults are a leading cause of fire incidents in photovoltaic (PV) systems. Accurate modeling of DC arc faults is essential for understanding the underlying mechanisms of DC arcs and for developing effective detection strategies. In this study, we propose a novel model for DC arcs, referred to as the exponent segmented noise model. This model effectively characterizes arc noise by establishing an exponential relationship between frequency values and spectral energy. To enable precise parameter extraction from the exponent segmented noise model, we introduce a new metaheuristic algorithm called the feedback chaotic growth optimizer (FCGRO). FCGRO improves upon the traditional growth optimizer (GRO) by integrating feedback operators and chaos mechanisms. Firstly, the convergence performance of FCGRO is rigorously evaluated through comparative experiments on three well-established benchmark engineering optimization problems. Subsequently, based on data collected from an established experimental platform, the proposed FCGRO and eight state-of-the-art algorithms are employed to extract parameters of the exponent segmented noise model for DC arc faults. The FCGRO achieves an overall average root mean square error (RMSE) of 0.0418 with a standard deviation of 0.00818, representing reductions of at least 10.43 % and 26.86 %, respectively, compared to the other eight methods. These results indicate that FCGRO delivers more accurate and stable parameter estimations than the competing algorithms. Regarding computational efficiency, FCGRO has an average processing time of 9.969 s, ranking it third among the nine evaluated methods, which confirms its competitiveness in terms of speed. Finally, compared with existing DC arc models, the proposed exponent segmented noise model reduces RMSE by an average of 53.26 %, demonstrating its superior modeling capability.}, archive = {J_ISAT}, author = {Zhendong Yin and Li Wang and Xianqun Qiu and Jiyong Zhang}, doi = {10.1016/j.isatra.2025.07.023}, journal = {ISA Transactions}, month = {11}, pages = {364-378}, shortjournal = {ISA Trans.}, title = {Feedback chaotic growth optimizer for parameter extraction of a novel direct current arc model}, volume = {166}, year = {2025}, }
• (2025). Immersion and invariance adaptive controller and mixer for coaxial tilt-rotor UAV. ISAT, 166, 353-363. (www)

  @article{ , abstract = {This study presents a motion control system for a coaxial tilt-rotor (CTR) unmanned aerial vehicle (UAV) equipped with two CTR modules and a tail rotor. The existing adaptive control strategies for CTRUAVs fail to guarantee the theoretical convergence of estimated parameters to their true values. Additionally, the existing mixer requires frequent and inefficient adjustments of the tilt angles for motion control. To address these issues, this work proposes a control strategy that integrates a robust integral of the sign of the error (RISE)-based immersion and invariance (I&I) adaptive controller with segmented gains and an improved mixer. The RISE-based adaptive controller is theoretically capable of estimating and compensating for external disturbance torques and forces with bounded derivatives. Furthermore, a model of the CTR module that accounts for differences between the upper and lower rotors is introduced, and the proposed mixer is designed to realize efficient control at varying tilt angles of the CTR modules. Experimental results demonstrate that the proposed control scheme significantly improves stability, transient response speed, disturbance rejection performance, and parameter estimation accuracy compared to existing control strategies for the CTRUAV.}, archive = {J_ISAT}, author = {Longlong Chen and Yanmei Jia and Sihao Sun and Zongyang Lv and Yuhu Wu}, doi = {10.1016/j.isatra.2025.07.015}, journal = {ISA Transactions}, month = {11}, pages = {353-363}, shortjournal = {ISA Trans.}, title = {Immersion and invariance adaptive controller and mixer for coaxial tilt-rotor UAV}, volume = {166}, year = {2025}, }
• (2025). Spatial multi-vector and multi-rigid-body obstacle avoidance planning for multi-robot coordinated suspension system. ISAT, 166, 337-352. (www)

  @article{ , abstract = {Multi-robot coordinated suspension systems (MCSS) face challenges such as difficulties in decoupling due to strong coupling in multi-body dynamics, computational complexity explosion caused by high-dimensional state spaces, and a scarcity of obstacle avoidance planning methods for multi-rigid-body systems. To address these issues, the telescopic pyramidal configuration (TPC) and the multi-strategy geyser-inspired algorithm (MGEA) are proposed. These methods enable multi-vector and multi-rigid-body obstacle avoidance planning via a hierarchical-search and step-optimization (HSSO) framework. The MGEA enhances global search capabilities through chaotic mapping initialization, Lévy flights, differential evolution, and stability constraints, while hierarchical cooperative planning ensures the prevention of cable entanglement and decouples multi-robot motion. Simulation and experimental results show that MGEA outperforms benchmark algorithms, achieving a 16.35 % reduction in trajectory length, a 13.74 % increase in computational speed, and an 18.60 % improvement in minimum fitness, while maintaining zero collisions in cluttered 3D environments. This method provides an efficient solution for industrial lifting tasks and demonstrates scalability potential. These advancements establish a theoretical foundation for real-time planning in dynamic non-convex environments, addressing critical challenges in the application of multi-robot suspension systems.}, archive = {J_ISAT}, author = {Xiangtang Zhao and Zhigang Zhao and Cheng Su}, doi = {10.1016/j.isatra.2025.07.018}, journal = {ISA Transactions}, month = {11}, pages = {337-352}, shortjournal = {ISA Trans.}, title = {Spatial multi-vector and multi-rigid-body obstacle avoidance planning for multi-robot coordinated suspension system}, volume = {166}, year = {2025}, }
• (2025). Finite-time active disturbance rejection control scheme for quadrotor attitude tracking. ISAT, 166, 325-336. (www)

  @article{ , abstract = {In this paper, a finite-time active disturbance rejection control (FADRC) framework for quadrotor attitude tracking is presented. The FADRC framework is developed for two cascaded loops (inner-loop and outer-loop) to control the attitude angle and angular velocity, respectively. Two nonlinear extended state observers (NESOs) are devised to actively estimate and compensate for total disturbances, including internal uncertainties and external disturbances. A novel tracking differentiator (TD) is introduced to generate smooth angular speed information, featuring a simpler configuration and only one adjustable parameter, thus enhancing practical applicability. Additionally, a nonlinear control law is formulated to resist disturbances. For the outer-loop, a finite-time controller is designed to significantly enhance the tracking speed and mitigate the effects of tracking errors by ensuring convergence in a finite time, thereby improving the overall system response and robustness. The inner-loop nonlinear controller ensures rapid angular velocity tracking and stable output torques. The convergence of the TD and NESO, as well as the stability of the dual-loop controllers, are rigorously proven using Lyapunov methods. Simulation and experimental results demonstrate that the proposed control scheme achieves precise tracking performance with faster response speed, smaller tracking error, and better disturbance rejection performance compared to the existing methods.}, archive = {J_ISAT}, author = {Taiqi Wang and Yuanqing Xia and Kai Zhao and Minfeng Wei and Wuyi Luo}, doi = {10.1016/j.isatra.2025.07.019}, journal = {ISA Transactions}, month = {11}, pages = {325-336}, shortjournal = {ISA Trans.}, title = {Finite-time active disturbance rejection control scheme for quadrotor attitude tracking}, volume = {166}, year = {2025}, }
• (2025). Modularized and hierarchical state estimation strategy of 4WIDEV based on global-local dynamics model decoupling. ISAT, 166, 309-324. (www)

  @article{ , abstract = {This study introduces a hierarchically structured estimation strategy for four-wheel independent drive electric vehicles (4WIDEV), employing global-local dynamic model decoupling to achieve high-fidelity state estimation while avoiding reliance on empirical tire models.An electric drive wheel model (EDWM) was established and an unknown input observation equation was constructed using a proportional integral observer (PIO) method, achieving the decoupling between longitudinal tire force and model state variables. Through the local decoupling of the vehicle dynamics model, observation equations for lateral tire forces acting on the front and rear axles were formulated. An unknown input observer (UIO) was subsequently designed to estimate lateral tire forces, accompanied by rigorous stability proofs for the observer's asymptotic convergence.Then, a hierarchical state estimation strategy was proposed based on the strong tracking extended Kalman filter algorithm (STEKF). Simulation analyses and experimental validations collectively demonstrate that the proposed strategy can effectively improve the estimation accuracy of vehicle states.}, archive = {J_ISAT}, author = {Te Chen and Zikun Zhang and Xing Xu and Yingfeng Cai and Long Chen and Guowei Dou}, doi = {10.1016/j.isatra.2025.07.026}, journal = {ISA Transactions}, month = {11}, pages = {309-324}, shortjournal = {ISA Trans.}, title = {Modularized and hierarchical state estimation strategy of 4WIDEV based on global-local dynamics model decoupling}, volume = {166}, year = {2025}, }
• (2025). A new hybrid neurodynamics-based model-less solution for redundant robot fault-tolerant motion planning and control. ISAT, 166, 298-308. (www)

  @article{ , abstract = {For tasks utilizing redundant manipulators, the motion of multiple joints is involved in performing tracking control. In some cases, the failure of one or more joints may lead to task failure or even cause damage, highlighting the necessity of fault tolerance as a crucial capability for robotic control systems. To achieve the fault-tolerant control capability of the redundant manipulator, a quadratic programming problem is formulated to minimize the joint velocity based on the task-priority strategy. Based on this formulation, a constraint transformation method is employed to handle the joint velocity constraints, and finally, this quadratic programming problem is solved using zeroing neurodynamics with finite-time convergence. Unlike most previous fault-tolerant control algorithms, the proposed method estimates the Jacobian matrix in a data-driven manner based on gradient neurodynamics, without requiring the kinematic model of the redundant manipulator. The effectiveness of the proposed method is evaluated through simulations and experiments using manipulators with different degrees of freedom.}, archive = {J_ISAT}, author = {Xin Wang and Ning Tan and Zhaohui Zhong and Cong Hu and Kai Huang and Xiaoyi Gu}, doi = {10.1016/j.isatra.2025.07.004}, journal = {ISA Transactions}, month = {11}, pages = {298-308}, shortjournal = {ISA Trans.}, title = {A new hybrid neurodynamics-based model-less solution for redundant robot fault-tolerant motion planning and control}, volume = {166}, year = {2025}, }
• (2025). A data driven fault diagnosis approach for robotic cutting tools in smart manufacturing. ISAT, 166, 280-297. (www)

  @article{ , abstract = {In smart manufacturing within Industry 4.0, tool condition monitoring (TCM) is used to improve productivity and machine availability by leveraging advanced sensors and computational intelligence to prevent tool damage. This paper develops a hybrid methodology using heterogeneous sensor measurements for monitoring robotic cutting tools with four tool states: healthy, surface damage, flake damage and broken tooth. The proposed approach integrates the maximal overlap discrete wavelet packet transform (MODWPT) with health indicators to construct feature matrices for each tool state. Feature selection is performed using the tree growth algorithm (TGA) to reduce computation time and improve feature space separation by selecting only relevant features. The selected features are input into a Gaussian mixture model (GMM) to detect, identify and classify each tool state with high accuracy. The proposed method provides a classification accuracy of 99.04 % for vibration, 95.51 % for torque, and 91.67 % for force signals. Using unseen vibration data, the model achieved a test accuracy of 98.44 %, demonstrating a high degree of generalizability. Comparative analysis demonstrates that our proposed approach provides superior feature discrimination and model stability, balancing computational efficiency and classification accuracy, validating the TGA-GMM framework as an effective solution for tool fault diagnosis in noisy, high-dimensional data.}, archive = {J_ISAT}, author = {Adel Afia and Fawzi Gougam and Abdenour Soualhi and Mohammed Wadi and Mohamed Tahi and Mohammed Amine Sahraoui}, doi = {10.1016/j.isatra.2025.07.021}, journal = {ISA Transactions}, month = {11}, pages = {280-297}, shortjournal = {ISA Trans.}, title = {A data driven fault diagnosis approach for robotic cutting tools in smart manufacturing}, volume = {166}, year = {2025}, }
• (2025). Precise tracking of underwater electric manipulator via model-based adaptive robust control with joint-friction compensation. ISAT, 166, 266-279. (www)

  @article{ , abstract = {The underwater electric manipulator is potentially complemented to perform high-accuracy underwater operations, owing to the high accuracy and rapid response of motor-driven mechanisms. However, some special designs for sealing and pressure resistance in underwater environments result in increased joint-friction, model nonlinearity, and parameter uncertainty. Therefore, this paper proposes a model-based adaptive robust control design of underwater electric manipulators, with joint-friction compensation for precise tracking performance. Specifically, an adaptive robust controller with the basic dynamics model is designed firstly to ensure essential tracking performance. Additionally, joint-friction characteristics are meticulously considered to construct an improved LuGre model. This is followed by the parameter identification and the formulation of an additional joint-friction desired compensation control law. In comparative underwater experiments, it is verified that the proposed controller can effectively address model nonlinearity and parameter uncertainty with joint-friction compensation, thereby achieving precise tracking performance.}, archive = {J_ISAT}, author = {Xincheng Hu and Chong Shen and Fanghao Huang and Deqing Mei and Zheng Chen}, doi = {10.1016/j.isatra.2025.07.005}, journal = {ISA Transactions}, month = {11}, pages = {266-279}, shortjournal = {ISA Trans.}, title = {Precise tracking of underwater electric manipulator via model-based adaptive robust control with joint-friction compensation}, volume = {166}, year = {2025}, }
• (2025). Adaptive sliding mode controller based on improved sparrow search algorithm for tracking control of human lower limb exoskeleton. ISAT, 166, 250-265. (www)

  @article{ , abstract = {This study presents an Adaptive Sliding Mode Controller enhanced by an Improved Sparrow Search Algorithm (ISSA-SMC) for accurate motion tracking of lower-limb assistive exoskeletons. By incorporating human joint torque inputs into the exoskeleton’s dynamic model, ISSA-SMC achieves real-time adaptation to user variability, external disturbances, and modeling uncertainties. A softmax strategy combined with the branch and bound method efficiently optimizes controller parameters, enhancing tracking accuracy and robustness with low computational cost. Effectiveness is validated through simulations and physical experiments on a human-worn exoskeleton. Compared to conventional SMC and Adaptive Fuzzy Sliding Mode Control (AFSMC), ISSA-SMC notably reduces overshoot, steady-state error, and response time. This framework offers a practical, optimization-driven solution for wearable robotics, contributing valuable insights into intelligent rehabilitation and adaptive human–robot interaction.}, archive = {J_ISAT}, author = {Zhedong Xie and Yingbo Li and Bing Tian and Yuxuan Liu and Chao Zhang and Hongyu Guo}, doi = {10.1016/j.isatra.2025.07.011}, journal = {ISA Transactions}, month = {11}, pages = {250-265}, shortjournal = {ISA Trans.}, title = {Adaptive sliding mode controller based on improved sparrow search algorithm for tracking control of human lower limb exoskeleton}, volume = {166}, year = {2025}, }
• (2025). Super-twisting adaptive control of a quadrotor. ISAT, 166, 241-249. (www)

  @article{ , abstract = {This paper proposes a novel methodology for the design of robust and adaptive controllers tailored to unmanned aerial vehicles (UAVs). The proposed control architecture integrates a Super-Twisting Sliding Mode Controller (ST-SMC) with an adaptive law to ensure high-performance trajectory tracking under model uncertainties and external disturbances. The ST-SMC effectively mitigates the chattering phenomenon, a common issue in sliding mode control schemes, while maintaining robustness to system nonlinearities. The adaptive component dynamically updates the control parameters in real time to compensate for unmodeled dynamics and parameter variations. The combined approach synergistically improves tracking accuracy and overall system stability. A rigorous stability analysis based on Lyapunov theory guarantees the convergence and boundedness of the control errors. The effectiveness of the proposed method is validated through experimental laboratory flights in a sensor-enhanced environment. The results demonstrate that the two control schemes complement each other, achieving a robust strategy with high performance in the presence of parametric uncertainties.}, archive = {J_ISAT}, author = {Claudio Rosales and Carlos Vacca Sisterna and Francisco Rossomando and Daniel Gandolfo and Carlos Soria and Ricardo Carelli}, doi = {10.1016/j.isatra.2025.07.029}, journal = {ISA Transactions}, month = {11}, pages = {241-249}, shortjournal = {ISA Trans.}, title = {Super-twisting adaptive control of a quadrotor}, volume = {166}, year = {2025}, }
• (2025). Event-triggered human-machine shared steering online learning control strategy to accommodate driver behavioral uncertainty. ISAT, 166, 229-240. (www)

  @article{ , abstract = {To address the stochasticity and uncertainty in driver behavior, an event-triggered shared control strategy is proposed, enabling real-time adaptation while ensuring system stability. The vehicle control system is modeled as a nonlinear time-varying (NTV) system, incorporating human-machine interaction, driver behavior, variable speeds, and uncertain tire dynamics. Sparse Gaussian process regression (GPR) is employed for online system identification, eliminating the need for an exact system model. An adaptive feedback linearization (AFL) controller is designed, with asymptotic stability proven using a common Lyapunov function (CLF). The event-triggered mechanism updates the model and controller only when GPR uncertainty exceeds an adaptive threshold. Simulations and driver-in-the-loop experiments assess the proposed algorithm, demonstrating its robustness and adaptability to different driver behaviors, while reducing communication overhead and ensuring precise steering control.}, archive = {J_ISAT}, author = {Wanqing Shi and Hongyan Guo and Jun Liu and Qingyu Meng and Xu Zhao and Dongpu Cao and Hong Chen}, doi = {10.1016/j.isatra.2025.07.033}, journal = {ISA Transactions}, month = {11}, pages = {229-240}, shortjournal = {ISA Trans.}, title = {Event-triggered human-machine shared steering online learning control strategy to accommodate driver behavioral uncertainty}, volume = {166}, year = {2025}, }
• (2025). Recursive-filtering-based microseismic event picking under wireless channel fading and measurement outliers. ISAT, 166, 219-228. (www)

  @article{ , abstract = {This study focuses on addressing the challenge of recursive state estimation in microseismic event detection affected by wireless channel attenuation and measurement outliers (MOs). Existing methods face difficulties in accurately picking the first arrival event due to the combined effects of signal distortion from wireless channel fading and the inability to distinguish and suppress measurement outliers effectively. To overcome these challenges, the signal model for the microseismic system with wireless transmission channel fading is established in this paper, which reflects real-world engineering scenarios. Subsequently, a recursive filter incorporating a self-adaptive saturation function (SSF) is proposed to mitigate the adverse effects of MOs on arrival time picking accuracy. The filter gain is derived by minimizing the upper bound matrix of the filter error covariance, and a sufficient condition is proposed to ensure that the filtering error is mean-square exponentially bounded. The presented algorithm effectively suppresses the negative impact of MOs and enhances filtering performance in scenarios with wireless channel fading. The experimental results demonstrate the superiority and effectiveness of the developed approach.}, archive = {J_ISAT}, author = {Hongyu Gao and Manrong Zhang and Lindong Yu and Jiahui Li and Jingbo Song}, doi = {10.1016/j.isatra.2025.07.034}, journal = {ISA Transactions}, month = {11}, pages = {219-228}, shortjournal = {ISA Trans.}, title = {Recursive-filtering-based microseismic event picking under wireless channel fading and measurement outliers}, volume = {166}, year = {2025}, }
• (2025). Optimal memory-based feedback control for time-delayed systems with application to suppressing regenerative chatter. ISAT, 166, 208-218. (www)

  @article{ , abstract = {Chatter, as a self-excited vibration in the milling process, leads to detrimental effects such as increased workpiece surface roughness and tool wear. Therefore, suppressing this phenomenon, characterized as a time-delay system, is critical. This paper proposes an optimal delay-dependent memory-based controller designed using a general Lyapunov functional. The controller incorporates both the current (instantaneous) system state and its time-delayed counterparts as memory-based state feedback, and it is formulated as a Linear Quadratic Regulator (LQR) problem. Optimal strategy is derived from complex partial differential-algebraic Riccati equations and the novelty of this research lies in presenting an efficient approach to obtaining optimal control gains by approximating matrix functions with finite delay-dependent matrices using Linear Matrix Inequalities (LMIs). The proposed controller outperforms memoryless feedback controllers by ensuring asymptotic stability of the closed-loop system and substantially expanding the stability region, enabling greater axial cutting depths at each spindle speed. Moreover, its superiority lies in effectively suppressing chatter under nonlinear dynamic modeling.}, archive = {J_ISAT}, author = {Pourya Shadkami Ahvazi and Hossein Mohammadi and Mohsen Mohammadi}, doi = {10.1016/j.isatra.2025.07.037}, journal = {ISA Transactions}, month = {11}, pages = {208-218}, shortjournal = {ISA Trans.}, title = {Optimal memory-based feedback control for time-delayed systems with application to suppressing regenerative chatter}, volume = {166}, year = {2025}, }
• (2025). Predictive iterative learning control based on averaging technology for networked systems with fading channels and data loss. ISAT, 166, 196-207. (www)

  @article{ , abstract = {This paper proposes a unique general averaging (GA)-based predictive iterative learning control (PILC) method for networked systems with both data loss and fading channels. The objective is to eliminate the adverse effects of data loss and fading channels via prediction error. First, an averaging technique using all historical information is introduced into the prediction model and controller, and the control input is updated only when the data is successfully transmitted. Then, the convergence of the mean tracking error along the iterative domain of the GA-based PILC is obtained using a composite energy function method in a stochastic framework. Finally, the effectiveness of the proposed GA-based PILC method is validated through theoretical analysis and two simulation examples.}, archive = {J_ISAT}, author = {Zhenxuan Li and Zhiyang Zhang and Chenkun Yin and Zhongsheng Hou}, doi = {10.1016/j.isatra.2025.07.032}, journal = {ISA Transactions}, month = {11}, pages = {196-207}, shortjournal = {ISA Trans.}, title = {Predictive iterative learning control based on averaging technology for networked systems with fading channels and data loss}, volume = {166}, year = {2025}, }
• (2025). Probabilistic fuzzy neural network-based indirect adaptive control framework for dynamic systems. ISAT, 166, 179-195. (www)

  @article{ , abstract = {This paper introduces a probabilistic Takagi-Sugeno-Kang fuzzy neural network (PTSK-FNN) within a reliable indirect adaptive control framework that updates the gains of proportional – integral – derivative (PID) controller. The reasons for introducing this study include effective management of chaotic uncertainties by integrating the probabilistic processing with TSK fuzzy neural system, improved system identification needed for calculating control signals, and a novel law for an online learning algorithm based on the Lyapunov theorem to ensure system stability. The proposed controller requires a sensitivity function derived from the system model, which can be obtained through identification techniques utilizing Wiener model based on PTSK-FNN for modeling both linear and nonlinear dynamics of the system. By dynamically modifying both the structure and parameters of the PTSK-FNNs, the PID controller gains are updated, leading to enhance control performance. This control strategy is implemented for nonlinear dynamic systems and compared with other existing controllers, demonstrating its effectiveness in engineering applications. Simulation and experimental results indicate that the proposed controller significantly outperforms its alternatives in mitigating random noise, external disturbances, and system uncertainties. The proposed controller shows minimum performance indices compared to other published controllers, achieving improved performance by reducing the mean absolute error by 34.2 % in simulations and 38.6 % in experimental results, compared to higher-performing published controllers.}, archive = {J_ISAT}, author = {A. Aziz Khater and Eslam M. Gaballah and Mohammad El-Bardini and Ahmad M. El-Nagar}, doi = {10.1016/j.isatra.2025.07.022}, journal = {ISA Transactions}, month = {11}, pages = {179-195}, shortjournal = {ISA Trans.}, title = {Probabilistic fuzzy neural network-based indirect adaptive control framework for dynamic systems}, volume = {166}, year = {2025}, }
• (2025). Neural network-based adaptive decentralized safe control for interconnected nonlinear systems with time delays. ISAT, 166, 168-178. (www)

  @article{ , abstract = {This paper addresses the safety control issue for interconnected nonlinear systems with time delays and asymmetric input constraints by proposing a decentralized dynamic event-triggered (DET) controller based on the adaptive dynamic programming (ADP) method. Unlike other studies on large-scale interconnected systems, the equilibrium point of the system under our study is not zero. Firstly, by incorporating a discount factor and introducing a barrier function and a Lyapunov–Krasovskii (L-K) function, we construct a cost function for the interconnected system with a non-zero equilibrium point, time delay, and constraints, thereby transforming the constrained decentralized control problem into an unconstrained optimal control problem (OCP). Subsequently, an event-based Hamilton–Jacobi–Bellman (HJB) equation is established. To enhance computational efficiency, a DET mechanism is proposed. Then, the event-triggered HJB equation is solved utilizing the learning method based on ADP. Simultaneously, the weights of the neural network (NN) are optimized using a gradient descent algorithm and experience replay (ER) techniques. By employing ER technology, we have eliminated the system’s requirement for continuous excitation. Furthermore, through theoretical analysis, we have demonstrated the uniform ultimate boundedness (UUB) of the system states and neural network weights, and excluded Zeno behavior. Finally, the effectiveness of the proposed method is validated by using a spring-pendulum example.}, archive = {J_ISAT}, author = {Chong Liu and Leiming Wang and Zhousheng Chu and Hanguang Su}, doi = {10.1016/j.isatra.2025.07.016}, journal = {ISA Transactions}, month = {11}, pages = {168-178}, shortjournal = {ISA Trans.}, title = {Neural network-based adaptive decentralized safe control for interconnected nonlinear systems with time delays}, volume = {166}, year = {2025}, }
• (2025). Minimum rational entropy fault-tolerant control for nonlinear stochastic distribution control systems with quantized signals. ISAT, 166, 159-167. (www)

  @article{ , abstract = {The fault-tolerant control (FTC) issue for quantized nonlinear stochastic distribution control (SDC) systems in the presence of both actuator and sensor faults is addressed. A two-step fuzzy modeling approach is employed to systematically construct the static and dynamic models of the system, which establishes a foundational framework for subsequent fault diagnosis (FD) and FTC. Building upon the model, an adaptive augmented observer is designed to estimate actuator and sensor faults simultaneously, even under the influence of quantization effects. Furthermore, an innovative comprehensive FTC strategy is proposed, in which a virtual sensor compensator is integrated with a minimum rational entropy (MRE) fault-tolerant controller to effectively compensate for faults and ensure the system stability. The practical effectiveness of the proposed methodology is validated through its application to a molecular weight distribution system.}, archive = {J_ISAT}, author = {Lifan Li and Lina Yao and Yaoqiang Wang}, doi = {10.1016/j.isatra.2025.07.008}, journal = {ISA Transactions}, month = {11}, pages = {159-167}, shortjournal = {ISA Trans.}, title = {Minimum rational entropy fault-tolerant control for nonlinear stochastic distribution control systems with quantized signals}, volume = {166}, year = {2025}, }
• (2025). Simultaneous modeling and backstepping control algorithm for trajectory tracking of underactuated USV based on real-time sailing data in complex ocean conditions. ISAT, 166, 145-158. (www)

  @article{ , abstract = {The trajectory tracking problem of underactuated unmanned surface vessel (USV) in complex ocean conditions is investigated in this paper. A kind of high-precision maneuvering motion group (MMG) model is established to replace the traditional Fossen model for the trajectory tracking of underactuated USV. To improve the accuracy of identified USV model parameters, a novel multi-innovation least squares (MILS) identification algorithm is proposed by expanding the innovation value to a vector matrix, and then online identified USV model parameters are obtained by using MILS algorithm based on the real-time sailing data. Concurrently, by introducing virtual point position information and intermediate state, the proposed approach concurrently reduces computational requirements in the design process of the backstepping control algorithm. In addition, considering the effects of identification modeling errors and ocean disturbances, a nonlinear composite disturbance observer is designed, further enhancing the stability of the control algorithm. Finally, the effectiveness and reliability of the proposed algorithm are verified through simulation experiments.}, archive = {J_ISAT}, author = {Zaopeng Dong and Sihang Lu and Zhihao Hu and Wangsheng Liu and Yilun Ding and Yuanchang Liu}, doi = {10.1016/j.isatra.2025.07.013}, journal = {ISA Transactions}, month = {11}, pages = {145-158}, shortjournal = {ISA Trans.}, title = {Simultaneous modeling and backstepping control algorithm for trajectory tracking of underactuated USV based on real-time sailing data in complex ocean conditions}, volume = {166}, year = {2025}, }
• (2025). Model predictive control of nonlinear dynamical systems based on long sequence stable koopman network. ISAT, 166, 126-144. (www)

  @article{ , abstract = {In recent years, the Koopman method has found numerous applications in the field of nonlinear control due to its ability to map nonlinear states into high-dimensional spaces, thereby transforming nonlinear control problems into linear or bilinear problems. However, Koopman methods based on deep learning suffer from slow convergence, and the Koopman coefficients obtained through iterative processes cannot guarantee long-term prediction stability in the high-dimensional mapped space. To address these issues, we propose a Stable Deep Koopman Network with Model Predictive Control (SDKN-MPC) method for nonlinear control. The SDKN-MPC method utilizes the Stable Koopman Solver Algorithm to solve for a stable Koopman operator. It incorporates neural network training for embedding functions, with both training processes interleaved until convergence is achieved towards a unified stable solution. Subsequently, Model Predictive Control (MPC) is employed to control the high-dimensional linear system mapped through the Koopman operator, yielding high-dimensional desired inputs. These inputs undergo further processing through an auxiliary network to obtain the actual predictive control inputs. The proposed method is subjected to long-term predictive performance testing across multiple typical nonlinear control tasks and is compared with existing deep learning-based approaches. The results demonstrate that our method can extract more effective nonlinear features, converges rapidly, and exhibits superior predictive performance compared to existing methods.}, archive = {J_ISAT}, author = {Qifan Wang and Yuhong Jin and Lei Hou and Chuanjiang Li and Nasser A Saeed and Ahmed Fouly and Emad Mahrous Awwad}, doi = {10.1016/j.isatra.2025.07.003}, journal = {ISA Transactions}, month = {11}, pages = {126-144}, shortjournal = {ISA Trans.}, title = {Model predictive control of nonlinear dynamical systems based on long sequence stable koopman network}, volume = {166}, year = {2025}, }
• (2025). Enhanced obstacle avoidance for autonomous underwater vehicles via path integral control based on guiding vector field. ISAT, 166, 116-125. (www)

  @article{ , abstract = {Autonomous Underwater Vehicles (AUVs) face significant challenges in tracking, navigation, and obstacle avoidance—critical aspects for advancing intelligent underwater robotics. This research presents a new navigation technique that combines Guiding Vector Field (GVF) concepts with Model Predictive Path Integral (MPPI) control to improve the precision and efficiency of vectored thruster AUV operating in complex environments. The proposed approach utilizes the AUV's relative positioning and environmental data to generate obstacle avoidance trajectories as desired GVF. Subsequently, MPPI optimization is applied to control inputs, considering dynamic constraints, to achieve effective tracking and obstacle avoidance. Extensive simulation experiments demonstrate the method's efficacy in navigating complex scenarios with non-convex obstacles. In the aspect of path tracking, the tracking error is reduced by 64 %, while maintaining safe distances in various obstacle configurations. Results show that the integrated method successfully combines local optimization prediction capabilities of MPPI with the global velocity planning of GVF, enabling efficient AUV navigation in intricate environments while ensuring the effectiveness and safety of the execution process. The method demonstrates robust performance even under disturbance conditions, maintaining a tracking error of only 0.017 m. This research contributes a solution for AUV operation in challenging maritime settings, with applications in marine surveying, underwater search and rescue, and offshore operations. By addressing key challenges in underwater navigation, this study advances the practical capabilities of AUV technology, paving the way for more efficient and reliable underwater robotic systems.}, archive = {J_ISAT}, author = {Jintao Zhao and Tao Liu and Junhao Huang}, doi = {10.1016/j.isatra.2025.07.020}, journal = {ISA Transactions}, month = {11}, pages = {116-125}, shortjournal = {ISA Trans.}, title = {Enhanced obstacle avoidance for autonomous underwater vehicles via path integral control based on guiding vector field}, volume = {166}, year = {2025}, }
• (2025). Barrier lyapunov function based guidance law design for gap traversal of aerial vehicles. ISAT, 166, 103-115. (www)

  @article{ , abstract = {This manuscript proposes a novel guidance design for the gap traversal of aerial vehicles. The guidance design is performed based on the barrier Lyapunov function using bearing information of the gap. The guidance law is meticulously crafted to operate in scenarios where determining gap edges relies on active vision methods, making it reliable in various real-world applications. What sets this guidance law apart from existing ones is its adherence to a nonlinear framework, refraining from the need to linearize the system dynamics. This remarkable feature allows the proposed guidance design to maintain its effectiveness even when the deviations in the heading and flight path angle are significant from their nominal values. The efficacy of the proposed guidance law is substantiated using a point mass vehicle and the quadrotor in the planar and three-dimensional scenarios. Extensive numerical simulations are conducted to validate the performance of the proposed design, considering wind gusts and Gaussian noise. The results obtained from these simulations demonstrate the efficacy of barrier Lyapunov function-based guidance for aerial vehicles in the context of gap traversal.}, archive = {J_ISAT}, author = {Kumar Abhinav}, doi = {10.1016/j.isatra.2025.06.034}, journal = {ISA Transactions}, month = {11}, pages = {103-115}, shortjournal = {ISA Trans.}, title = {Barrier lyapunov function based guidance law design for gap traversal of aerial vehicles}, volume = {166}, year = {2025}, }
• (2025). Synchronization and tracking control strategy of four-wheel independent steering system based on improved model predictive control method. ISAT, 166, 89-102. (www)

  @article{ , abstract = {Four-wheel independent steering system (4WIS) is a development trend due to its agility, safety, and capability to achieve vehicle smart control. However, improving the synchronization and tracking performance of 4WIS is a great challenge for its multivariable and nonlinear characteristics. To avoid four-wheel asynchrony and decline in tracking performance, a synchronization and tracking control strategy of 4WIS system based on improved model predictive control (MPC) method is proposed in this paper. Firstly, the system mathematical models are established. Next, the synchronization and tracking controller based on MPC and alternating direction method of multipliers (ADMM) is designed to enhance system performance. Finally, strategy performance is validated by simulation, which indicates that the proposed strategy increases the 4WIS synchronization and tracking performance.}, archive = {J_ISAT}, author = {Guan Zhou and Zihao Fang and Dejian Li and Yutao Jin and Yuanlong Wang}, doi = {10.1016/j.isatra.2025.07.025}, journal = {ISA Transactions}, month = {11}, pages = {89-102}, shortjournal = {ISA Trans.}, title = {Synchronization and tracking control strategy of four-wheel independent steering system based on improved model predictive control method}, volume = {166}, year = {2025}, }
• (2025). Active fault diagnosis for AUV over-actuated systems based on UIOs and control allocation. ISAT, 166, 80-88. (www)

  @article{ , abstract = {The navigation performance of autonomous underwater vehicles (AUVs) relies mainly on the propulsion system, which makes the study of the safety and reliability of the propulsion system highly significant. This paper investigates an over-actuated AUV propulsion system with six degrees of freedom and presents an active fault diagnosis framework that combines unknown input observers (UIO) with control allocation. The simulation results show that the proposed integrated methodology successfully performs fault detection, magnitude estimation, and isolation for AUV over-actuated systems. In particular, since no auxiliary signals are added, it is possible to ensure normal operation of the system by only internally adjusting the allocation of the original inputs.}, archive = {J_ISAT}, author = {Yunkai Wu and Zefan Zhu and Peng Shi and Yueyang Li}, doi = {10.1016/j.isatra.2025.07.007}, journal = {ISA Transactions}, month = {11}, pages = {80-88}, shortjournal = {ISA Trans.}, title = {Active fault diagnosis for AUV over-actuated systems based on UIOs and control allocation}, volume = {166}, year = {2025}, }
• (2025). Secure trajectory planning for UAVs in dynamic target tracking against undetectable sensor and actuator attacks. ISAT, 166, 63-79. (www)

  @article{ , abstract = {This paper addresses the challenge of designing a secure flight trajectory for the unmanned aerial vehicle (UAV) in an adversarial environment. The main goal is to ensure the UAV can maintain the predetermined trajectory even when subjected to undetectable attacks on its sensors and actuators. First, the mathematical model of undetectable attacks is conducted, and the conditions under which these attacks cannot be jointly detected by the global positioning system (GPS) and the laser distance sensor (LDS) are specified. Then, the existence and implementation of secure flight trajectories for UAVs under undetectable attacks are explored. A strategy based on Pontryagin’s Maximum Principle is proposed to plan a safe trajectory. This strategy ensures that UAVs can safely reach their destinations, even when facing undetectable attacks. Finally, the superiority and effectiveness of the proposed strategies are proven through numerical simulations and hardware-in-the-loop (HIL) experiments.}, archive = {J_ISAT}, author = {Wei Yue and Xiaoyong Zhang and Zhongchang Liu}, doi = {10.1016/j.isatra.2025.07.028}, journal = {ISA Transactions}, month = {11}, pages = {63-79}, shortjournal = {ISA Trans.}, title = {Secure trajectory planning for UAVs in dynamic target tracking against undetectable sensor and actuator attacks}, volume = {166}, year = {2025}, }
• (2025). Secure set-membership formation of multi-agent systems via an anti-attack control strategy. ISAT, 166, 53-62. (www)

  @article{ , abstract = {Secure leader-following formation for multi-agent systems subject to parameter perturbations and saturation constraints is investigated in this article. To capture the variation of attack behaviors across different stages, a more general DoS attack model is developed using a Markov process with time-varying transition probabilities. Then, a memory-based anti-attack scheme is presented for designing the secure observer-based controller, supplying an effective method to weaken the impact of DoS attacks on formation control. Subsequently, the set-membership concept is introduced to derive some sufficient conditions such that the one-step ahead formation errors are always confined to the tracking ellipsoidal set. Combining the sufficient conditions with saturation constraints, an optimization problem is proposed to obtain the optimal ellipsoidal sets. For reaching the leader-following formation, an online optimization algorithm is provided to recursively solve the observer-based controller. To reduce the execution frequency of the optimization problem, a novel event-triggered mechanism with attack-dependent adaptive threshold is embedded in the optimization algorithm. Finally, the effectiveness and advantages of the proposed methods are certified via a simulation example.}, archive = {J_ISAT}, author = {Zehui Xiao and Jie Tao and Wei Meng and Peng Shi}, doi = {10.1016/j.isatra.2025.07.010}, journal = {ISA Transactions}, month = {11}, pages = {53-62}, shortjournal = {ISA Trans.}, title = {Secure set-membership formation of multi-agent systems via an anti-attack control strategy}, volume = {166}, year = {2025}, }
• (2025). Collision-free formation trajectory tracking control for second-order multi-agent systems by PPC method. ISAT, 166, 41-52. (www)

  @article{ , abstract = {This paper focuses on addressing the problem of realizing formation trajectory tracking and communication maintenance for multi-agent systems. To ensure comprehensive safety, potential collisions among individual agents and between agents and obstacles are considered here. First, to attain the objectives of accurately tracking a formation trajectory while preventing collisions and maintaining communications among the initially connected agents, an expected velocity is designed for each agent by adopting the prescribed performance control (PPC) method. Second, for the purpose of avoiding the collisions between agents and obstacles, a continuous potential function is introduced to generate an obstacle avoidance term in the expected velocity. Further, a control algorithm is devised for each agent to enable it to adjust its velocity to align with the expected velocity. Finally, the simulations demonstrate the effectiveness of this method.}, archive = {J_ISAT}, author = {Liqiu Zhu and Yining Qian and An-Yang Lu}, doi = {10.1016/j.isatra.2025.06.033}, journal = {ISA Transactions}, month = {11}, pages = {41-52}, shortjournal = {ISA Trans.}, title = {Collision-free formation trajectory tracking control for second-order multi-agent systems by PPC method}, volume = {166}, year = {2025}, }
• (2025). Event-triggered control scheme of switched delay systems with mixed achievement by joint switching on input and signal with sampling. ISAT, 166, 25-40. (www)

  @article{ , abstract = {The present work addresses the H 2 and passivity achievement of switched delay model by using the improved event-triggered control (ETC) scheme. Our developed ETC scheme adopts facile joint switching on rule and feedback with sampling instead of real-time monitoring mechanism. The mixed achievement for switched time-delay model under consideration with arbitrary switching rule can also be accomplished by sampling input. The delay and sampled instant are provided under an interval period instead of constant or pointwise one in some previous circulated articles. The proffered matrix presentation approach and some inequalities are applied to show consequences smoothly in this article. Finally, our main developed outcomes are demonstrated by a practical and some numerical examples. Efficiency on saving communication resource and less conservativeness of consequences are observed from the provided information. MSC 34K36, 93C42, 93C43}, archive = {J_ISAT}, author = {Chang-Hua Lien and Hao-Chin Chang and Ker-Wei Yu and Hung-Chin Li and Cheng-Ruei Yu and Sundarapandian Vaidyanathan}, doi = {10.1016/j.isatra.2025.07.001}, journal = {ISA Transactions}, month = {11}, pages = {25-40}, shortjournal = {ISA Trans.}, title = {Event-triggered control scheme of switched delay systems with mixed achievement by joint switching on input and signal with sampling}, volume = {166}, year = {2025}, }
• (2025). Event-triggered distributed state and disturbance estimation for LTI systems using a network of observers. ISAT, 166, 14-24. (www)

  @article{ , abstract = {In this paper, the distributed estimation issues of state, unknown input and measurement noise are studied. First, the new auxiliary output matrices are constructed such that the auxiliary output is unaffected by measurement noise. Second, an event-triggered mechanism is developed, and a predefined-time distributed estimation method is proposed to estimate the auxiliary output matrices. Then, the unknown input is treated as the output of an external system, and the original system state together with external system state is augmented into a new state. Third, the event-triggered distributed observers are designed to estimate original system state and unknown input. In addition, the measurement noise is also reconstructed. Finally, the simulation shows that the system state and all disturbances are estimated asymptotically, which significantly reduces the communication burden.}, archive = {J_ISAT}, author = {Junqi Yang and Dongzheng Wang and Jianfeng Xu and Yantao Chen}, doi = {10.1016/j.isatra.2025.07.017}, journal = {ISA Transactions}, month = {11}, pages = {14-24}, shortjournal = {ISA Trans.}, title = {Event-triggered distributed state and disturbance estimation for LTI systems using a network of observers}, volume = {166}, year = {2025}, }
• (2025). Periodic event-triggered robust trajectory tracking control for underactuated unmanned surface vehicle without velocity measurement. ISAT, 166, 1-13. (www)

  @article{ , abstract = {This paper proposes a periodic event-triggered control (PETC) algorithm for underactuated unmanned surface vehicle (USV) subject to unknown exogenous perturbances within limited communication bandwidth. Initially, the underactuated USV model is reformulated using output redefinition-based dynamic inversion (ORDI) so that the system attains a well-defined relative degree through an approximate variable vector. While typical USV control strategies isolate the yaw and surge channel, the ORDI integrates both dimensions into a single framework to adopt a direct controller design. Subsequently, the minimum-learning-parameter radial basis function neural network (RBFNN) with adaptive laws is employed to effectively approximate the nonlinear dynamics and external perturbations with rapid and fewer computations. After that, an anti-chattering velocity observer is presented to provide accurate velocity estimation based solely on position data transmission. Building on this, a PETC algorithm is introduced which balances the periodic sampling with traditional event-triggered control via a sliding mode manifold. This mechanism is designed to assess the requirement for computations and the subsequent transmission of updated measurements alongside current control signals. Furthermore, it can dynamically adjust the communication frequency between the controller and the actuators, in accordance with the digital platform’s demands. Moreover, Theoretical analysis rigorously proves that state errors and estimation errors converge to equilibrium and ensure the system stability. Numerical simulations substantiate the robustness and superior performance of the proposed control scheme under bandwidth limitations and uncertain conditions.}, archive = {J_ISAT}, author = {Enhua Zhang and Jian Wang and Xing Wang and Xiaofeng Liang}, doi = {10.1016/j.isatra.2025.07.002}, journal = {ISA Transactions}, month = {11}, pages = {1-13}, shortjournal = {ISA Trans.}, title = {Periodic event-triggered robust trajectory tracking control for underactuated unmanned surface vehicle without velocity measurement}, volume = {166}, year = {2025}, }

ISCI - 4

• (2026). Mitigating malware prevalence in networks with arbitrary topologies: A flip-it cyber game approach integrated with epidemic modeling. ISCI, 726, 122753. (www)

  @article{ , abstract = {Cyber threats have evolved in complexity, aiming at a wide range of sectors using advanced methods and tools. This evolving threat landscape challenges existing cybersecurity frameworks, many of which lack the adaptability to counteract the complex tactics of sophisticated adversaries. Developing robust cyber defense strategies requires simulating dynamic interactions between attackers and defenders across high, moderate, and low-impact scenarios. The Flip-It cyber game serves as an intelligent framework for simulating these interactions, enabling the analysis of adaptive strategies in cybersecurity. This paper aims to address the problem of mitigating malware prevalence with full consideration of attack/defense capabilities in arbitrary network topologies. This paper proposes a sophisticated discrete-time epidemic model to characterize security state transitions over time for all three scenarios within the Flip-It game framework. On this basis, the original problem is modeled as a closed-loop control problem to seek the optimal containment strategy. Deep Reinforcement Learning (DRL) is then used to tackle the problem, generating efficient defense strategies that are well-adapted to changing cybersecurity environments. Numerical simulations based on small-world networks, scale-free networks, and router networks are then carried out to generate corresponding strategies. Additionally, we have evaluated the performance of the proposed method against the State-Of-The-Art (SOTA) in terms of attack/defense objective function, control actions, number of devices under the control of the attacker and defender, stability, execution time, and scalability. This comprehensive approach integrates epidemiological modeling, game theory, and advanced machine learning to effectively tackle the complexities of contemporary cybersecurity threats.}, archive = {J_ISCI}, author = {Mousa Tayseer Jafar and Lu-Xing Yang and Gang Li and Robin Doss and Kon Mouzakis and Rajesh Vasa and Helge Janicke and Ahmed Ibrahim and Ahmed Mohsin and Iqbal H. Sarker and Kristen Moore and Seyit Camtepe and Diksha Goel}, doi = {10.1016/j.ins.2025.122753}, journal = {Information Sciences}, month = {2}, pages = {122753}, shortjournal = {Inf. Sci.}, title = {Mitigating malware prevalence in networks with arbitrary topologies: A flip-it cyber game approach integrated with epidemic modeling}, volume = {726}, year = {2026}, }
• (2026). Multi-granularity spectral graph coarsening. ISCI, 726, 122748. (www)

  @article{ , abstract = {Graph coarsening is the process of simplifying large-scale graph representations while preserving essential structural characteristics to improve computational efficiency in graph processing. Conventional techniques primarily reduce graph size through node and edge merging but often inadequately preserve both global spectral properties and local structural details. Real-world graphs exhibit inherent hierarchical complexity comprising critical global topological patterns and local structural features necessary for accurate analysis. To address these limitations, we present a Multi-Granularity Spectral Graph Coarsening (MGSGC) framework that systematically integrates spectral graph analysis with local structural preservation through multi-granularity operations. Our approach initiates with hierarchical graph decomposition, where node merging generates structurally homogeneous subgraphs. Spectral analysis of normalized Laplacian matrices guides iterative coarsening optimization, using spectral distance metrics to identify subgraphs requiring refinement. A dual-resolution mechanism preserves global spectral signatures and local connectivity patterns simultaneously, ensuring retention of both macroscopic and microscopic structural information. Comprehensive experiments across multiple benchmark datasets demonstrate that MGSGC outperforms recent methods, achieving higher accuracy, superior structural preservation, and strong resilience to label noise, ensuring robust performance in real-world scenarios. Code is available at https://anonymous.4open.science/r/MGSGC/ .}, archive = {J_ISCI}, author = {Jinyuan Ni and Long Chen and Ning Yu}, doi = {10.1016/j.ins.2025.122748}, journal = {Information Sciences}, month = {2}, pages = {122748}, shortjournal = {Inf. Sci.}, title = {Multi-granularity spectral graph coarsening}, volume = {726}, year = {2026}, }
• (2026). A unified algebraic framework for vagueness and granularity in fuzzy and rough set theories. ISCI, 726, 122726. (www)

  @article{ , abstract = {We investigate the identification of the Boolean algebra ℘ ( X ) of all subsets of a universe X with the set E ( X ) = { 0 , 1 } X of characteristic functions, focusing on the expression of the complement operation in three equivalent forms. Building on this, we extend the framework to fuzzy sets f : X → [ 0 , 1 ] , which form a complete distributive lattice equipped with three distinct complement operations: • the Zadeh (Kleene) complement f ′ ( x ) = 1 − f ( x ) , • the Brouwer (intuitionistic) complement f ∼ ( x ) = χ { x ∈ X : f ( x ) = 0 } , and • the anti-Brouwer complement f ♭ ( x ) = χ { x ∈ X : f ( x ) ≠ 1 } . We analyze the algebraic properties and interrelations of these complements. This leads to the study of Brouwer–Zadeh (BZ) algebras, which generalize Boolean algebras to lattices with two non-standard complements linked via a ∼ ′ = a ∼∼ , implying a ∼ ≤ a ′ . We show that any BZ algebra naturally decomposes into three non-overlapping components: a Zadeh algebra, a Brouwer algebra, and an anti-Brouwer algebra. Furthermore, we derive two significant structures from BZ algebras: • the Pawlak Rough Approximation Structure (RAS), and • the Kuratowski Abstract Topological Structure (ATS). To model information granularity and graduality, we introduce the Pawlak operator into the BZ framework, yielding the Pawlak–Brouwer–Zadeh (PBZ) lattice. This enriched structure allows us to formally distinguish between vagueness and ambiguity in RAS and to model granularity in fuzzy sets, providing an algebraic foundation for shadowed sets and related granular models.}, archive = {J_ISCI}, author = {Gianpiero Cattaneo and Salvatore Greco and Roman Słowiński}, doi = {10.1016/j.ins.2025.122726}, journal = {Information Sciences}, month = {2}, pages = {122726}, shortjournal = {Inf. Sci.}, title = {A unified algebraic framework for vagueness and granularity in fuzzy and rough set theories}, volume = {726}, year = {2026}, }
• (2026). The envelope of one-dimensional discrete-time quantum walk. ISCI, 726, 122722. (www)

  @article{ , abstract = {A mathematical model is presented for a one-dimensional discrete-time quantum walk, which is initiated from a quantum initial state and governed by a coin operator. When the coin operator is a flip operator, a path analysis formula is employed to compute the position probability distribution. For a general coin operator, matrix decomposition is utilized to transform it into the equivalent flip operator. When a walker undergoes n steps of evolution, it is observed that the probability of the walker occupying any given position exhibits the existence of both maximum and minimum values, irrespective of the quantum initial state. By linking these extreme positions together, a confined region is delineated, the boundary of which is designated as the envelope of the quantum walk. Remarkably, the envelope is independent of the quantum initial state. To facilitate the computation of this envelope, the relevant formulas are transformed into rational expressions, wherein both the numerators and denominators are represented by polynomials with even integer coefficients. These polynomials are classified to determine the coefficients of the numerator polynomials. An analysis is conducted to identify the location of the maximum value of the envelope, thereby examining the maximum value of the position probability distribution.}, archive = {J_ISCI}, author = {Yunguo Lin and Shuiying Cai}, doi = {10.1016/j.ins.2025.122722}, journal = {Information Sciences}, month = {2}, pages = {122722}, shortjournal = {Inf. Sci.}, title = {The envelope of one-dimensional discrete-time quantum walk}, volume = {726}, year = {2026}, }

JAIM - 11

• (2025). Real topological hochschild homology via the norm and real witt vectors. JAIM, 482, 110568. (www)

  @article{ , abstract = {We prove that Real topological Hochschild homology can be characterized as the norm from the cyclic group of order 2 to the orthogonal group O ( 2 ) . From this perspective, we then prove a multiplicative double coset formula for the restriction of this norm to dihedral groups of order 2 m . This informs our new definition of Real Hochschild homology of rings with anti-involution, which we show is the algebraic analogue of Real topological Hochschild homology. Using extra structure on Real Hochschild homology, we define a new theory of p -typical Witt vectors of rings with anti-involution. We end with an explicit computation of the degree zero D 2 m -Mackey functor homotopy groups of THR ( Z _ ) for m odd. This uses a Tambara reciprocity formula for sums for general finite groups, which may be of independent interest.}, archive = {J_JAIM}, author = {Gabriel Angelini-Knoll and Teena Gerhardt and Michael A. Hill}, doi = {10.1016/j.aim.2025.110568}, journal = {Advances in Mathematics}, month = {12}, pages = {110568}, shortjournal = {Adv. Math.}, title = {Real topological hochschild homology via the norm and real witt vectors}, volume = {482}, year = {2025}, }
• (2025). Higgs and coulomb branches from superconformal raviolo vertex algebras. JAIM, 482, 110566. (www)

  @article{ , abstract = {We propose a method for extracting the Higgs and Coulomb branches of a three-dimensional N = 4 quantum field theory from the algebra of local operators in its holomorphic-topological twist using the formalism of raviolo vertex algebras. Our construction parallels that of the chiral ring and twisted chiral ring of an N = 2 superconformal vertex operator algebra.}, archive = {J_JAIM}, author = {Niklas Garner and Surya Raghavendran and Brian R. Williams}, doi = {10.1016/j.aim.2025.110566}, journal = {Advances in Mathematics}, month = {12}, pages = {110566}, shortjournal = {Adv. Math.}, title = {Higgs and coulomb branches from superconformal raviolo vertex algebras}, volume = {482}, year = {2025}, }
• (2025). Quasimodularity and limiting behavior for variations of MacMahon series. JAIM, 482, 110565. (www)

  @article{ , abstract = {Motivated by the 1920's seminal work of Major MacMahon, Amdeberhan–Andrews–Tauraso recently introduced an infinite family of q -series U t ( a ; q ) : = ∑ 1 ≤ n 1 < n 2 < ⋯ < n t q n 1 + n 2 + ⋯ + n t ( 1 + a q n 1 + q 2 n 1 ) ( 1 + a q n 2 + q 2 n 2 ) ⋯ ( 1 + a q n t + q 2 n t ) and proved that these functions are linear combinations of quasimodular forms. In this paper, we study a broader family of q -series that contains the collection { U t } t ∈ N . Using the theory of quasi shuffle algebras, we show that this extended family also lies in the algebra of quasimodular forms. Moreover, we determine the precise weights and levels of these functions, thereby making Amdeberhan–Andrews–Tauraso's result sharp. We further investigate the limiting behavior of these functions. In particular, we demonstrate that the sequence of quasimodular forms { U t ( 1 ; q ) } t ∈ N gives an approximation for the ordinary partition function. We also establish infinitely many closed formulas for reciprocals of certain infinite products in terms of U t ( a ; q ) .}, archive = {J_JAIM}, author = {Caner Nazaroglu and Badri Vishal Pandey and Ajit Singh}, doi = {10.1016/j.aim.2025.110565}, journal = {Advances in Mathematics}, month = {12}, pages = {110565}, shortjournal = {Adv. Math.}, title = {Quasimodularity and limiting behavior for variations of MacMahon series}, volume = {482}, year = {2025}, }
• (2025). Entanglement entropy in the ground state of non-interacting massless dirac fermions in dimension one. JAIM, 482, 110562. (www)

  @article{ , abstract = {We present a novel proof of a formula of Casini and Huerta for the entanglement entropy of the ground state of non-interacting massless Dirac fermions in dimension one localized to (a union of) intervals and generalize it to the case of Rényi entropies. At first, we prove that these entropies are well-defined for non-intersecting intervals. This is accomplished by an inequality of Alexander V. Sobolev. Then we compute this entropy using a trace formula for Wiener–Hopf operators by Harold Widom. For intersecting intervals, we discuss an extended entropy formula of Casini and Huerta and support this with a proof for polynomial test functions (instead of entropy).}, archive = {J_JAIM}, author = {Fabrizio Ferro and Paul Pfeiffer and Wolfgang Spitzer}, doi = {10.1016/j.aim.2025.110562}, journal = {Advances in Mathematics}, month = {12}, pages = {110562}, shortjournal = {Adv. Math.}, title = {Entanglement entropy in the ground state of non-interacting massless dirac fermions in dimension one}, volume = {482}, year = {2025}, }
• (2025). Points of bounded height on quintic del pezzo surfaces over number fields. JAIM, 482, 110561. (www)

  @article{ , abstract = {We prove Manin's conjecture for split smooth quintic del Pezzo surfaces over arbitrary number fields with respect to fairly general anticanonical height functions. After passing to universal torsors, we first show that we may restrict the torsor variables to their typical sizes, and then we can solve the counting problem in the framework of o-minimal structures.}, archive = {J_JAIM}, author = {Christian Bernert and Ulrich Derenthal}, doi = {10.1016/j.aim.2025.110561}, journal = {Advances in Mathematics}, month = {12}, pages = {110561}, shortjournal = {Adv. Math.}, title = {Points of bounded height on quintic del pezzo surfaces over number fields}, volume = {482}, year = {2025}, }
• (2025). The hitchin fibration for symmetric pairs. JAIM, 482, 110560. (www)

  @article{ , abstract = {We introduce and describe the “regular quotient” for the Hitchin fibration for symmetric spaces and explain some basic consequences for Higgs bundles. We include an invariant theoretic approach to spectral covers in this setting for the particular space GL 2 n / GL n × GL n . We also include a study of the regular centralizer group scheme for quasisplit pairs, including a Galois description of a closely related group scheme. We collect some basic consequences for Hitchin systems associated to such pairs.}, archive = {J_JAIM}, author = {Thomas Hameister and Benedict Morrissey}, doi = {10.1016/j.aim.2025.110560}, journal = {Advances in Mathematics}, month = {12}, pages = {110560}, shortjournal = {Adv. Math.}, title = {The hitchin fibration for symmetric pairs}, volume = {482}, year = {2025}, }
• (2025). Landis-type results for discrete equations. JAIM, 482, 110558. (www)

  @article{ , abstract = {We prove Landis-type results for both the semidiscrete heat and the stationary discrete Schrödinger equations. For the semidiscrete heat equation we show that, under the assumption of two-time spatial decay conditions on the solution u , then necessarily u ≡ 0 . For the stationary discrete Schrödinger equation we deduce that, under a vanishing condition at infinity on the solution u , then u ≡ 0 . In order to obtain such results, we demonstrate suitable quantitative upper and lower estimates for the L 2 -norm of the solution within a spatial lattice ( h Z ) d . These estimates manifest an interpolation phenomenon between continuum and discrete scales, showing that close-to-continuum and purely discrete regimes are different in nature.}, archive = {J_JAIM}, author = {Aingeru Fernández-Bertolin and Luz Roncal and Diana Stan}, doi = {10.1016/j.aim.2025.110558}, journal = {Advances in Mathematics}, month = {12}, pages = {110558}, shortjournal = {Adv. Math.}, title = {Landis-type results for discrete equations}, volume = {482}, year = {2025}, }
• (2025). SL2-like properties of matrices over noncommutative rings and generalizations of markov numbers. JAIM, 482, 110556. (www)

  @article{ , abstract = {We study 2 × 2 matrices over noncommutative rings with anti-involution, with a special focus on the symplectic group Sp 2 ( A , σ ) . We define traces and determinants of such matrices and use them to prove a Cayley Hamilton identity and trace relations which generalize well known relations for elements of SL 2 ( R ) over a commutative ring. We compare the structure of elements of Sp 2 ( A , σ ) with Manin matrices over general noncommutative rings; this naturally leads to a quantization Sp 2 ( A , σ ) q . In contrast to the usual definition of the quantum group as a deformation of the ring of matrix functions on SL 2 ( R ) , this quantization produces a group of matrices over a new noncommutative ring with involution. We finish the comparison by constructing a generalization of a Hopf algebra structure on the noncommutative ring of matrix functions of our quantum group. Finally, we use the noncommutative surface-type cluster algebras of Berenstein and Retakh to give a geometric interpretation of our Hopf algebra structure and to produce noncommutative generalizations of Markov numbers over many rings with involution including the complex numbers, dual numbers, matrix rings, and group rings.}, archive = {J_JAIM}, author = {Zachary Greenberg and Dani Kaufman and Anna Wienhard}, doi = {10.1016/j.aim.2025.110556}, journal = {Advances in Mathematics}, month = {12}, pages = {110556}, shortjournal = {Adv. Math.}, title = {SL2-like properties of matrices over noncommutative rings and generalizations of markov numbers}, volume = {482}, year = {2025}, }
• (2025). Convergence and collapsing of CAT(0)-lattices. JAIM, 482, 110555. (www)

  @article{ , abstract = {We study the theory of convergence for CAT(0)-lattices (that is groups Γ acting geometrically on proper, geodesically complete CAT(0)-spaces) and their quotients (CAT(0)-orbispaces). We describe some splitting and collapsing phenomena, explaining precisely how the actions can degenerate to a possibly non-discrete limit action, and prove a compactness theorem for the class of compact CAT(0)-homology orbifolds. Finally, as an application of this theory, we prove an isolation result for flat orbispaces and an entropy-pinching theorem.}, archive = {J_JAIM}, author = {Nicola Cavallucci and Andrea Sambusetti}, doi = {10.1016/j.aim.2025.110555}, journal = {Advances in Mathematics}, month = {12}, pages = {110555}, shortjournal = {Adv. Math.}, title = {Convergence and collapsing of CAT(0)-lattices}, volume = {482}, year = {2025}, }
• (2025). A short proof of a conjecture of matsushita. JAIM, 482, 110554. (www)

  @article{ , abstract = {We build on the arguments of van Geemen and Voisin [24] to prove a conjecture of Matsushita that a Lagrangian fibration of an irreducible hyperkähler manifold is either isotrivial or of maximal variation. We also complete a partial result of Voisin [26] regarding the density of torsion points of sections of Lagrangian fibrations.}, archive = {J_JAIM}, author = {Benjamin Bakker}, doi = {10.1016/j.aim.2025.110554}, journal = {Advances in Mathematics}, month = {12}, pages = {110554}, shortjournal = {Adv. Math.}, title = {A short proof of a conjecture of matsushita}, volume = {482}, year = {2025}, }
• (2025). Orbifolds of pointed vertex operator algebras i. JAIM, 482, 110546. (www)

  @article{ , abstract = {By a pointed vertex operator algebra (VOA) we mean one whose modules are all simple currents (i.e. invertible), e.g. even positive definite lattice VOAs. This paper systematically explores the interplay between their orbifolds and tensor category theory. We begin by supplying an elementary proof of the Dijkgraaf–Witten conjecture, which predicts the representation theory of holomorphic VOA orbifolds. We then apply that argument more generally to the situation where the orbifold group G (a subgroup of the automorphism group of the VOA) fixes all VOA modules, and relate the result to recent work of Mason–Ng and Naidu. Here our results are complete. We then turn to the other extreme, where the automorphisms act fixed-point freely on the modules, and realize any possible finite nilpotent group as such a G . This affords a considerable generalization of the Tambara-Yamagami categories. We conclude by considering some hybrid actions. In this way we use tensor category theory to organize and generalize systematically several isolated examples and special cases scattered in the literature. Conversely, we show how VOA orbifolds can be used to construct broad classes of braided crossed fusion categories and modular tensor categories.}, archive = {J_JAIM}, author = {Terry Gannon and Andrew Riesen}, doi = {10.1016/j.aim.2025.110546}, journal = {Advances in Mathematics}, month = {12}, pages = {110546}, shortjournal = {Adv. Math.}, title = {Orbifolds of pointed vertex operator algebras i}, volume = {482}, year = {2025}, }

JAT - 2

• (2026). Asymptotics of the humbert functions Ψ1 and Ψ2. JAT, 314, 106233. (www)

  @article{ , abstract = {A compilation of new results on the asymptotic behaviour of the Humbert functions Ψ 1 and Ψ 2 , and also on the Appell function F 2 , is presented. As a by-product, we confirm a conjectured limit which appeared recently in the study of the 1 D Glauber–Ising model. We also propose two elementary asymptotic methods and confirm through some illustrative examples that both methods have great potential and can be applied to a large class of problems of asymptotic analysis. Finally, some directions of future research are pointed out in order to suggest ideas for further study.}, archive = {J_JAT}, author = {Peng-Cheng Hang and Malte Henkel and Min-Jie Luo}, doi = {10.1016/j.jat.2025.106233}, journal = {Journal of Approximation Theory}, month = {3}, pages = {106233}, shortjournal = {J. Approx. Theory}, title = {Asymptotics of the humbert functions Ψ1 and Ψ2}, volume = {314}, year = {2026}, }
• (2026). Nevai’s condition for measures with unbounded supports. JAT, 314, 106232. (www)

  @article{ , abstract = {We study Nevai’s condition from the theory of orthogonal polynomials on the real line. We prove that a large class of measures with unbounded Jacobi parameters satisfies Nevai’s condition locally uniformly on the support of the measure away from a finite explicit set. This allows us to give applications to relative uniform and weak asymptotics of Christoffel–Darboux kernels on the diagonal and to limit theorems for unconventionally normalized global linear statistics of orthogonal polynomial ensembles.}, archive = {J_JAT}, author = {Grzegorz Świderski}, doi = {10.1016/j.jat.2025.106232}, journal = {Journal of Approximation Theory}, month = {3}, pages = {106232}, shortjournal = {J. Approx. Theory}, title = {Nevai’s condition for measures with unbounded supports}, volume = {314}, year = {2026}, }

JDE - 21

• (2026). On a scaled abstract linking theorem with an application to the Schrödinger–Poisson–Slater equation. JDE, 453, 113824. (www)

  @article{ , abstract = {We prove an abstract linking theorem that can be used to show existence of solutions to various types of variational elliptic equations, including Schrödinger–Poisson–Slater type equations.}, archive = {J_JDE}, author = {Kanishka Perera and Kaye Silva}, doi = {10.1016/j.jde.2025.113824}, journal = {Journal of Differential Equations}, month = {2}, pages = {113824}, shortjournal = {J. Diff. Equ.}, title = {On a scaled abstract linking theorem with an application to the Schrödinger–Poisson–Slater equation}, volume = {453}, year = {2026}, }
• (2026). Variational principles of invariance entropy dimension. JDE, 453, 113819. (www)

  @article{ , abstract = {We introduce two types of invariance entropy dimensions ( α -invariance entropies), measure-theoretic invariance entropy dimensions (measure-theoretic α -invariance entropies), and measure-theoretic local invariance entropy dimensions (measure-theoretic local α -invariance entropy) to investigate the complexity of a control system with zero invariance entropy, where α ∈ R + . Under some reasonable assumptions, we respectively present two variational principles and inverse variational principles for α -invariance entropies and invariance entropy dimensions, and show that Bowen α -invariance entropy (Bowen invariance entropy dimension) and packing α -invariance entropy (packing invariance entropy dimension) can be determined via the corresponding local entropies of measures.}, archive = {J_JDE}, author = {Hu Chen and Yu Huang and Xingfu Zhong}, doi = {10.1016/j.jde.2025.113819}, journal = {Journal of Differential Equations}, month = {2}, pages = {113819}, shortjournal = {J. Diff. Equ.}, title = {Variational principles of invariance entropy dimension}, volume = {453}, year = {2026}, }
• (2026). Invariant tori of a class of discontinuous systems. JDE, 453, 113818. (www)

  @article{ , abstract = {By using suitable canonical transformation and Moser's small twist Theorem, we prove the existence of invariant tori of large amplitude for a periodically forced second-order differential equation with a jump discontinuity.}, archive = {J_JDE}, author = {Qihuai Liu and Pedro J. Torres}, doi = {10.1016/j.jde.2025.113818}, journal = {Journal of Differential Equations}, month = {2}, pages = {113818}, shortjournal = {J. Diff. Equ.}, title = {Invariant tori of a class of discontinuous systems}, volume = {453}, year = {2026}, }
• (2026). An application of the ważewski principle to the characterization of continuous probability distributions. JDE, 453, 113817. (www)

  @article{ , abstract = {We introduce an unexpected application of the Ważewski retract principle to a probabilistic challenge: identifying probability distributions via the regression function of ordered statistical data such as order statistics and record values. In order to prevent repetitive arguments across various models, we examine a wide-ranging category of models known as generalized order statistics. We establish a precise formula for the underlying distribution using a specified regression and a solution to an additional Volterra-Stieltjes integral equation. Moreover, we identify the class of feasible regression functions by determining the necessary and sufficient conditions for a function to qualify as a regression. Our findings are supported by examples that highlight the importance of the stipulated conditions.}, archive = {J_JDE}, author = {Mariusz Bieniek}, doi = {10.1016/j.jde.2025.113817}, journal = {Journal of Differential Equations}, month = {2}, pages = {113817}, shortjournal = {J. Diff. Equ.}, title = {An application of the ważewski principle to the characterization of continuous probability distributions}, volume = {453}, year = {2026}, }
• (2026). Fractional de giorgi conjecture in dimension 2 via complex-plane methods. JDE, 453, 113816. (www)

  @article{ , abstract = {We provide a new proof of the fractional version of the De Giorgi conjecture for the Allen-Cahn equation in R 2 for the full range of exponents. Our proof combines a method introduced by A. Farina in 2003 with the s -harmonic extension of the fractional Laplacian in the half-space R + 3 introduced by L. Caffarelli and L. Silvestre in 2007. We also provide a representation formula for finite-energy weak solutions of a class of weighted elliptic partial differential equations in the half-space R + n + 1 under Neumann boundary conditions. This generalizes the s -harmonic extension of the fractional Laplacian and allows us to relate a general problem in the extended space with a nonlocal problem on the trace.}, archive = {J_JDE}, author = {Serena Dipierro and João Gonçalves da Silva and Giorgio Poggesi and Enrico Valdinoci}, doi = {10.1016/j.jde.2025.113816}, journal = {Journal of Differential Equations}, month = {2}, pages = {113816}, shortjournal = {J. Diff. Equ.}, title = {Fractional de giorgi conjecture in dimension 2 via complex-plane methods}, volume = {453}, year = {2026}, }
• (2026). Harmonic mappings on grushin planes. JDE, 453, 113806. (www)

  @article{ , abstract = {We study the Grushin spaces given by Hölder regular vector fields with the Carnot–Carathéodory distance, equipped with the natural weighted n -Lebesgue measure. It turns out that such a measure is n -Ahlfors regular and p -Muckenhoupt for p > 1 . We investigate the related 2-Dirichlet energy and the harmonic mappings, and focus our attention on harmonic functions and mappings from domains in a Grushin plane to Euclidean spaces R m , for m ≥ 1 . Our results enclose the second order Sobolev regularity, the Bochner identity and its consequences for the regularity of harmonic mappings, the Liouville-type theorems and a counterpart of the Lewy theorem. Furthermore, the Korevaar–Schoen energy of mappings on Grushin planes is studied and proven to be equivalent to the 2-Dirichlet energy. The discussion is illustrated by several examples. We generalize some geometric and regularity results by Ferrari–Valdinoci [23] and Franchi–Serapioni [30] .}, archive = {J_JDE}, author = {Tomasz Adamowicz and Marcin Walicki and Ben Warhurst}, doi = {10.1016/j.jde.2025.113806}, journal = {Journal of Differential Equations}, month = {2}, pages = {113806}, shortjournal = {J. Diff. Equ.}, title = {Harmonic mappings on grushin planes}, volume = {453}, year = {2026}, }
• (2026). Existence and nonlinear stability of stationary solutions to the outflow problem of the one-dimensional full compressible navier-stokes-allen-cahn system. JDE, 453, 113803. (www)

  @article{ , abstract = {This paper is concerned with the large-time behavior of solutions toward a stationary solution for the outflow problem of the full compressible Navier-Stokes-Allen-Cahn system in the half-space R + . The model can be used to describe the motion of a mixture of two viscous compressible fluids. First, we give some sufficient conditions for the existence of stationary solution via the manifold theory and the center manifold theory. Second, by using the elementary L 2 -energy method, it is shown that the stationary solution is time-asymptotically stable provided that the initial perturbation and the strength of the stationary solution are sufficiently small. Finally, the convergence rates of solutions towards the stationary one are also established by employing a time and space weighted energy method. Our analysis is based on some new techniques which take into account the effect of the phase field variable.}, archive = {J_JDE}, author = {Zhengzheng Chen and Dan Lei and Haiyan Yin}, doi = {10.1016/j.jde.2025.113803}, journal = {Journal of Differential Equations}, month = {2}, pages = {113803}, shortjournal = {J. Diff. Equ.}, title = {Existence and nonlinear stability of stationary solutions to the outflow problem of the one-dimensional full compressible navier-stokes-allen-cahn system}, volume = {453}, year = {2026}, }
• (2026). Conditions for uniform regularity of compressible MHD system in small alfvén and mach numbers with tangential magnetic fields to the physical boundary. JDE, 453, 113801. (www)

  @article{ , abstract = {This paper investigates the uniform regularity of solutions to the compressible magnetohydrodynamics (MHD) system in the half-space R + 3 in small Alfvén and Mach Numbers. The study focuses on the case where the magnetic field is tangential to the physical boundary, satisfying the perfect conducting boundary condition, while the velocity field adheres to a Navier-slip boundary condition. Under the condition that bounds the normal derivatives of the velocity and magnetic field uniformly in ϵ (the small Alfvén and Mach Numbers), we establish uniform estimates for the solutions in high-order conormal Sobolev norms. The results distinguish the previous works primarily addressing cases where the magnetic field is transversal to the boundary.}, archive = {J_JDE}, author = {Yingzhi Du and Tao Luo and Xin Xu}, doi = {10.1016/j.jde.2025.113801}, journal = {Journal of Differential Equations}, month = {2}, pages = {113801}, shortjournal = {J. Diff. Equ.}, title = {Conditions for uniform regularity of compressible MHD system in small alfvén and mach numbers with tangential magnetic fields to the physical boundary}, volume = {453}, year = {2026}, }
• (2026). Threshold dynamics for the 3d radial NLS with combined nonlinearity. JDE, 453, 113800. (www)

  @article{ , abstract = {We consider the nonlinear Schrödinger equation with focusing quintic and defocusing cubic nonlinearity in three space dimensions: ( i ∂ t + Δ ) u = | u | 2 u − | u | 4 u . In [18] , the authors classified the dynamics of solutions under the energy constraint E ( u ) < E c ( W ) , where W is the quintic NLS ground state and E c is the quintic NLS energy. In this work we classify the dynamics of H 1 solutions at the threshold E ( u ) = E c ( W ) .}, archive = {J_JDE}, author = {Alex H. Ardila and Jason Murphy and Jiqiang Zheng}, doi = {10.1016/j.jde.2025.113800}, journal = {Journal of Differential Equations}, month = {2}, pages = {113800}, shortjournal = {J. Diff. Equ.}, title = {Threshold dynamics for the 3d radial NLS with combined nonlinearity}, volume = {453}, year = {2026}, }
• (2026). Internal control of the transition kernel for stochastic lattice dynamics. JDE, 453, 113798. (www)

  @article{ , abstract = {In [4] , we initiated the first study of control problems for kinetic equations arising from harmonic chains. Specifically, we developed impulsive and feedback control mechanisms for harmonic chains coupled with a point thermostat, effectively enabling control over the boundary conditions of the corresponding kinetic equations. However, the more intricate and fundamental challenge of internal control - namely, the design of control strategies that influence the collision operators within the kinetic framework - remained open. In the present work, we address the internal control problem for stochastic lattice dynamics, with the objective of controlling the transition kernel of the limiting kinetic equation. A central innovation of our approach is the development of a novel geometric-combinatorial framework, which enables the systematic construction of control pathways within the microscopic dynamics. This methodology opens a new avenue for the internal control of kinetic equations.}, archive = {J_JDE}, author = {Amirali Hannani and Minh-Nhat Phung and Minh-Binh Tran and Emmanuel Trélat}, doi = {10.1016/j.jde.2025.113798}, journal = {Journal of Differential Equations}, month = {2}, pages = {113798}, shortjournal = {J. Diff. Equ.}, title = {Internal control of the transition kernel for stochastic lattice dynamics}, volume = {453}, year = {2026}, }
• (2026). Nonlinear bound states with prescribed angular momentum in the mass supercritical regime. JDE, 453, 113796. (www)

  @article{ , abstract = {In this paper, we consider the existence, orbital stability/instability and regularity of bound state solutions to nonlinear Schrödinger equations with super-quadratic confinement in two and three spatial dimensions for the mass supercritical case. Such solutions, which are given by time-dependent rotations of a non-radially symmetric spatial profile, correspond to critical points of the underlying energy function restricted on the double constraints consisting of the mass and the angular momentum. The study exhibits new pictures for rotating Bose-Einstein condensates within the framework of Gross-Pitaevskii theory. It is proved that there exist two non-radial symmetric solutions, one of which is local minimizer and the other is mountain pass type critical point of the underlying energy function restricted on the constraints. Moreover, we derive conditions that guarantee that local minimizers are regular, the set of those is orbitally stable and mountain pass type solutions are strongly unstable. The results extend and complement the recent ones in [17] , where the consideration is undertaken in the mass subcritical case.}, archive = {J_JDE}, author = {Tianxiang Gou and Xiaoan Shen}, doi = {10.1016/j.jde.2025.113796}, journal = {Journal of Differential Equations}, month = {2}, pages = {113796}, shortjournal = {J. Diff. Equ.}, title = {Nonlinear bound states with prescribed angular momentum in the mass supercritical regime}, volume = {453}, year = {2026}, }
• (2026). Wave breaking criteria for a generalized fornberg-whitham equation. JDE, 453, 113795. (www)

  @article{ , abstract = {The blowup features for a generalized Fornberg-Whitham equation are investigated on the line. Using the L 2 conservation law and the method to construct Lyapunov functions, sufficient conditions ensuring that wave breaking occurs for the equation are provided. Under certain assumptions, our wave breaking results improve the wave breaking criteria in Wei (2023) [25] .}, archive = {J_JDE}, author = {Changtai Zhou and Shaoyong Lai}, doi = {10.1016/j.jde.2025.113795}, journal = {Journal of Differential Equations}, month = {2}, pages = {113795}, shortjournal = {J. Diff. Equ.}, title = {Wave breaking criteria for a generalized fornberg-whitham equation}, volume = {453}, year = {2026}, }
• (2026). Boundedness of weak solutions to degenerate kolmogorov equations of hypoelliptic type in bounded domains. JDE, 453, 113794. (www)

  @article{ , abstract = {We establish the boundedness of weak subsolutions for a class of degenerate Kolmogorov equations of the hypoelliptic type, compatible with a homogeneous Lie group structure, within bounded product domains using the De Giorgi iteration. We employ the renormalization formula to handle boundary values and provide energy estimates. An L 1 – L p type embedding estimate derived from the fundamental solution is utilized to incorporate lower-order divergence terms. This work naturally extends the boundedness theory for uniformly parabolic equations, with matching exponents for the coefficients.}, archive = {J_JDE}, author = {Mingyi Hou}, doi = {10.1016/j.jde.2025.113794}, journal = {Journal of Differential Equations}, month = {2}, pages = {113794}, shortjournal = {J. Diff. Equ.}, title = {Boundedness of weak solutions to degenerate kolmogorov equations of hypoelliptic type in bounded domains}, volume = {453}, year = {2026}, }
• (2026). Convergence towards discontinuous patterns for a degenerate reaction-diffusion system with a non-monotone term. JDE, 453, 113793. (www)

  @article{ , abstract = {In this paper, we establish new results on the dynamics of a degenerate reaction-diffusion system with hysteresis. Our model determines the evolution of a biological system characterized by the interaction between a sedentary species and a diffusive species. It can be notably applied in forest ecology and in microbiology. We prove the existence of an infinite family of discontinuous stationary solutions using a generalized Mountain Pass Theorem, and analyze the continuity of this family, through an original method based on the convergence of generalized Clarke gradients. We show that the discontinuity interface of the heterogeneous patterns is very sensitive with respect to a variation of the initial condition. Furthermore, we prove a new theorem of convergence towards discontinuous patterns, which shows that the basin of attraction of each pattern contains a non-trivial set of initial conditions.}, archive = {J_JDE}, author = {Guillaume Cantin}, doi = {10.1016/j.jde.2025.113793}, journal = {Journal of Differential Equations}, month = {2}, pages = {113793}, shortjournal = {J. Diff. Equ.}, title = {Convergence towards discontinuous patterns for a degenerate reaction-diffusion system with a non-monotone term}, volume = {453}, year = {2026}, }
• (2026). Gauge transformation for the kinetic derivative nonlinear schrödinger equation on the torus. JDE, 453, 113792. (www)

  @article{ , abstract = {We consider the kinetic derivative nonlinear Schrödinger equation, which is a one-dimensional nonlinear Schrödinger equation with a cubic derivative nonlinear term containing the Hilbert transformation. In our previous work, we proved small-data global well-posedness of the Cauchy problem on the torus in Sobolev space H s for s > 1 / 2 by combining the Fourier restriction norm method with the parabolic smoothing effect, which is available in the periodic setting. In this article, we improve the regularity range to s > 1 / 4 for the global well-posedness by constructing an effective gauge transformation. Moreover, we remove the smallness assumption by making use of the dissipative nature of the equation.}, archive = {J_JDE}, author = {Nobu Kishimoto and Yoshio Tsutsumi}, doi = {10.1016/j.jde.2025.113792}, journal = {Journal of Differential Equations}, month = {2}, pages = {113792}, shortjournal = {J. Diff. Equ.}, title = {Gauge transformation for the kinetic derivative nonlinear schrödinger equation on the torus}, volume = {453}, year = {2026}, }
• (2026). Smoothness of the inertial manifold via the spatial averaging principle. JDE, 453, 113790. (www)

  @article{ , abstract = {This paper investigates the C n , ε | { n ≥ 2 , ε ∈ ( 0 , 1 ) } -smoothness of the inertial manifold for an abstract semilinear parabolic equation. Compared with the known results, the required spectral gap condition has been relaxed by applying the principle of spatial averaging initially proposed by J. Mallet-Paret and G. Sell in 1988.}, archive = {J_JDE}, author = {Ziqi Niu and Xinhua Li and Chunyou Sun}, doi = {10.1016/j.jde.2025.113790}, journal = {Journal of Differential Equations}, month = {2}, pages = {113790}, shortjournal = {J. Diff. Equ.}, title = {Smoothness of the inertial manifold via the spatial averaging principle}, volume = {453}, year = {2026}, }
• (2026). The reflection coefficient of a fractional reflector. JDE, 453, 113788. (www)

  @article{ , abstract = {This paper considers the question of characterizing the behavior of waves reflected by a fractional singularity of the wave speed profile, i.e., of the form c ( x 1 , x 2 , x 3 ) = c 0 ( 1 + ( x 1 ℓ ) + α ) − 1 / 2 , for α > 0 not necessarily integer. We first focus on the case of one spatial dimension and a harmonic time dependence. We define the reflection coefficient R from a limiting absorption principle. We provide an exact formula for R in terms of the solution to a Volterra equation. We obtain the asymptotic limit of this coefficient in the large ℓ ω / c 0 regime as R = Γ ( α + 1 ) ( 2 i ) α + 2 ( c 0 ℓ ω ) α + lower order terms. The amplitude is proportional to ω − α , and the phase rotation behavior is obtained from the i − ( α + 2 ) factor. The proof method does not rely on representing the solution by special functions, since α > 0 is general. In the multi-dimensional layered case, we obtain a similar result where the nondimensional variable ℓ ω / c 0 is modified to account for the angle of incidence. The asymptotic analysis now requires the waves to be non-glancing. The resulting reflection coefficient can now be interpreted as a Fourier multiplier of order − α . In practice, the knowledge of the dependency of both the amplitude and the phase of R on ω and α might be able to inform the kind of signal processing needed to characterize the fractional nature of reflectors, for instance in geophysics.}, archive = {J_JDE}, author = {Laurent Demanet and Olivier Lafitte}, doi = {10.1016/j.jde.2025.113788}, journal = {Journal of Differential Equations}, month = {2}, pages = {113788}, shortjournal = {J. Diff. Equ.}, title = {The reflection coefficient of a fractional reflector}, volume = {453}, year = {2026}, }
• (2026). Traveling motility of actin lamellar fragments under spontaneous symmetry breaking. JDE, 453, 113787. (www)

  @article{ , abstract = {Cell motility is connected to the spontaneous symmetry breaking of a circular shape. In [8] , Blanch-Mercader and Casademunt performed a nonlinear analysis of the minimal model proposed by Callan and Jones [11] and numerically conjectured the existence of traveling solutions once that symmetry is broken. In this work, we prove analytically that conjecture by means of nonlinear bifurcation techniques.}, archive = {J_JDE}, author = {Claudia García and Martina Magliocca and Nicolas Meunier}, doi = {10.1016/j.jde.2025.113787}, journal = {Journal of Differential Equations}, month = {2}, pages = {113787}, shortjournal = {J. Diff. Equ.}, title = {Traveling motility of actin lamellar fragments under spontaneous symmetry breaking}, volume = {453}, year = {2026}, }
• (2026). Smooth koopman eigenfunctions. JDE, 453, 113786. (www)

  @article{ , abstract = {Any dynamical system, whether it is generated by a differential equation or a transformation map on a manifold, induces a dynamics on functional-spaces. The choice of functional-space may vary, but the induced dynamics is always linear, and codified by the Koopman operator. The eigenfunctions of the Koopman operator are of extreme importance in the study of the dynamics. They provide a clear distinction between the mixing and non-mixing components of the dynamics, and also reveal embedded toral rotations. The usual choice of functional-space is L 2 , a class of square integrable functions. A fundamental problem with eigenfunctions in L 2 is that they are often extremely discontinuous, particularly if the system is chaotic. There are some prototypical systems called skew-product dynamics in which L 2 Koopman eigenfunctions are also smooth. The article shows that under general assumptions on an ergodic system, these prototypical examples are the only possibility. Moreover, the smooth eigenfunctions can be used to create a change of variables which explicitly characterizes the weakly mixing component too.}, archive = {J_JDE}, author = {Suddhasattwa Das}, doi = {10.1016/j.jde.2025.113786}, journal = {Journal of Differential Equations}, month = {2}, pages = {113786}, shortjournal = {J. Diff. Equ.}, title = {Smooth koopman eigenfunctions}, volume = {453}, year = {2026}, }
• (2026). Existence and approximation of measure attractors and invariant measures for McKean-vlasov stochastic lattice system with lévy noise. JDE, 453, 113784. (www)

  @article{ , abstract = {This paper is devoted to the existence and approximation of measure attractors and invariant measures for superlinear McKean-Vlasov stochastic reaction-diffusion lattice system driven by Lévy noise. We firstly prove the well-posedness of solutions by the fixed point arguments. Then by the uniform pullback estimates and tail-ends estimates of solutions, we establish the pullback asymptotic compactness of non-autonomous dynamical systems generated by the solution operators in a space of probability measures, and further obtain the existence and upper semicontinuity of measure attractors. Moreover, we yield the existence and uniqueness of invariant measures as well as ergodicity of the solutions under additional conditions. In addition, the convergence rate of invariant measures is provided when distribution dependent stochastic system converges to distribution independent one. Finally, the finite-dimensional approximations of measure attractors and invariant measures are investigated between such lattice system and its finite-dimensional truncated system, which are useful for studying numerical invariant measures.}, archive = {J_JDE}, author = {Fan Bai and Zhang Chen and Xiaoxiao Sun}, doi = {10.1016/j.jde.2025.113784}, journal = {Journal of Differential Equations}, month = {2}, pages = {113784}, shortjournal = {J. Diff. Equ.}, title = {Existence and approximation of measure attractors and invariant measures for McKean-vlasov stochastic lattice system with lévy noise}, volume = {453}, year = {2026}, }
• (2026). Nonexistence of solutions to parabolic problems with a potential on weighted graphs. JDE, 453, 113782. (www)

  @article{ , abstract = {We investigate nonexistence of nontrivial nonnegative solutions to a class of semilinear parabolic equations with a positive potential, posed on weighted graphs. Assuming an upper bound on the Laplacian of the distance and a suitable weighted space-time volume growth condition, we show that no global solutions exist. We also discuss the optimality of the hypotheses, thus recovering a critical exponent phenomenon of Fujita type.}, archive = {J_JDE}, author = {Dario D. Monticelli and Fabio Punzo and Jacopo Somaglia}, doi = {10.1016/j.jde.2025.113782}, journal = {Journal of Differential Equations}, month = {2}, pages = {113782}, shortjournal = {J. Diff. Equ.}, title = {Nonexistence of solutions to parabolic problems with a potential on weighted graphs}, volume = {453}, year = {2026}, }

JMAA - 21

• (2026). A novel approach to explore mittag-leffler-laguerre polynomials via symbolic method. JMAA, 556(1), 130104. (www)

  @article{ , abstract = {This article develops the theory of two-variable Mittag-Leffler-Laguerre polynomials by employing a generating function based on 0 th -order Tricomi functions and leveraging the symbolic method as a foundational framework. Key results include the derivation of the generating function, series representation, symbolic partial differential relations, multiplicative and derivative operators, differential equations, and integral representations for two-variable Mittag-Leffler-Laguerre polynomials. Additionally, Lie-theoretic generating relations are explored through the Lie-Mon technique, emphasizing their algebraic structure. Specific cases for special parameter values ρ , and θ are analyzed, with visual representations illustrating their properties. The study concludes by reducing the two-variable Mittag-Leffler-Laguerre polynomials to one-variable Mittag-Leffler-Laguerre polynomials, presenting graphical representations, and summarizing related results. These findings provide a comprehensive framework for understanding and extending the properties of Mittag-Leffler-Laguerre polynomials in multiple dimensions.}, archive = {J_JMAA}, author = {Maryam Salem Alatawi}, doi = {10.1016/j.jmaa.2025.130104}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130104}, shortjournal = {J. Math. Anal. Appl.}, title = {A novel approach to explore mittag-leffler-laguerre polynomials via symbolic method}, volume = {556}, year = {2026}, }
• (2026). Saddle-point structure of fixed points in a reaction-diffusion equation with discontinuous nonlinearity. JMAA, 556(1), 130103. (www)

  @article{ , abstract = {In this paper, we study the local behaviour of solutions near the fixed points of a reaction-diffusion equation with discontinuous nonlinearity. By employing an appropriate linearization around the fixed points, which involves the Dirac delta distribution, we analyze the stability of the stationary solutions and demonstrate that they exhibit a saddle-point structure. As a result, we establish the hyperbolicity of the fixed points.}, archive = {J_JMAA}, author = {José Valero}, doi = {10.1016/j.jmaa.2025.130103}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130103}, shortjournal = {J. Math. Anal. Appl.}, title = {Saddle-point structure of fixed points in a reaction-diffusion equation with discontinuous nonlinearity}, volume = {556}, year = {2026}, }
• (2026). Beyond operator systems. JMAA, 556(1), 130102. (www)

  @article{ , abstract = {Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying structure of operator systems, our work shows that these can be promoted to far more general structures. For instance, we prove a general extension theorem which unifies the well-known homomorphism theorem, Riesz' extension theorem, Farkas' lemma and Arveson's extension theorem. On the other hand, the same theorem gives rise to new vector-valued extension theorems, even for invariant maps, when applied to other underlying structures. We also prove generalized versions of the Choi–Kraus representation, Choi–Effros theorem, duality of operator systems, factorizations of completely positive maps, and more, leading to new results even for operator systems themselves. In addition, our proofs are shorter and simpler, revealing the interplay between cones and tensor products, captured elegantly in terms of star autonomous categories. This perspective gives rise to new connections between group representations, mapping cones and topological quantum field theory, as they correspond to different instances of our framework and are thus siblings of operator systems. A short video abstract can be found here}, archive = {J_JMAA}, author = {Gemma De les Coves and Mirte van der Eyden and Tim Netzer}, doi = {10.1016/j.jmaa.2025.130102}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130102}, shortjournal = {J. Math. Anal. Appl.}, title = {Beyond operator systems}, volume = {556}, year = {2026}, }
• (2026). Algebraic properties of small hankel operators on the fock space. JMAA, 556(1), 130101. (www)

  @article{ , abstract = {In this paper, we investigate some algebraic properties of small Hankel operators with analytic symbols on the Fock space, since a small Hankel operator on the Fock space depends only on the analytic part of its symbol. Let ψ be an analytic polynomial and φ be a function in the Fock space such that small Hankel operator Γ φ is bounded. We completely solve the zero-product problem and the commutativity problem for Γ φ and Γ ψ . Moreover, we also establish necessary and sufficient conditions for the product of those two small Hankel operators to be equal to another small Hankel operator on the Fock space.}, archive = {J_JMAA}, author = {Jie Zhang and Xianfeng Zhao}, doi = {10.1016/j.jmaa.2025.130101}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130101}, shortjournal = {J. Math. Anal. Appl.}, title = {Algebraic properties of small hankel operators on the fock space}, volume = {556}, year = {2026}, }
• (2026). Quasi-beurling dimensions of the spectra for a class of moran measures on the plane. JMAA, 556(1), 130098. (www)

  @article{ , abstract = {In this paper, we study the quasi-Beurling dimensions of the spectra for a class of planar Moran measures μ { M k } , D and obtain the exact upper and lower bounds of the quasi-Beurling dimensions under some conditions. Moreover, we prove an intermediate value property, i.e., for any t ∈ [ 0 , dim ‾ e μ { M k } , D ] , there exists a spectrum Λ t of μ such that dim q B ⁡ Λ t = t , where dim ‾ e μ { M k } , D denotes the upper entropy dimension of μ { M k } , D and dim q B ⁡ Λ t denotes the quasi-Beurling dimension of Λ t .}, archive = {J_JMAA}, author = {Zong-Sheng Liu and Hong-Guang Li and Fan Zhang and Kai-Li Zhang}, doi = {10.1016/j.jmaa.2025.130098}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130098}, shortjournal = {J. Math. Anal. Appl.}, title = {Quasi-beurling dimensions of the spectra for a class of moran measures on the plane}, volume = {556}, year = {2026}, }
• (2026). On the domain and growth rate of the solutions to linear systems of moment differential equations. JMAA, 556(1), 130097. (www)

  @article{ , abstract = {The domain of definition of the solutions to linear systems of moment differential equations is provided in terms of the growth of the sequence of moments. The growth rate of the solutions near infinity is described for systems admitting entire solutions: first, in terms of the associated function related to a weight sequence; second in terms of the order and type of an entire function. Further information is detailed when considering logarithmic order and types.}, archive = {J_JMAA}, author = {Antonio Cáceres and Alberto Lastra}, doi = {10.1016/j.jmaa.2025.130097}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130097}, shortjournal = {J. Math. Anal. Appl.}, title = {On the domain and growth rate of the solutions to linear systems of moment differential equations}, volume = {556}, year = {2026}, }
• (2026). Global analysis on a nonlinear diffusion system with fear effect, protection zone and ivlev functional response. JMAA, 556(1), 130096. (www)

  @article{ , abstract = {This paper investigates a novel nonlinear diffusive Ivlev-type predator-prey system that synergistically integrates fear effect and protection zone. By analyzing bifurcation structure of positive steady-states emanating from semi-trivial steady-states, and employing Leray-Schauder degree theory, we characterize how these combined factors dictate the multiplicity, uniqueness and stability of positive steady-states. Additionally, we examine the asymptotic behaviors of positive steady-states induced by the predator growth rate and prey diffusion rate. The long-term dynamical behaviors of the system are finally revealed. The findings reveal that the interplay of fear effect, protection zone and Ivlev-type interaction term generates unprecedented dynamical regimes in traditional models with fewer ecological factors, and offers both theoretical insights into complex ecosystems and practical guidance for conservation strategies. Biologically speaking, such joint effects help to showcase their synergistic roles in shaping population dynamics and ecological stability.}, archive = {J_JMAA}, author = {Daoxin Qiu and Yunfeng Jia and Shengqiang Liu}, doi = {10.1016/j.jmaa.2025.130096}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130096}, shortjournal = {J. Math. Anal. Appl.}, title = {Global analysis on a nonlinear diffusion system with fear effect, protection zone and ivlev functional response}, volume = {556}, year = {2026}, }
• (2026). Existence of optimal periodic strategies in a model with nonlocal spatiotemporal dispersal. JMAA, 556(1), 130095. (www)

  @article{ , abstract = {In this paper, we investigate a control problem for a nonlinear integro-differential system incorporating both spatial and temporal nonlocal terms, subject to periodic condition in time. The equation, derived from population dynamics, describes the evolution of population density under growth, migration, and memory effects. The control set is feedback-based and spatially nonlocal, depending on a weighted integral of the state. We establish the existence of controlled trajectories that approximate the infimum or supremum of a cost functional with arbitrary precision. Moreover, under additional regularity assumptions on the bounding functions of the control set, we provide the existence of truly optimal controlled trajectories. The analysis employs topological methods in nonlinear analysis and tailored techniques to address temporal nonlocalities.}, archive = {J_JMAA}, author = {Paola Rubbioni}, doi = {10.1016/j.jmaa.2025.130095}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130095}, shortjournal = {J. Math. Anal. Appl.}, title = {Existence of optimal periodic strategies in a model with nonlocal spatiotemporal dispersal}, volume = {556}, year = {2026}, }
• (2026). High-frequency stability estimates for the inverse boundary value problems for the schrödinger and the biharmonic operator with constant attenuation on certain bounded domains. JMAA, 556(1), 130094. (www)

  @article{ , abstract = {We explore high-frequency stability estimates for the determination of the zeroth-order perturbation of the Schrödinger and the biharmonic operators with constant attenuation from the partial Dirichlet-to-Neumann map when part of the boundary is inaccessible and flat. The results are derived under mild regularity assumptions on the potential and extend the results of [21] and [28] in the presence of attenuation in such domains.}, archive = {J_JMAA}, author = {Anupam Pal Choudhury and Ajith Kumar T}, doi = {10.1016/j.jmaa.2025.130094}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130094}, shortjournal = {J. Math. Anal. Appl.}, title = {High-frequency stability estimates for the inverse boundary value problems for the schrödinger and the biharmonic operator with constant attenuation on certain bounded domains}, volume = {556}, year = {2026}, }
• (2026). Multi-bump solutions of the magnetic p-laplacian schrödinger equations with critical and logarithmic nonlinearities. JMAA, 556(1), 130093. (www)

  @article{ , abstract = {This paper focuses on the following magnetic p -Laplacian Schrödinger equations with critical and logarithmic nonlinearities in R N : − Δ p , A u + ( λ Z ( x ) + V ( x ) ) | u | p − 2 u = β | u | p − 2 u log ⁡ | u | p + | u | p ⁎ − 2 u , x ∈ R N , where N ≥ 3 , p ∈ [ 2 , N ) , Δ p , A = div ( | ∇ u + i A ( x ) u | p − 2 ( ∇ u + i A ( x ) u ) ) denotes the magnetic p -Laplacian, the magnetic potential A ∈ L l o c p ( R N , R N ) and the parameters λ , β ≥ 1 , Z ( x ) , V ( x ) : R N → R are the nonnegative continuous functions, p ⁎ = N p N − p is the Sobolev critical exponent. Applying variational methods, multiple multi-bump solutions for the above equation have been obtained. More precisely, our findings demonstrate that if the zero set of Z possesses several isolated connected components Ω 1 , ⋯ , Ω k such that the interior of Ω i is not empty and ∂Ω is smooth, then for λ ≥ 1 sufficiently large, a bump solution is confined in a neighborhood of ⋃ j ∈ Γ Ω j for every non-empty subset Γ ⊂ { 1 , ⋯ , k } . Furthermore, let λ ≥ 1 be large enough, we also show that the above equation has at least 2 k − 1 multi-bump solutions. The novelty and characteristic of this paper lie in the simultaneous appearance of critical and logarithmic nonlinearities in this equation, and the results in this paper extend the subcritical case [39] to the critical case.}, archive = {J_JMAA}, author = {Lulu Wei and Yueqiang Song}, doi = {10.1016/j.jmaa.2025.130093}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130093}, shortjournal = {J. Math. Anal. Appl.}, title = {Multi-bump solutions of the magnetic p-laplacian schrödinger equations with critical and logarithmic nonlinearities}, volume = {556}, year = {2026}, }
• (2026). New characterizations of muckenhoupt ap distance weights for p > 1. JMAA, 556(1), 130091. (www)

  @article{ , abstract = {We characterize the collection of sets E ⊂ R n for which there exists θ ∈ R ∖ { 0 } such that the distance weight w ( x ) = dist ( x , E ) θ belongs to the Muckenhoupt class A p , where p > 1 . These sets exhibit a certain balance between the small-scale and large-scale pores that constitute their complement—a property we show to be more general than the so-called weak porosity condition, which in turn, and according to recent results, characterizes the sets with associated distance weights in the A 1 case. Furthermore, we verify the agreement between this new characterization and the properties of known examples of distance weights, that are either A p weights or merely doubling weights, by means of a probabilistic approach that may be of interest by itself.}, archive = {J_JMAA}, author = {Ignacio Gómez Vargas}, doi = {10.1016/j.jmaa.2025.130091}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130091}, shortjournal = {J. Math. Anal. Appl.}, title = {New characterizations of muckenhoupt ap distance weights for p > 1}, volume = {556}, year = {2026}, }
• (2026). On generalized limits and ultrafilters. JMAA, 556(1), 130090. (www)

  @article{ , abstract = {Given an ideal I on ω , we denote by SL ( I ) the family of positive normalized linear functionals on ℓ ∞ which assign value 0 to all characteristic sequences of sets in I . We show that every element of SL ( I ) is a Choquet average of certain ultrafilter limit functionals. Also, we prove that the diameter of SL ( I ) is 2 if and only if I is not maximal, and that the latter claim can be considerably strengthened if I is meager. Lastly, we provide several applications: for instance, recovering a result of Freedman (1981) [19] , we show that the family of bounded sequences for which all functionals in SL ( I ) assign the same value coincides with the closed vector space of bounded I -convergent sequences.}, archive = {J_JMAA}, author = {Paolo Leonetti and Cihan Orhan}, doi = {10.1016/j.jmaa.2025.130090}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130090}, shortjournal = {J. Math. Anal. Appl.}, title = {On generalized limits and ultrafilters}, volume = {556}, year = {2026}, }
• (2026). Finsler N-laplace equations with critical exponential nonlinearity. JMAA, 556(1), 130089. (www)

  @article{ , abstract = {In this article, we investigate some anisotropic equations involving the Finsler N -Laplace operator Δ H , N , with Trudinger-Moser type critical exponential nonlinearity which involves the anisotropic norm. More precisely, we establish the existence of nontrivial solutions to the problem − Δ H , N u = f ( x , u ) , u ≥ 0 in Ω , on a smooth bounded domain Ω ⊂ R N , N ≥ 2 , and to the anisotropic quasilinear Schrödinger problem − Δ H , N u + V ( x ) | u | N − 2 u = g ( x , u ) , u ≥ 0 in R N . Here the nonlinearities f and g exhibit critical exponential-type growth, and the potential V is a continuous function that retains the compactness of the associated Sobolev embedding into a larger class of Lebesgue spaces under suitable assumptions. We obtain the existence results by employing the anisotropic Trudinger-Moser inequality, mountain-pass theorem, and Ekeland's variational principle.}, archive = {J_JMAA}, author = {Monti Das and Sweta Tiwari}, doi = {10.1016/j.jmaa.2025.130089}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130089}, shortjournal = {J. Math. Anal. Appl.}, title = {Finsler N-laplace equations with critical exponential nonlinearity}, volume = {556}, year = {2026}, }
• (2026). Killing mean curvature solitons from riemannian submersions. JMAA, 556(1), 130088. (www)

  @article{ , abstract = {We present a new general construction of mean curvature flow solitons on manifolds admitting a nowhere-vanishing Killing vector field. Using Riemannian submersion techniques, we reduce the problem from a PDE to an ODE. As an application, we obtain new examples of rotators in hyperbolic space.}, archive = {J_JMAA}, author = {Diego Artacho and Marie-Amélie Lawn and Miguel Ortega}, doi = {10.1016/j.jmaa.2025.130088}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130088}, shortjournal = {J. Math. Anal. Appl.}, title = {Killing mean curvature solitons from riemannian submersions}, volume = {556}, year = {2026}, }
• (2026). Boundedness in an attraction-repulsion chemotaxis system with indirect repulsion-signal production. JMAA, 556(1), 130087. (www)

  @article{ , abstract = {This paper studies the following attraction-repulsion chemotaxis system involving nonlinear indirect signal mechanism { u t = Δ u − ξ ∇ ⋅ ( u ∇ v ) + χ ∇ ⋅ ( u ∇ z ) + f ( u ) , x ∈ Ω , t > 0 , 0 = Δ v − v + u γ 1 , x ∈ Ω , t > 0 , z t = Δ z − z + w γ 2 , x ∈ Ω , t > 0 , 0 = Δ w − w + u γ 3 , x ∈ Ω , t > 0 , under homogeneous Neumann boundary conditions, where Ω ⊂ R n ( n ≥ 1 ) is a smoothly bounded domain and ξ , χ , γ 1 , γ 2 , γ 3 > 0 . • When f ≡ 0 , it is shown that the solution of the above system is global and uniformly bounded if max ⁡ { γ 1 , γ 2 γ 3 } < 2 n . Moreover, if max ⁡ { γ 1 , γ 2 γ 3 } = 2 n , the boundedness of solution can be derived provided that the initial mass ∫ Ω u 0 ( x ) d x is small. • When f ( u ) ≤ u ( a − b u k ) with a , b , k > 0 , it is proved that if one of the following conditions holds: (i) k > max ⁡ { γ 1 , γ 2 γ 3 } , (ii) k = max ⁡ { γ 1 , γ 2 γ 3 } , (iii) max ⁡ { γ 1 , γ 2 γ 3 } < 2 n , then the solution is globally bounded in time provided that b is large enough.}}, archive = {J_JMAA}, author = {Wei Wang and Pan Zheng}, doi = {10.1016/j.jmaa.2025.130087}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130087}, shortjournal = {J. Math. Anal. Appl.}, title = {Boundedness in an attraction-repulsion chemotaxis system with indirect repulsion-signal production}, volume = {556}, year = {2026}, }
• (2026). Synchronization of velocities in pipeline flow of blended gas. JMAA, 556(1), 130078. (www)

  @article{ , abstract = {We consider the pipeline flow of blended gas. The flow is governed by a coupled system where for each component we have the isothermal Euler equations with an additional velocity coupling term that couples the velocities of the different components. Our motivation is hydrogen blending in natural gas pipelines, which will play a role in the transition to renewable energies. We show that with suitable boundary conditions the velocities of the gas components synchronize exponentially fast, as long as the L 2 -norm of the synchronization error is outside of a certain interval where the size of the interval is determined by the order of the interaction terms. This indicates that in some cases for a mixture of n components it is justified to use a drift-flux model where it is assumed that all components flow with the same velocity. For the proofs we use an appropriately chosen Lyapunov function which is based upon the idea of relative energy.}, archive = {J_JMAA}, author = {Martin Gugat}, doi = {10.1016/j.jmaa.2025.130078}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130078}, shortjournal = {J. Math. Anal. Appl.}, title = {Synchronization of velocities in pipeline flow of blended gas}, volume = {556}, year = {2026}, }
• (2026). Global solvability and stability of cognitive consumer-resource model with nonlocal usage of memory. JMAA, 556(1), 130076. (www)

  @article{ , abstract = {In this paper, we formulate a consumer-resource system incorporating dynamic cognitive mapping and nonlocal memory integration. The model represents resource perception using a spatial convolution kernel, capturing nonlocal interactions between consumers and their environment. We establish the global existence of classical solutions under periodic boundary conditions in two spatial dimensions and demonstrate the global stability of homogeneous steady states within specific parameter regimes. Additionally, numerical simulations are conducted to explore the influence of the perception radius R on system dynamics. Our results reveal that the perception radius plays a pivotal role in inducing phase transitions from uniform states to complex spatiotemporal patterns, underscoring the significance of cognitive sensing scales in ecological self-organization.}, archive = {J_JMAA}, author = {Xuebing Zhang and Qi An and Hao Wang}, doi = {10.1016/j.jmaa.2025.130076}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130076}, shortjournal = {J. Math. Anal. Appl.}, title = {Global solvability and stability of cognitive consumer-resource model with nonlocal usage of memory}, volume = {556}, year = {2026}, }
• (2026). C⁎-supports and abnormalities of operator systems. JMAA, 556(1), 130074. (www)

  @article{ , abstract = {Let S be a concrete operator system represented on some Hilbert space H . A C ⁎ -support of S is the C ⁎ -algebra generated (via the Choi–Effros product) by S inside an injective operator system acting on H . By leveraging Hamana's theory, we show that such a C ⁎ -support is unique precisely when C ⁎ ( S ) (the C ⁎ -algebra generated in B ( H ) with the usual product) is contained in every copy of the injective envelope of S that acts on H . Further, we demonstrate how the uniqueness of certain C ⁎ -supports can be used to give new characterizations of the unique extension property for ⁎-representations, as well as the hyperrigidity of S . In another direction, we utilize the collection of all C ⁎ -supports of S to describe the subspace generated by the so-called abnormalities of S , thereby complementing an earlier result of Kakariadis.}, archive = {J_JMAA}, author = {Raphaël Clouâtre and Colin Krisko}, doi = {10.1016/j.jmaa.2025.130074}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130074}, shortjournal = {J. Math. Anal. Appl.}, title = {C⁎-supports and abnormalities of operator systems}, volume = {556}, year = {2026}, }
• (2026). An extension of the spectral fractional laplacian to non-homogeneous boundary condition on rectangular domains, with application to well-posedness for plate equation with structural damping. JMAA, 556(1), 130073. (www)

  @article{ , abstract = {Let Δ be the Dirichlet Laplacian on a rectangular domain R ⊂ R N . We study the mapping properties of an extension of the spectral fractional Laplacian, ( − Δ ) α , for α ∈ [ 0 , 1 ) , when applied to functions satisfying non-homogeneous boundary conditions. A symmetry formula is proven. As an application, we prove well-posedness results for the structurally damped plate equation u t t + Δ 2 u + ρ ( − Δ ) α u t = 0 , x ∈ R , t > 0 , with non-homogeneous boundary conditions u | ∂ R = f , Δ u | ∂ R = 0 , f ∈ L 2 ( ∂ R × [ 0 , ∞ ) ) . Other non-homogeneous boundary conditions are also considered.}, archive = {J_JMAA}, author = {Julian Edward}, doi = {10.1016/j.jmaa.2025.130073}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130073}, shortjournal = {J. Math. Anal. Appl.}, title = {An extension of the spectral fractional laplacian to non-homogeneous boundary condition on rectangular domains, with application to well-posedness for plate equation with structural damping}, volume = {556}, year = {2026}, }
• (2026). Transverse FT-entropy for riemannian foliations. JMAA, 556(1), 130070. (www)

  @article{ , abstract = {In this paper, we introduce an entropy functional on Riemannian foliations, inspired by the work of Perelman. We relate its gradient flow to the transverse Ricci flow via the foliation preserving diffeomorphisms. We show that it is monotonic along the transverse Ricci flow. Moreover, inspired by the work of Fuquan Fang and Yuguang Zhang, we give a sufficient condition for any codimension-4 Riemannian foliation to admit the transverse Einstein metric.}, archive = {J_JMAA}, author = {Dexie Lin}, doi = {10.1016/j.jmaa.2025.130070}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130070}, shortjournal = {J. Math. Anal. Appl.}, title = {Transverse FT-entropy for riemannian foliations}, volume = {556}, year = {2026}, }
• (2026). Range-exclusive solutions of almost automorphic differential equations. JMAA, 556(1), 130067. (www)

  @article{ , abstract = {We present a unified approach to establishing the existence of almost automorphic solutions to differential equations in Banach spaces. We introduce the concept of solutions having exclusive ranges for differential equations of the form u ′ = f ( t , u ) in a Banach space X , where f is almost automorphic in time t . The proposed methodology unifies classical techniques, covering cases where nonlinearities are globally Lipschitz with exponentially stable linear parts, as well as differential equations without global Lipschitz nonlinearities. The main result shows that, under certain conditions on f , every solution with an exclusive range is compactly almost automorphic. To illustrate the versatility of the developed approach, we provide several examples and applications, including a Bohr–Neugebauer type theorem and the analysis of differential equations possessing multiple and unique almost automorphic solutions.}, archive = {J_JMAA}, author = {B. Es-sebbar and Z. Zizi}, doi = {10.1016/j.jmaa.2025.130067}, journal = {Journal of Mathematical Analysis and Applications}, month = {4}, number = {1}, pages = {130067}, shortjournal = {J. Math. Anal. Appl.}, title = {Range-exclusive solutions of almost automorphic differential equations}, volume = {556}, year = {2026}, }